problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | replace | 32 | 33 | 32 | 33 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> eeai(N, 0);
vector<int> biiai(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> eeai.at(i);
}
for (int i = N; i > 0; i--) {
count = 0;
for (int j = 0; j < N; j++) {
if ((j + 1) % i == 0)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> eeai(N, 0);
vector<int> biiai(N, 0);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> eeai.at(i);
}
for (int i = N; i > 0; i--) {
count = 0;
for (int j = i; j < N + 1; j += i) {
if (j % i == 0... | replace | 16 | 19 | 16 | 19 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//--------... | replace | 183 | 186 | 183 | 185 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf ... | delete | 1 | 4 | 1 | 1 | 0 | |
p02972 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
// const ll mod=998244353;
const ll mod = 1000000007;
ll gcd(ll a... | replace | 44 | 45 | 44 | 45 | 0 | |
p02972 | Python | Time Limit Exceeded | from sys import stdin
def main():
N = int(stdin.readline().rstrip())
As = [int(x) for x in stdin.readline().rstrip().split()]
result = [0 for _ in range(N)]
for i, a in enumerate(As[::-1]):
num = N - i
idx = num - 1
if N // num < 2:
result[idx] = a
else:
... | from sys import stdin
def main():
N = int(stdin.readline().rstrip())
As = [int(x) for x in stdin.readline().rstrip().split()]
result = [0 for _ in range(N)]
for i, a in enumerate(As[::-1]):
num = N - i
idx = num - 1
if N // num < 2:
result[idx] = a
else:
... | replace | 13 | 14 | 13 | 20 | TLE | |
p02972 | Python | Runtime Error | N = int(input())
a = list(map(int, input().split()))
t = [0] * N
for i in range(N - 1, -1, -1):
t[i] = (sum(t[2 * (i + 1) - 1 :: i]) % 2) ^ a[i]
print(sum(t))
print(*[i + 1 for i in range(N) if t[i] == 1])
| N = int(input())
a = list(map(int, input().split()))
t = [0] * N
for i in range(N - 1, -1, -1):
t[i] = (sum(t[2 * (i + 1) - 1 :: i + 1]) % 2) ^ a[i]
print(sum(t))
print(*[i + 1 for i in range(N) if t[i] == 1])
| replace | 5 | 6 | 5 | 6 | ValueError: slice step cannot be zero | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s365219568.py", line 6, in <module>
t[i] = (sum(t[2 * (i + 1) - 1::i]) % 2) ^ a[i]
ValueError: slice step cannot be zero
|
p02972 | Python | Runtime Error | n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(n // 2, 0, -1):
a[i] ^= a[i * 2 :: i]
s = [i for i, b in enumerate(a) if b]
print(len(s))
print(*s)
| n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(n // 2, 0, -1):
a[i] = sum(a[i::i]) % 2
s = [i for i, b in enumerate(a) if b]
print(len(s))
print(*s)
| replace | 3 | 4 | 3 | 4 | TypeError: unsupported operand type(s) for ^=: 'int' and 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s635052130.py", line 4, in <module>
a[i] ^= a[i * 2::i]
TypeError: unsupported operand type(s) for ^=: 'int' and 'list'
|
p02972 | Python | Runtime Error | n = int(input())
a = input()
r = [None] * (n + 1)
for i in range(n, 0, -1):
r[i] = (ord(a[2 * i - 1]) + sum(r[i * 2 :: i])) % 2
print(r.count(1))
print(*(i for i, x in enumerate(r) if x))
| n = int(input())
a = input()
r = [None] * (n + 1)
for i in range(n, 0, -1):
r[i] = (ord(a[2 * i - 2]) + sum(r[i * 2 :: i])) % 2
print(r.count(1))
print(*(i for i, x in enumerate(r) if x))
| replace | 4 | 5 | 4 | 5 | IndexError: string index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s316789031.py", line 5, in <module>
r[i] = (ord(a[2 * i - 1]) + sum(r[i * 2::i])) % 2
IndexError: string index out of range
|
p02972 | C++ | Runtime Error | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j * j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for... | #include <cstdio>
const int MAXN = 2e5 + 5;
int A[MAXN]{};
int B[MAXN]{};
int M, N;
int count_up(int i) {
int sum = 0;
for (int j = i; j <= N; j += i) {
if (B[j])
sum ^= 1;
}
return sum;
}
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &A[i]);
}
M = 0;
for (in... | replace | 8 | 9 | 8 | 9 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll ... | replace | 34 | 35 | 34 | 35 | TLE | |
p02972 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
int aa;
vector<int> a(n + 1);
rep(i, n) {
cin >> aa;
if (aa == 0) {
a[i + 1] = -1;
} else {
a[i + 1] = 1;
}
... | replace | 41 | 42 | 41 | 42 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
int main() {
int N;
ll a[300001];
ll b[300001];
int cnt(0);
cin >> N;
for (int i(1); i <= N; i++)
cin >> b[i];
for (int i(N / 2 + 1); i <= N; i++) {
a[i] = b[i];
if (a[i] == 1)
cnt += 1;
}
for (int... | replace | 21 | 23 | 21 | 22 | TLE | |
p02972 | Python | Runtime Error | n = int(input())
a = list(map(int, input().split()))
with open("testcase_12.in") as f:
n = int(f.readline())
a = list(map(int, f.readline().split()))
b = [-1] * n
for i in range(n, 0, -1):
cnt = sum(b[j - 1] for j in range(i + i, n + 1, i))
b[i - 1] = int(a[i - 1] != cnt % 2)
print(sum(b))
if sum(b) ... | n = int(input())
a = list(map(int, input().split()))
b = [-1] * n
for i in range(n, 0, -1):
cnt = sum(b[j - 1] for j in range(i + i, n + 1, i))
b[i - 1] = int(a[i - 1] != cnt % 2)
print(sum(b))
if sum(b) > 0:
print(*[i + 1 for i in range(n) if b[i] == 1])
| delete | 2 | 6 | 2 | 2 | FileNotFoundError: [Errno 2] No such file or directory: 'testcase_12.in' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02972/Python/s591544264.py", line 4, in <module>
with open('testcase_12.in') as f:
FileNotFoundError: [Errno 2] No such file or directory: 'testcase_12.in'
|
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int N;
vector<int> a, b;
int recursive(int i) {
int x = 0;
for (int k = 2; i * k <= N; k++) {
x += recursive(i * k);
}
return b[i] = (a[i] + x) & 1;
}
int ... | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
int N;
vector<int> a, b;
int recursive(int i) {
if (b[i] >= 0)
return b[i];
int x = 0;
for (int k = 2; i * k <= N; k++) {
x += recursive(i * k);
}
re... | insert | 8 | 8 | 8 | 10 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i++) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[200010], c[200010];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
c[i] = 0;
}
vector<int> v;
for (int i = n; i >= 1; i--) {
for (int j = i * 2; j <= n; j += i) {
a[i] ^= c[j];
}
c[i] = a[i];
if (c[i])
... | replace | 10 | 11 | 10 | 11 | -11 | |
p02972 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1];
int b[N + 1];
vector<int> v;
a[0] = 0;
b[0] = 0;
int count = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
a[i + 1] = 0... | replace | 35 | 39 | 35 | 39 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n) cin >> a[i + 1];
vector<int> b(n + 1);
for (int i = n; i >= 1; i--) {
int sum = 0;
for (int j ... | replace | 15 | 16 | 15 | 16 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i >= 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
... | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int b[200005];
int main() {
int n;
cin >> n;
int tmp;
int ans;
int count = 0;
for (int i = 1; i < n + 1; i++)
cin >> a[i];
for (int i = n; i > 0; i--) {
tmp = i;
ans = 0;
while (tmp <= n) {
ans += b[tmp];
tmp += i;
... | replace | 13 | 14 | 13 | 14 | TLE | |
p02972 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | replace | 46 | 47 | 46 | 47 | 0 | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[200010];
int b[200010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i];
}
for (int i = n; i >= 0; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i])... | #include <bits/stdc++.h>
using namespace std;
int a[200010];
int b[200010];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
b[i] = a[i];
}
for (int i = n; i >= 1; --i) {
int sum = 0;
for (int j = i; j <= n; j += i) {
sum += b[j];
}
if (sum % 2 != a[i])... | replace | 13 | 14 | 13 | 14 | TLE | |
p02972 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i <... | replace | 19 | 23 | 19 | 21 | TLE | |
p02972 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont)... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, end) rep2(i, 0, (end))
#define rep2(i, beg, end) for (int i = (beg); i < (end); i++)
#define all(cont)... | replace | 53 | 55 | 53 | 55 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
fo... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int64_t rll() {
long long n;
scanf("%lld", &n);
return n;
}
struct SegTree {
std::vector<int> data;
int n;
SegTree(int n_) {
for (n = 1; n < n_; n *= 2)
;
data.resize(2 * n);
}
void set(int i, int val) {
fo... | replace | 57 | 58 | 57 | 58 | 0 | |
p02973 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int counter = 0; counter < (int)(n); counter++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(... | replace | 0 | 1 | 0 | 1 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void nibutan(vector<int> &dp, int le, int ri, int c) {
if (ri - le == 1) {
dp[ri] = c;
return;
}
if (dp[(ri * le) / 2] < c) {
nibutan(dp, le, (le + ri) / 2, c);
} else {
nibutan(dp, (le + ri) / 2, ri, c);
}
}
int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void nibutan(vector<int> &dp, int le, int ri, int c) {
if (ri - le == 1) {
dp[ri] = c;
return;
}
if (dp[(ri + le) / 2] < c) {
nibutan(dp, le, (le + ri) / 2, c);
} else {
nibutan(dp, (le + ri) / 2, ri, c);
}
}
int... | replace | 10 | 11 | 10 | 11 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef int long long ll... | replace | 42 | 43 | 42 | 43 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int N;
vector<int> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) cin >> A[i];
multiset<int> v;
v.insert(A[0]);
for (int i = 1; i < N; i++) {
if (*v.begin() < A[i]) {
auto i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int N;
vector<int> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) cin >> A[i];
multiset<int> v;
v.insert(A[0]);
for (int i = 1; i < N; i++) {
if (*v.begin() < A[i]) {
auto i... | replace | 18 | 19 | 18 | 19 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
vector<int> id(n);
rep(i, n) {
auto it = s.lower_bound(a[i]);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<vector<int>> v;
multiset<int> s;
map<int, int> id;
rep(i, n) {
auto it = s.lower_bound(a[i]);
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using P = std::pair<ll, ll... | replace | 47 | 49 | 47 | 48 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int a[200010];
multiset<int> s;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
s.insert(a[1]);
for (int i = 2; i <= n; i++) {
if (a[i] <= *s.begin())
s.insert(a[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
int a[200010];
multiset<int> s;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", a + i);
s.insert(a[1]);
for (int i = 2; i <= n; i++) {
if (a[i] <= *s.begin())
s.insert(a[i]);
... | replace | 16 | 17 | 16 | 18 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
template <typename T>
typename std::vector<T>::iterator insert_sorted(std::vector<T> &vec,
T const &ite... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
template <typename T>
typename std::vector<T>::iterator insert_sorted(std::vector<T> &vec,
T const &ite... | replace | 37 | 38 | 37 | 38 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm... | delete | 25 | 26 | 25 | 25 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | replace | 91 | 92 | 91 | 92 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
multiset<ll> mp;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
auto itr = lower_bound(mp.begin(), mp.end(), a);
if (itr == mp.begin()) {
mp.insert(a);
} else {
itr--;
mp.era... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
multiset<ll> mp;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
auto itr = mp.lower_bound(a);
if (itr == mp.begin()) {
mp.insert(a);
} else {
itr--;
mp.erase(itr);
mp.i... | replace | 13 | 14 | 13 | 14 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i, n) for... | replace | 52 | 53 | 52 | 53 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
int main() {
cin.tie(0);
ios::s... | replace | 29 | 33 | 29 | 34 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 20000... | replace | 58 | 59 | 58 | 59 | TLE | |
p02973 | C++ | Runtime Error | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 998244353 // 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(... | /*
1. I'm the Future Red Coder :)
2. Hopefully, I'll be Yellow Soon.
*/
#include <bits/stdc++.h>
#define mod 1000000007
#define lim 1000000000000000007
#define lim1 18446744073709551615 // Unsigned
#define sq(a) ((a) * (a))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mms(v, i) memset(... | replace | 5 | 6 | 5 | 6 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector... | replace | 140 | 141 | 140 | 141 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | replace | 322 | 323 | 322 | 323 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | replace | 62 | 63 | 62 | 63 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD ... | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD ... | delete | 39 | 42 | 39 | 39 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue... | replace | 59 | 60 | 59 | 60 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll ... | replace | 36 | 41 | 36 | 39 | TLE | |
p02973 | Python | Runtime Error | from bisect import bisect
n = int(input())
ma = [-int(input()) for _ in range(n)]
ans = [ma[0]]
for ai in ma[1:]:
tmp = bisect(ans, ai)
if tmp == len(ans):
ans.append(ai)
elif tmp < len(ans):
ans[tmp] = ai
print(ans)
print(len(ans))
| from bisect import bisect
n = int(input())
ma = [-int(input()) for _ in range(n)]
ans = [ma[0]]
for ai in ma[1:]:
tmp = bisect(ans, ai)
if tmp == len(ans):
ans.append(ai)
elif tmp < len(ans):
ans[tmp] = ai
print(len(ans))
| delete | 12 | 13 | 12 | 12 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 10000000... | replace | 27 | 43 | 27 | 30 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | replace | 24 | 25 | 24 | 25 | TLE | |
p02973 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#i... | // #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#i... | replace | 136 | 137 | 136 | 138 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define... | replace | 46 | 47 | 46 | 47 | TLE | |
p02973 | C++ | Time Limit Exceeded | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | /*ver 5*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_... | replace | 270 | 271 | 270 | 271 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> mul;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
auto indx = lower_bound(mul.begin(), mul.end(), temp);
if (indx != mul.begin()) {
indx--;
mul.erase(indx);
mul.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
multiset<int> mul;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
auto indx = mul.lower_bound(temp);
if (indx != mul.begin()) {
indx--;
mul.erase(indx);
mul.insert(temp);
} ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()), ((x).end())
#define usecppio \
ios::sync_with_stdio(0); ... | replace | 21 | 22 | 21 | 22 | TLE | |
p02973 | C++ | Runtime Error | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using... | #include <functional>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using... | insert | 100 | 100 | 100 | 103 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vec... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define N 100000
typedef long long ll;
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) int(x.size())
#define OUT(a) cout << (a) << endl
#define VECIN(type, c, n) \
vec... | replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
using namespace st... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
using namespace st... | insert | 36 | 36 | 36 | 40 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int>
#define PP pair<P, int>
#define F first
#define S second
#define f(i, n) for (int i = 0; i < (n); i++)
#define INF LLONG_MAX / 3
#define eps LDBL_EPSILON
#define mod (int)(1000000007)
#define pie 3.141592653589793238462643383279
#define Bpri priori... | replace | 36 | 37 | 36 | 37 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define un... | replace | 34 | 35 | 34 | 35 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define INF 1e9
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j, k, t, l;
cin >> n;
int a[n + 5];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.1415926536
#define pb push_back
#define N 1000000007
#define M 998244353
#define INF 1e9
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, i, j, k, t, l;
cin >> n;
int a[n + 5];
... | replace | 20 | 21 | 20 | 21 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
reverse(a.begin(), a.end());
int ans = 1;
vector<int> p;
p.push_back(a[0]);
for (int i ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
reverse(a.begin(), a.end());
int ans = 1;
vector<int> p;
p.push_back(a[0]);
for (int i ... | delete | 19 | 20 | 19 | 19 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | replace | 30 | 35 | 30 | 33 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vect... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vect... | replace | 43 | 50 | 43 | 46 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> s;
rep(i, 0, n) {
ll a;
cin >> a;
auto ite = s.lower_bound(a);
if (ite != s.begin())
s.erase(ite--);
s.insert(a);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> s;
rep(i, 0, n) {
ll a;
cin >> a;
auto ite = s.lower_bound(a);
if (ite != s.begin()) {
ite--;
s.erase(ite);
}
... | replace | 13 | 15 | 13 | 17 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> min_color(N, 1);
vector<ll> color_min_val;
color_m... | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N, 0);
for (int i = 0; i < N; i++)
cin >> A[i];
vector<int> min_color(N, 1);
vector<ll> color_min_val;
color_m... | replace | 25 | 27 | 25 | 26 | TLE | |
p02973 | C++ | Time Limit Exceeded | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2... | // ヘッダー
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
// 定数
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2... | replace | 35 | 36 | 35 | 36 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n), b(0);
int ans = 1;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define pp pair<int, int>
#define ll long long
#define ld long double
int inf = 100000000;
ll INF = 4000000000000000000;
ll MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> a(n), b(0);
int ans = 1;
r... | delete | 31 | 32 | 31 | 31 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int lint;
int main() {
ulint N;
cin >> N;
vector<ulint> A;
for (int i = 0; i < N; ++i) {
ulint a;
cin >> a;
A.push_back(a);
}
vector<ulint> ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int lint;
int main() {
ulint N;
cin >> N;
vector<ulint> A;
for (int i = 0; i < N; ++i) {
ulint a;
cin >> a;
A.push_back(a);
}
vector<ulint> ... | replace | 24 | 29 | 24 | 32 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | replace | 43 | 44 | 43 | 44 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int MAX = 100001;
int main() {
int N;
int A[MAX];
deque<int> color;
cin >> N;
for (... | replace | 31 | 32 | 31 | 32 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; n++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | #include <bits/stdc++.h>
using namespace std;
int n, a, b[100005];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
a++;
*(lower_bound(b, b + n, a) - 1) = a;
}
printf("%d\n", n - (lower_bound(b, b + n, 1) - b));
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
signed main() {
ll n;
cin >> n;
multiset<ll, greater<ll>> t; // 見たならtrue
rep(i, n) {
ll a;
cin >> a;
auto itr = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
signed main() {
ll n;
cin >> n;
multiset<ll, greater<ll>> t; // 見たならtrue
rep(i, n) {
ll a;
cin >> a;
auto itr = ... | replace | 14 | 16 | 14 | 16 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn... | replace | 239 | 240 | 239 | 241 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | replace | 25 | 26 | 25 | 26 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
ll N;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[100005];
int main() {
ll N;
cin >... | replace | 24 | 25 | 24 | 25 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=nati... | replace | 63 | 64 | 63 | 69 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
... | replace | 26 | 29 | 26 | 27 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
reverse(vec.begin(), vec.end());
int INF = 100000000;
vector<int> dp(N, INF);
vector<int>::iterator pos;
int idx;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
reverse(vec.begin(), vec.end());
int INF = 1e9 + 10;
vector<int> dp(N, INF);
vector<int>::iterator pos;
int idx;
for (int i = 0; i < N; i++) {
p... | replace | 10 | 11 | 10 | 11 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int &i : a)
scanf("%d", &i);
multiset<int, greater<int>> ans;
for (int i : a) {
mult... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll MOD = 1000000007;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int &i : a)
scanf("%d", &i);
multiset<int, greater<int>> ans;
for (int i : a) {
mult... | replace | 20 | 27 | 20 | 23 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(... | replace | 146 | 147 | 146 | 147 | TLE | |
p02973 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = ... | replace | 0 | 1 | 0 | 1 | TLE | |
p02973 | C++ | Runtime Error | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>... | delete | 48 | 49 | 48 | 48 | -6 | double free or corruption (out)
|
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ... | replace | 45 | 46 | 45 | 46 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v... | #include <bits/stdc++.h>
// #define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
template <typename T> vector<T> make_v... | replace | 45 | 46 | 45 | 46 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
// #include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_ty... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
// #include<unordered_set>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
tree<int, null_ty... | replace | 47 | 48 | 47 | 48 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
// 各部分増加列の最大値を格納
vector<int> l;
l.push_back(A[N - 1]);
for (int i = N - 2; i >= 0; i--) {
sort(l.begin(), l.end());
// 一... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
// 各部分増加列の最大値を格納
vector<int> l;
l.push_back(A[N - 1]);
for (int i = N - 2; i >= 0; i--) {
// 一番でかいやつ以上なら、新たに部分草加列を作成
if ... | delete | 21 | 22 | 21 | 21 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
ll bin(vector<ll> vec, ll s, ll e, ll v) {
if (e - s > 1) {
ll mid = ((s + e) / 2);
if (vec[mid] >= v) {
return bin(vec, mid, e, v... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
ll bin(vector<ll> &vec, ll s, ll e, ll v) {
if (e - s > 1) {
ll mid = ((s + e) / 2);
if (vec[mid] >= v) {
return bin(vec, mid, e, ... | replace | 9 | 10 | 9 | 10 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
multiset<ll> mst;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld"... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(1e5 + 5);
int n;
ll a[MAX_N];
multiset<ll> mst;
int main(void) {
// Here your code !
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld"... | replace | 37 | 38 | 37 | 38 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.l... | #include <algorithm>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
int A[100010] = {};
for (int i = 0; i < N; i++)
cin >> A[i];
multiset<int> S;
S.insert(-1145141919);
S.insert(1145141919);
S.insert(A[0]);
for (int i = 1; i < N; i++) {
auto it = S.l... | replace | 20 | 21 | 20 | 21 | -6 | free(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n), B;
for (auto &a : A)
cin >> a;
for (auto i = A.rbegin(); i != A.rend(); i++) {
auto a = (*i);
auto j = upper_bound(B.begin(), B.end(), a);
if (j == B.end())
B.push_back(a... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> A(n), B;
for (auto &a : A)
cin >> a;
for (auto i = A.rbegin(); i != A.rend(); i++) {
auto a = (*i);
auto j = upper_bound(B.begin(), B.end(), a);
if (j == B.end())
B.push_back(a... | delete | 20 | 21 | 20 | 20 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int... | replace | 91 | 92 | 91 | 92 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> x;
for (int i = 0; i < n; ++i) {
ll a;
cin >> a;
auto it = lower_bound(x.begin(), x.end(), a);
if (it == x.begin()) {
x.insert(it... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
multiset<ll> x;
for (int i = 0; i < n; ++i) {
ll a;
cin >> a;
auto it = x.lower_bound(a);
if (it == x.begin()) {
x.insert(it, a);
} else {... | replace | 15 | 16 | 15 | 16 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) { cin >> A[i]; }
multiset<ll> st;
rep(i, N) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N;
vector<ll> A;
int main() {
cin >> N;
A.resize(N);
rep(i, N) { cin >> A[i]; }
multiset<ll> st;
rep(i, N) {... | replace | 18 | 19 | 18 | 20 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef LOCAL
#include <contest/local.hpp>
#else
#define LOG(...) \
do { \
} while (false)
#endif
#define REP(i, n) ... | #include <bits/stdc++.h>
#ifdef LOCAL
#include <contest/local.hpp>
#else
#define LOG(...) \
do { \
} while (false)
#endif
#define REP(i, n) ... | replace | 37 | 38 | 37 | 38 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int M = 100001;
int n, A[M], ans;
multiset<int> s;
multiset<int>::iterator it;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (!s.size()) {
s.insert(A[i]);
ans++;
continu... | #include <bits/stdc++.h>
using namespace std;
const int M = 100001;
int n, A[M], ans;
multiset<int> s;
multiset<int>::iterator it;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
for (int i = 1; i <= n; i++) {
if (!s.size()) {
s.insert(A[i]);
ans++;
continu... | replace | 16 | 17 | 16 | 17 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++)
cin >> a[i];
multiset<long long> T;
for (long long i = 0; i < n; i++) {
auto it = lower_bound(T.begin(), T.end(), ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++)
cin >> a[i];
multiset<long long> T;
for (long long i = 0; i < n; i++) {
auto it = T.lower_bound(a[i]);
if (it... | replace | 18 | 19 | 18 | 19 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const l... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const l... | replace | 29 | 30 | 29 | 30 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | replace | 29 | 30 | 29 | 30 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
reverse(v.begin(), v.end());
multiset<int> se;
for (int i = 0; i < n; i++) {
auto p = upper_bound(se.begin(), s... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
reverse(v.begin(), v.end());
multiset<int> se;
for (int i = 0; i < n; i++) {
auto p = se.upper_bound(v[i]);
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02973 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc134/tasks/abc134_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
struct Dat {
ll v;
ll pos;
};
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.... | // https://atcoder.jp/contests/abc134/tasks/abc134_e
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define FOR(i, a, b) for (int64_t i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
struct Dat {
ll v;
ll pos;
};
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.... | replace | 25 | 26 | 25 | 27 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
using namespace std;
//////全探索したいときに開けよ////////
vector<vector<int>> fspattern;
vector<int> fspattern_draft;
int fspcnt = 0;
void setfspattern_core(int floor, int number, int ... | replace | 94 | 95 | 94 | 95 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.