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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
int A[N];
int index;
for (int i = 0; i < Q; i++) {
A[i] = 0;
}
for (int i = 0; i < Q; i++) {
cin >> index;
A[index - 1] += 1;
}
for (int i = 0; i < N; i++) {
if (K - (Q - A[i]) > 0)
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
int A[N];
int index;
for (int i = 0; i < N; i++) {
A[i] = 0;
}
for (int i = 0; i < Q; i++) {
cin >> index;
A[index - 1] += 1;
}
for (int i = 0; i < N; i++) {
if (K - (Q - A[i]) > 0)
cout... | replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a;
for (int i = 0; i < q; i++) {
int val;
cin >> val;
a.push_back(val);
}
vector<ll> pt(n);
fill(pt.begin(), pt.end(), k - q);
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a;
for (int i = 0; i < q; i++) {
int val;
cin >> val;
a.push_back(val);
}
vector<ll> pt(n);
fill(pt.begin(), pt.end(), k - q);
f... | replace | 21 | 22 | 21 | 22 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
int main(void) {
ll n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
rep(i, q) cin >> a[i];
vector<int> p(n, k - q);
rep(i, q) p[a[i] - 1]++;
rep(i, n) { ... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long int;
int main(void) {
ll n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> p(n, k - q);
rep(i, q) p[a[i] - 1]++;
rep(i, n) { ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, q, a;
cin >> n >> k >> q;
vector<long long> count(n, k);
for (int i = 0; i < q; ++i) {
cin >> a;
count.at(a - 1) += 1;
for (int j = 0; j < n; ++j) {
count.at(j) -= 1;
}
}
for (int i = 0; i < n; ++i) {
if (c... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, q, a;
cin >> n >> k >> q;
vector<long long> count(n, k);
for (int i = 0; i < q; ++i) {
cin >> a;
count.at(a - 1) += 1;
}
for (int j = 0; j < n; ++j) {
count.at(j) -= 1 * q;
}
for (int i = 0; i < n; ++i) {
if (cou... | replace | 10 | 13 | 10 | 13 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A;
for (ll i = 0; i < Q; ++i) {
ll a;
cin >> a;
A[a - 1]++;
}
for (ll i = 0; i < N; ++i) {
if (K - (Q - A[i]) > 0) {
printf("Yes\n");
} else {
printf("N... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(N, 0);
for (ll i = 0; i < Q; ++i) {
ll a;
cin >> a;
A[a - 1]++;
}
for (ll i = 0; i < N; ++i) {
if (K - (Q - A[i]) > 0) {
printf("Yes\n");
} else {
pri... | replace | 6 | 7 | 6 | 7 | -11 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> player(k, 0);
for (int i = 0; i < q; i++) {
int a;
cin >> a;
player[a - 1]++;
}
for (int i = 0; i < n; i++) {
if (0 < player[i] + k - q) {
cout << "Yes" << endl;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> player(n, 0);
for (int i = 0; i < q; i++) {
int a;
cin >> a;
player[a - 1]++;
}
for (int i = 0; i < n; i++) {
if (0 < player[i] + k - q) {
cout << "Yes" << endl;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define vint vector<int>
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define pb() push_back()
#define mod 100000007
#define elif else if
#define str string
// m... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define vint vector<int>
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define pb() push_back()
#define mod 100000007
#define elif else if
#define str string
// m... | replace | 24 | 32 | 24 | 26 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q, i, j = 0;
cin >> N >> K >> Q;
vector<int> P(N, K - Q);
vector<int> Ans(Q);
for (i = 0; i < Q; i++)
cin >> Ans.at(i);
for (i = 0; i < Q; i++)
P.at(Ans.at(i))++;
for (i = 0; i < N; i++) {
if (P.at(i) <= 0)
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q, i, j = 0;
cin >> N >> K >> Q;
vector<int> P(N, K - Q);
vector<int> Ans(Q);
for (i = 0; i < Q; i++)
cin >> Ans.at(i);
for (i = 0; i < Q; i++)
P.at(Ans.at(i) - 1)++;
for (i = 0; i < N; i++) {
if (P.at(i) <= 0)
cout ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n + 1);
for (int i = 1; i <= q; i++) {
cin >> a[i];
}
vector<int> times(n + 1, 0);
for (int i = 1; i <= q; i++) {
times[a[i]] += 1;
}
for (int i = 1; i <= n; i++) {
if (k - (q - ti... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q + 1);
for (int i = 1; i <= q; i++) {
cin >> a[i];
}
vector<int> times(n + 1, 0);
for (int i = 1; i <= q; i++) {
times[a[i]] += 1;
}
for (int i = 1; i <= n; i++) {
if (k - (q - ti... | replace | 7 | 8 | 7 | 8 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
int main() {
int n, k, q;
int point[10005];
cin >> n >> k >> q;
rep(i, n + 1) point[i] = 0;
rep(i, q) {
int temp;
cin >> temp;
point[temp + 1]++;
}
for (int i = 1; i <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
int main() {
int n, k, q;
int point[100005];
cin >> n >> k >> q;
rep(i, n + 1) point[i] = 0;
rep(i, q) {
int temp;
cin >> temp;
point[temp + 1]++;
}
for (int i = 1; i ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MIN(a, b) (((a) <= (b)) ? (a) : (b))
#define MAX(a, b) (((a) >= (b)) ? (a) : (b))
#define ll long long int
using namespace std;
int main() {
int n, p, q;
cin >> n >> p >> q;
int qq[q];
rep(i, q) cin >> qq[i];
rep(i, q) qq[i]--;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MIN(a, b) (((a) <= (b)) ? (a) : (b))
#define MAX(a, b) (((a) >= (b)) ? (a) : (b))
#define ll long long int
using namespace std;
int main() {
int n, p, q;
cin >> n >> p >> q;
int qq[q];
rep(i, q) cin >> qq[i];
rep(i, q) qq[i]--;
... | replace | 15 | 16 | 15 | 17 | TLE | |
p02911 | C++ | Runtime Error | #include <iostream>
using namespace std;
int p[10005], a[10005];
int main() {
int n, k, q;
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) {
p[i] = k - q;
}
for (int i = 1; i <= q; i++) {
cin >> a[i];
}
for (int i = 1; i <= q; i++) {
p[a[i]]++;
}
for (int i = 1; i <= n; i++) {
if (p[... | #include <iostream>
using namespace std;
int p[100005], a[100005];
int main() {
int n, k, q;
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) {
p[i] = k - q;
}
for (int i = 1; i <= q; i++) {
cin >> a[i];
}
for (int i = 1; i <= q; i++) {
p[a[i]]++;
}
for (int i = 1; i <= n; i++) {
if (... | replace | 2 | 3 | 2 | 3 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Ye... | delete | 38 | 39 | 38 | 38 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02911 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int N, K, Q;
scanf("%d %d %d", &N, &K, &Q);
vector<int> A(Q);
rep(i, Q) { scanf("%d", &A[i]); }
vector<int> score(N);
rep(i, N) score[i] = K - Q;
rep(i, Q) {
rep(j, N) {... | #include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int N, K, Q;
scanf("%d %d %d", &N, &K, &Q);
vector<int> A(Q);
rep(i, Q) { scanf("%d", &A[i]); }
vector<int> score(N);
rep(i, N) score[i] = K - Q;
rep(i, Q) { score[A[i] - 1]... | replace | 16 | 24 | 16 | 17 | TLE | |
p02911 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m, k, score[10005], t;
while (cin >> n >> m >> k) {
for (int i = 1; i <= n; i++)
score[i] = m;
for (int i = 1; i <= k; i++)
cin >> t, score[t]++;
for (int i = 1; i <= n; i++) {
score[i] -= k;
if (score[i] > 0)
c... | #include <iostream>
using namespace std;
int main() {
long long n, m, k, score[100005], t;
while (cin >> n >> m >> k) {
for (int i = 1; i <= n; i++)
score[i] = m;
for (int i = 1; i <= k; i++)
cin >> t, score[t]++;
for (int i = 1; i <= n; i++) {
score[i] -= k;
if (score[i] > 0)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02911 | Python | Time Limit Exceeded | def main():
N, K, Q, *A = map(int, open(0).read().split())
A = [K + A.count(i) for i in range(1, N + 1)]
print("\n".join(["Yes" if Q < a else "No" for a in A]))
return
main()
| def main():
N, K, Q, *A = map(int, open(0).read().split())
ans = [0] * N
for a in A:
ans[a - 1] += 1
print("\n".join(["Yes" if Q < K + a else "No" for a in ans]))
return
main()
| replace | 2 | 4 | 2 | 6 | TLE | |
p02911 | Python | Runtime Error | n, k, q = map(int, input().split())
a = []
for i in range(q):
a[i] = int(input()) - 1
score = [0 for _ in range(n)]
for a_i in a:
score[a_i] += 1
for i in range(n):
result = k - q + score[i]
print("Yes" if result > 0 else "No")
| n, k, q = map(int, input().split())
a = []
for i in range(q):
a.append(int(input()) - 1)
score = [0 for _ in range(n)]
for a_i in a:
score[a_i] += 1
for i in range(n):
result = k - q + score[i]
print("Yes" if result > 0 else "No")
| replace | 3 | 4 | 3 | 4 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02911/Python/s560201752.py", line 4, in <module>
a[i] = int(input()) - 1
IndexError: list assignment index out of range
|
p02911 | Python | Time Limit Exceeded | N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
points = [K for _ in range(N)]
for i in range(Q):
points[A[i] - 1] += 1
for j in range(N):
points[j] -= 1
for j in range(N):
if points[j] >= 1:
print("Yes")
else:
print("No")
| N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
points = [K for _ in range(N)]
for i in range(Q):
points[A[i] - 1] += 1
for j in range(N):
points[j] -= Q
for j in range(N):
if points[j] >= 1:
print("Yes")
else:
print("No")
| replace | 7 | 9 | 7 | 10 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> cnt(N);
for (int i = 0; i < N; i++) {
cnt[i] = K - Q;
}
for (int i = 0; i < Q; i++) {
cin >> A[i];
cnt[A[i] - 1]++;
}
for (int i = 0; i < N; i++) {
if (A[i] > 0) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> cnt(N);
for (int i = 0; i < N; i++) {
cnt[i] = K - Q;
}
for (int i = 0; i < Q; i++) {
cin >> A[i];
cnt[A[i] - 1]++;
}
for (int i = 0; i < N; i++) {
if (cnt[i] > 0)... | replace | 16 | 17 | 16 | 17 | 0 | |
p02911 | C++ | Runtime Error | #include <stdio.h>
int main() {
int N, K, Q;
int i;
int tmp;
static int array[10000];
scanf("%d %d %d", &N, &K, &Q);
for (i = 0; i < N; i++) {
array[i] = K - Q;
}
for (i = 0; i < Q; i++) {
scanf("%d", &tmp);
array[tmp - 1]++;
}
for (i = 0; i < N; i++) {
if (array[i] <= 0) {
... | #include <stdio.h>
int main() {
int N, K, Q;
int i;
int tmp;
static int array[100000];
scanf("%d %d %d", &N, &K, &Q);
for (i = 0; i < N; i++) {
array[i] = K - Q;
}
for (i = 0; i < Q; i++) {
scanf("%d", &tmp);
array[tmp - 1]++;
}
for (i = 0; i < N; i++) {
if (array[i] <= 0) {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
long N, K, Q, B[10500] = {0}, A[10500];
cin >> N >> K >> Q;
for (int i = 0; i < Q; i++) {
cin >> A[i];
}
if (Q < K) {
for (int i = 0; i < N; i++) {
cout << "Yes" << endl;
}
} else {
for (int i = 0; i < Q; i++) {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
long N, K, Q, B[100500] = {0}, A[100500] = {0};
cin >> N >> K >> Q;
for (int i = 0; i < Q; i++) {
cin >> A[i];
}
if (Q < K) {
for (int i = 0; i < N; i++) {
cout << "Yes" << endl;
}
} else {
for (int i = 0; i < Q;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>... | replace | 25 | 26 | 25 | 26 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, q;
long long k;
cin >> n >> k >> q;
long long p[10010] = {0};
for (long long i = 0; i < q; i++) {
long long a;
cin >> a;
a--;
p[a]++;
}
for (long long i = 0; i < n; i++) {
if (k - (q - p[i]) <= 0)
cout << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, q;
long long k;
cin >> n >> k >> q;
long long p[100100] = {0};
for (long long i = 0; i < q; i++) {
long long a;
cin >> a;
a--;
p[a]++;
}
for (long long i = 0; i < n; i++) {
if (k - (q - p[i]) <= 0)
cout << ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
// 桁
int kt(int a) {
double b = a;
b = log10(b);
int c... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define double long double
using namespace std;
// 桁
int kt(int a) {
double b = a;
b = log10(b);
int c... | replace | 55 | 56 | 55 | 56 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q, 0);
for (int i = 0; i < q; i++) {
int temp;
cin >> temp;
a[temp - 1]++;
}
for (int i = 0; i < n; i++) {
if (k - (q - a[i]) <= 0) {
cout << "No" << endl;
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n, 0);
for (int i = 0; i < q; i++) {
int temp;
cin >> temp;
a[temp - 1]++;
}
for (int i = 0; i < n; i++) {
if (k - (q - a[i]) <= 0) {
cout << "No" << endl;
} else {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
for (int i = 0; i < Q; i++) {
int x;
cin >> x;
A.at(x - 1)++;
}
for (int i = 0; i < N; i++) {
string S = Q - A.at(i) < K ? "Yes" : "No";
cout << S << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (int i = 0; i < Q; i++) {
int x;
cin >> x;
A.at(x - 1)++;
}
for (int i = 0; i < N; i++) {
string S = Q - A.at(i) < K ? "Yes" : "No";
cout << S << endl;
}
}
| replace | 5 | 6 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02911 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
int main() {
int N, Q, i, j;
long long K;
int who, A[10010] = {0};
int border;
cin >> N >> K >> Q;
RE... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
int main() {
int N, Q, i, j;
long long K;
int who, A[100100] = {0};
long long border;
cin >> N >> K >> ... | replace | 14 | 16 | 14 | 16 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> player(N);
rep(i, Q) { cin >> A.at(i); }
rep(i, N) { player.at(i) = K; }
rep(j, N) {
rep(i, Q) {
if (A.at(i) - 1 == j) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> player(N);
rep(i, Q) { cin >> A.at(i); }
rep(i, N) { player.at(i) = K - Q; }
rep(i, Q) { player.at(A.at(i) - 1)++; }
rep(i, N) {... | replace | 10 | 19 | 10 | 12 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n, 0);
int x;
for (int i = 0; i < q; i++) {
cin >> x;
x--;
a[x]++;
}
int sum = accumulate(a.begin(), a.end(), 0);
for (int i = 0; i < q; i++) {
cout << ((sum - a[i] < k) ? "Yes" : ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n, 0);
int x;
for (int i = 0; i < q; i++) {
cin >> x;
x--;
a[x]++;
}
for (int i = 0; i < n; i++) {
cout << ((q - a[i] < k) ? "Yes" : "No") << '\n';
}
return 0;
} | replace | 14 | 17 | 14 | 16 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
rep(i, Q) {
int x;
cin >> x;
--x;
A[i] = x;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
rep(i, Q) {
int x;
cin >> x;
--x;
A[i] = x;
}
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
/*int main(){//B
string S;
cin>>S;
rep(i,0,S.size()){
if(i%2==0){
if(S[i]!='R'&&S[i]!='U'&&S[i]!='D') {
cout<<"No"<<endl;
return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
/*int main(){//B
string S;
cin>>S;
rep(i,0,S.size()){
if(i%2==0){
if(S[i]!='R'&&S[i]!='U'&&S[i]!='D') {
cout<<"No"<<endl;
return 0;
}
}
... | replace | 34 | 36 | 34 | 35 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<int> score(N);
for (ll i = 0; i < N; i++) {
score.at(i) = K - Q;
}
for (ll i = 0; i < Q; i++) {
int a;
cin >> a;
score.at(a)++;
}
for (ll i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<int> score(N);
for (ll i = 0; i < N; i++) {
score.at(i) = K - Q;
}
for (ll i = 0; i < Q; i++) {
int a;
cin >> a;
score.at(a - 1)++;
}
for (ll i = 0; i < N; i++) {
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 5e4 + 10, MAXM = 1e6 + 10;
const int INF = ~(1 << 31), MOD = 1e9 + 7;
int a[MAXN];
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= q; i++) {
int temp;
scanf("%d", &... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 10, MAXM = 1e6 + 10;
const int INF = ~(1 << 31), MOD = 1e9 + 7;
int a[MAXN];
int main() {
int n, m, q;
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= q; i++) {
int temp;
scanf("%d", &... | replace | 4 | 5 | 4 | 5 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() { // 参加者のポイントをQ減らし、正解者にポ
// イントを増やしていく実装
int N, K, Q;
cin >> N >> K >> Q;
vector<int> s(N, K - Q); // あらかじめ参加者のポイント
// を減らしておく
vector<int> A(Q);
for (int i = 0; i < Q; i++)
cin >> A.at(i);
for (int i = 0; i < Q; i++) {
for (i... | #include <iostream>
#include <vector>
using namespace std;
int main() { // 参加者のポイントをQ減らし、正解者にポ
// イントを増やしていく実装
int N, K, Q;
cin >> N >> K >> Q;
vector<int> s(N, K - Q); // あらかじめ参加者のポイント
// を減らしておく
vector<int> A(Q);
for (int i = 0; i < Q; i++)
cin >> A.at(i);
for (int i = 0; i < Q; i++) {
s.at(A... | replace | 14 | 19 | 14 | 15 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
int Q;
cin >> N >> K >> Q;
int num = Q - K + 1;
int num2;
vector<int> A(Q);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
vector<int> B(N);
if (Q - K < 0) {
for (int i = 0; i < N; ++i) {
cout << "Yes" << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int K;
int Q;
cin >> N >> K >> Q;
int num = Q - K + 1;
int num2;
vector<int> A(Q);
for (int i = 0; i < Q; ++i) {
cin >> A[i];
}
vector<int> B(N);
if (Q - K < 0) {
for (int i = 0; i < N; ++i) {
cout << "Yes" << en... | replace | 14 | 15 | 14 | 15 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, q;
cin >> n >> k >> q;
vector<ll> vec(n, k - q);
ll tmp;
for (int i = 0; i < q; i++) {
cin >> tmp;
vec.at(tmp)++;
}
for (int i = 0; i < n; i++) {
if (vec.at(i) > 0) {
cout << "Yes" << endl;
} e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, q;
cin >> n >> k >> q;
vector<ll> vec(n, k - q);
ll tmp;
for (int i = 0; i < q; i++) {
cin >> tmp;
vec.at(tmp - 1)++;
}
for (int i = 0; i < n; i++) {
if (vec.at(i) > 0) {
cout << "Yes" << endl;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, k, q, line;
long long *a, *b;
cin >> n;
cin >> k;
cin >> q;
line = q - k + 1;
a = new long long[q];
b = new long long[n];
for (int i = 0; i < n; i++) {
b[i] = 0;
}
for (int i = 0; i < q; i++) {
cin >> a[... | #include <iostream>
#include <string>
using namespace std;
int main() {
long long n, k, q, line;
long long *a, *b;
cin >> n;
cin >> k;
cin >> q;
line = q - k + 1;
a = new long long[q];
b = new long long[n];
for (int i = 0; i < n; i++) {
b[i] = 0;
}
for (int i = 0; i < q; i++) {
cin >> a[... | replace | 21 | 22 | 21 | 22 | 0 | |
p02911 | C++ | Time Limit Exceeded | #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() {
ll n, k, q;
cin >> n >> k >> q;
vector<ll> a(q);
rep(i, q) cin >> a[i];
vector<ll> pa(n);
rep(i, n) pa[i] = k;
rep(i, q) {
rep(j, n) {
if ((... | #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() {
ll n, k, q;
cin >> n >> k >> q;
vector<ll> a(q);
rep(i, q) cin >> a[i];
vector<ll> pa(n);
rep(i, n) pa[i] = k - q;
rep(i, q) { pa[a[i] - 1]++; }
rep... | replace | 12 | 21 | 12 | 14 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(i) = K - Q;
}
for (int i = 0; i < Q; i++) {
ans.at(A.at(i) - 1)++;
}
f... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
}
vector<int> ans(N);
for (int i = 0; i < N; i++) {
ans.at(i) = K - Q;
}
for (int i = 0; i < Q; i++) {
ans.at(A.at(i) - 1)++;
}
f... | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
vector<int> B(N);
vector<string> C(N);
for (int i = 0; i < N; i++) {
B.at(i) = B.at(i) + K - Q;
C.at(i) = "Yes";
}
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
B.at(A.at(i) -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> B(N);
vector<string> C(N);
for (int i = 0; i < N; i++) {
B.at(i) = B.at(i) + K - Q;
C.at(i) = "Yes";
}
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
B.at(A.at(i) -... | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, q;
unsigned long long int k;
cin >> n >> k >> q;
// cout << n << ',' << k << ',' << q << endl;
vector<unsigned int> a(q);
for (unsigned int i = 0; i < q; ++i) {
cin >> a.at(i);
}
// cout << n << ',' << k << ',' << q << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned int n, q;
unsigned long long int k;
cin >> n >> k >> q;
// cout << n << ',' << k << ',' << q << endl;
vector<unsigned int> a(q);
for (unsigned int i = 0; i < q; ++i) {
cin >> a.at(i);
}
// cout << n << ',' << k << ',' << q << end... | replace | 18 | 19 | 18 | 19 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> ans... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> ans... | replace | 16 | 17 | 16 | 17 | -6 | double free or corruption (out)
|
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
int main() {
ll n, k, q;
cin >> n >> k >> q;
vl a(n);
rep(i, n) cin >> a.at(i);
vl p(n);
vector<string> ans(n);
rep(i, q) p.at(a.at(i) - 1)++;
rep(i, n) {
if (k -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
int main() {
ll n, k, q;
cin >> n >> k >> q;
vl a(q);
rep(i, q) cin >> a.at(i);
vl p(n);
vector<string> ans(n);
rep(i, q) p.at(a.at(i) - 1)++;
rep(i, n) {
if (k -... | replace | 9 | 11 | 9 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0;... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0;... | replace | 19 | 20 | 19 | 20 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define LOG(variable) cout << #variable ":\t" << (variable) << endl
#define LOGCON(i, container) \
for (int(i) = 0; (i) < (container).size(); ++(i)) ... | replace | 82 | 84 | 82 | 92 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, T;
T = 0;
cin >> N >> M;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (long long i = 0; i < M; i++) {
if (N > 10) {
if (A[N - 2] * 2 <= A[N - 1] && i < M && A[N... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, T;
T = 0;
cin >> N >> M;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (long long i = 0; i < M; i++) {
if (N > 10) {
if (A[N - 2] * 2 <= A[N - 1] && i < M && A[N... | replace | 39 | 40 | 39 | 40 | 0 | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1;... | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1;... | replace | 55 | 56 | 55 | 56 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
vector<int>::iterator itr;
size_t index;
while (m-- != 0) {
itr = max_element(a.begin(), a.end());
index... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
for (int i = 0; m; i++) {
if (i == n)
i = 0;
... | replace | 11 | 17 | 11 | 24 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, M;
vector<int> V(10);
int ans;
signed main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ans += a;
int tmp = 1;
for (int j = 0; j < 50; j++) {
V.push_back(a / tmp - a / (tmp * 2));
tmp *... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N, M;
vector<int> V(10);
int ans;
signed main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
ans += a;
int tmp = 1;
for (int j = 0; j < 50; j++) {
V.push_back(a / tmp - a / (tmp * 2));
tmp *... | replace | 23 | 24 | 23 | 24 | 0 | |
p02912 | C++ | Runtime Error | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | #include "bits/stdc++.h"
#define int long long
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define itr(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#defi... | insert | 113 | 113 | 113 | 115 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
while (M > 0) {
int t = que.top();
que.pop();
M--;
t /= 2;
if (t > 0)
... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
while (M > 0 && !que.empty()) {
int t = que.top();
que.pop();
M--;
t /= 2;
... | replace | 15 | 16 | 15 | 16 | TLE | |
p02912 | C++ | Time Limit Exceeded | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | insert | 109 | 109 | 109 | 111 | TLE | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> p;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push(tmp);
}
for (int i = 0; i < m; i++) {
int tmp = p.top();
p.pop();
p.push(tmp / 2);
}
long lo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<int> p;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
p.push(tmp);
}
for (int i = 0; i < m; i++) {
int tmp = p.top();
p.pop();
p.push(tmp / 2);
}
long long int ans = 0;
while... | delete | 0 | 1 | 0 | 0 | TLE | |
p02912 | Python | Runtime Error | import heapq
n, m = map(int, input().split())
a = map(int, input().split())
a = map(lambda x: -x, a)
heapq.heapify(a)
for i in range(m):
tmp = -heapq.heappop(a) // 2
heapq.heappush(a, -tmp)
print(-sum(a))
| import heapq
n, m = map(int, input().split())
a = map(int, input().split())
a = list(map(lambda x: -x, a))
heapq.heapify(a)
for i in range(m):
tmp = -heapq.heappop(a) // 2
heapq.heappush(a, -tmp)
print(-sum(a))
| replace | 4 | 5 | 4 | 5 | TypeError: heapify() argument must be list, not map | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02912/Python/s087628068.py", line 6, in <module>
heapq.heapify(a)
TypeError: heapify() argument must be list, not map
|
p02912 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(... | replace | 38 | 39 | 38 | 39 | 0 | |
p02912 | C++ | Runtime Error | #include <algorithm>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long N, M;
scanf("%ld", &N);
scanf("%ld", &M);
std::priority_queue<long> que;
for (long i = 0; i < N; i++) {
long tmp;
scanf("%ld", tmp);
que.push(tmp);
}
long tmp;
... | #include <algorithm>
#include <numeric>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long N, M;
scanf("%ld", &N);
scanf("%ld", &M);
std::priority_queue<long> que;
for (long i = 0; i < N; i++) {
long tmp;
scanf("%ld", &tmp);
que.push(tmp);
}
long tmp;... | replace | 13 | 14 | 13 | 14 | -11 | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace... | #include <algorithm> //next_permutation
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long l... | delete | 0 | 1 | 0 | 0 | TLE | |
p02912 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
// #include<C:\Users\J\Desktop\AC\athead.h>
#define showa(v) \
for (int iii = 0; iii < v.size(); iii++) { \
... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
// #include<C:\Users\J\Desktop\AC\athead.h>
#define showa(v) \
for (int iii = 0; iii < v.size(); iii++) { \
... | insert | 42 | 42 | 42 | 43 | -6 | free(): invalid pointer
|
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
ll n, m, ans = 0;
cin >> n >> m;
vector<ll> x;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
ans += a;
while (a != 1) {
x.push_back(a - a / 2);
... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
int main() {
ll n, m, ans = 0;
cin >> n >> m;
vector<ll> x;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
ans += a;
while (a != 1) {
x.push_back(a - a / 2);
... | insert | 22 | 22 | 22 | 26 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ", ";
os << "]";
r... | insert | 116 | 116 | 116 | 120 | TLE | |
p02912 | C++ | Runtime Error | #include <iostream>
#include <queue>
int main() {
int n, m;
std::cin >> n >> m;
std::priority_queue<long long> que;
int i;
for (i = 0; i < n; i++) {
long A;
std::cin >> A;
}
for (i = 0; i < m; i++) {
long long t = que.top();
que.pop();
que.push(t / 2);
}
long long res = 0;
whi... | #include <iostream>
#include <queue>
int main() {
int n, m;
std::cin >> n >> m;
std::priority_queue<long long> que;
int i;
for (i = 0; i < n; i++) {
long A;
std::cin >> A;
que.push(A);
}
for (i = 0; i < m; i++) {
long long t = que.top();
que.pop();
que.push(t / 2);
}
long lo... | insert | 12 | 12 | 12 | 13 | -11 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long ans;
inline int nextInt() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int main... | #include <bits/stdc++.h>
using namespace std;
long long ans;
inline int nextInt() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
int main... | replace | 24 | 25 | 24 | 27 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
ll mod = 1e9 + 7ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
ll mod = 1e9 + 7ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#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 int long long
signed main() {
ci... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#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 int long long
signed main() {
cin.tie(0);
ios_base::s... | delete | 0 | 1 | 0 | 0 | TLE | |
p02912 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, j) for (long long i = 0; i < j; i++)
#define int long long
using namespace std;
signed main() {
int N, M, x;
cin >> N >> M;
vector<int> A_arr;
vector<int> A_subarr;
rep(i, N) {
cin >> x;
A_ar... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, j) for (long long i = 0; i < j; i++)
#define int long long
using namespace std;
signed main() {
int N, M, x;
cin >> N >> M;
vector<int> A_arr;
vector<int> A_subarr;
rep(i, N) {
cin >> x;
A_ar... | replace | 20 | 21 | 20 | 23 | TLE | |
p02912 | C++ | Runtime Error | // Author : Abdallah Hemdan
/*Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ \\ \ \
* \ \__\\ \_\
* ... | // Author : Abdallah Hemdan
/*Dear online judge:
* I've read the problem, and tried to solve it.
* Even if you don't accept my solution, you should respect my effort.
* I hope my code compiles and gets accepted.
* ___ __
* |\ \|\ \
* \ \ \_\ \
* \ \ ___ \emdan
* \ \ \\ \ \
* \ \__\\ \_\
* ... | delete | 256 | 263 | 256 | 256 | TLE | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout << setprecision(10) << fixed;
int n, m;
cin >> n >> m;
priority_queue<long long> pq;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
pq.push(x);
}
for (int i = 0; i < m; ++i) {
long long nn = pq.top(... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout << setprecision(10) << fixed;
int n, m;
cin >> n >> m;
priority_queue<long long> pq;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
pq.push(x);
}
for (int i = 0; i < m; ++i) {
long long nn = pq.top(... | replace | 18 | 21 | 18 | 19 | TLE | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0... | replace | 0 | 1 | 0 | 1 | TLE | |
p02912 | Python | Time Limit Exceeded | N, M = map(int, input().split())
A = list(map(int, input().split()))
while M > 0:
M -= 1
A[A.index(max(A))] //= 2
print(sum(A))
| import heapq
n, m = map(int, input().split())
a = list(map(lambda x: int(x) * (-1), input().split()))
heapq.heapify(a) # aを優先度付きキューに
for _ in range(m):
tmp_min = heapq.heappop(a)
heapq.heappush(a, (-1) * (-tmp_min // 2)) # 計算誤差の関係で-1を2回かけてます
print(-sum(a))
| replace | 0 | 6 | 0 | 10 | TLE | |
p02912 | Python | Time Limit Exceeded | N, M = map(int, input().split())
A = list(map(int, input().split()))
while M > 0:
max_index = A.index(max(A))
A[max_index] = A[max_index] // 2
M -= 1
print(sum(A))
| N, M = map(int, input().split())
A = list(map(int, input().split()))
while M > 0:
A.sort(reverse=True)
if A[0] == 0:
break
ham = A[0] // 2
for i, a in enumerate(A):
if ham < a and M > 0:
A[i] = A[i] // 2
M -= 1
else:
break
print(sum(A))
| replace | 4 | 7 | 4 | 14 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a;
map<ll, ll> mp;
multiset<ll> ms;
ll x;
rep(i, n) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a;
map<ll, ll> mp;
multiset<ll> ms;
ll x;
rep(i, n) {... | replace | 21 | 23 | 21 | 23 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> a;
p[i] = a;
}
sort(p.begin(), p.end());
for (int i = 0; i < m; i++) {
p[n - 1] = p[n - 1] / 2;
sort(p.begin(), p.end());
}... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, m, a;
cin >> n >> m;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> a;
p[i] = a;
}
sort(p.begin(), p.end(), greater<int>());
while (true) {
int half = p[0] / 2;
for (int i = 0; i < n && m > 0; ... | replace | 12 | 16 | 12 | 29 | TLE | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<long long> que;
for (int i = 0; i < n; i++) {
long long ai;
cin >> ai;
que.push(ai);
}
for (int i = 0; i < m; i++) {
long long t;
t = que.top();
que.pop();
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
priority_queue<long long> que;
for (int i = 0; i < n; i++) {
long long ai;
cin >> ai;
que.push(ai);
}
for (int i = 0; i < m; i++) {
long long t;
t = que.top();
que.pop();
que.push(t / 2);
}... | delete | 0 | 1 | 0 | 0 | TLE | |
p02912 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int j = 0; j < M; j++) {
std::vector<int>::iterator iter = std::max_element(A.begin(), A.... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
while (M > 0) {
sort(A.rbegin(), A.rend());
int mid = A[0] / 2;
for (int i = 0; i < N;... | replace | 14 | 18 | 14 | 25 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> q;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
}
for (int i = 0; i < M; i++) {
int a = q.top();
q.pop();
q.push(a / 2);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> q;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
q.push(a);
}
for (int i = 0; i < M; i++) {
int a = q.top();
q.pop();
q.push(a / 2);
}
long long ans = 0;
for (int i = 0; i... | insert | 10 | 10 | 10 | 11 | -11 | |
p02912 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll... | replace | 41 | 42 | 41 | 42 | TLE | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
for (int i = 0; i < M; i++) {
int mprice = que.top();
que.pop();
mprice /= 2;
... | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
for (int i = 0; i < M; i++) {
int mprice = que.top();
que.pop();
que.push(mprice ... | replace | 18 | 21 | 18 | 19 | TLE | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
for (int i = 0; i < M; i++) {
int mprice = que.top();
que.pop();
mprice /= 2;
... | #include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX / 2;
int main() {
int N, M;
cin >> N >> M;
priority_queue<int> que;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
que.push(a);
}
for (int i = 0; i < M; i++) {
int mprice = que.top();
que.pop();
mprice /= 2;
... | replace | 19 | 21 | 19 | 20 | TLE | |
p02912 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll n, m;
cin >> n >> m;
priority_queue<ll... | // #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod = 1e+9 + 7;
int main() {
ll n, m;
cin >> n >> m;
priority_queue... | replace | 0 | 1 | 0 | 1 | TLE | |
p02912 | C++ | Time Limit Exceeded | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#define _GLIBCXX_DEBUG
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | delete | 3 | 4 | 3 | 3 | TLE | |
p02912 | C++ | Time Limit Exceeded | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#define _GLIBCXX_DEBUG
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
WRITER:kakitamasziru/OxOmisosiru
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <iostream> // cout, endl, cin
#include <limits> //s... | delete | 3 | 4 | 3 | 3 | TLE | |
p02912 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#in... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#in... | replace | 113 | 114 | 113 | 114 | 0 | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll N = 2000009;
const ll p = 31;
const ll m = 1e9 + 7;
const ll inf = 1e14;
ll mod = 1e9 + 7;
ll powm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll N = 2000009;
const ll p = 31;
const ll m = 1e9 + 7;
const ll inf = 1e14;
ll mod = 1e9 + 7;
ll powm(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
... | replace | 28 | 32 | 28 | 32 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
priority_queue<long long> que;
for (int i = 0; i < N; i++) {
long long A;
cin >> A;
que.push(A);
}
for (int i = 0; i < M; i++) {
long long t... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
priority_queue<long long> que;
for (int i = 0; i < N; i++) {
long long A;
cin >> A;
que.push(A);
}
for (int i = 0; i < M; i++) {
long long t... | replace | 21 | 23 | 21 | 22 | TLE | |
p02912 | C++ | Runtime Error | #include <bits //stdc++.h>
using namespace std;
int main(void) {
unsigned long long a, b, c, d, i, j, ans;
ans = 0;
cin >> a >> b;
vector<unsigned long long> v;
v.push_back(0);
for (i = 0; i < a; i++) {
cin >> c;
ans = ans + c;
while (c) {
d = c / 2;
v.push_back(c - d);
c = d;
... | #include <bits //stdc++.h>
using namespace std;
int main(void) {
unsigned long long a, b, c, d, i, j, ans;
ans = 0;
cin >> a >> b;
vector<unsigned long long> v;
v.push_back(0);
for (i = 0; i < a; i++) {
cin >> c;
ans = ans + c;
while (c) {
d = c / 2;
v.push_back(c - d);
c = d;
... | insert | 19 | 19 | 19 | 21 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[n];
std::vector<long long> v;
for (int i = 0; i < n; ++i) {
cin >> a[i];
v.push_back(a[i]);
}
// sort(v.begin(), v.end());
for (int i = 0; i < m; ++i) {
sort(v.begin(), v.end());
v[v.size() ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[n];
std::vector<long long> v;
for (int i = 0; i < n; ++i) {
cin >> a[i];
v.push_back(a[i]);
}
/*
for (int i = 0; i < m; ++i) {
sort(v.begin(), v.end());
v[v.size()-1] /= 2;
... | replace | 12 | 17 | 12 | 26 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 2000000
typedef long long LL;
int a[N], tot, n, m;
LL sum;
int main() {
// freopen("sample.in", "r", stdin);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int tmp;
scanf("%d", &tmp);
sum += tmp;
while (tmp) {
a[++tot] = tmp - tmp / 2, ... | #include <bits/stdc++.h>
using namespace std;
#define N 3000010
typedef long long LL;
int a[N], tot, n, m;
LL sum;
int main() {
// freopen("sample.in", "r", stdin);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int tmp;
scanf("%d", &tmp);
sum += tmp;
while (tmp) {
a[++tot] = tmp - tmp / 2, ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
long long N, M, A[100000] = {}, ans = 0, max, l = 0;
cin >> N >> M;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <float.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
long long N, M, A[100000] = {}, ans = 0, max, l = 0;
cin >> N >> M;
for (int i = 0; i < N; i++) {
... | insert | 33 | 33 | 33 | 38 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | replace | 16 | 20 | 16 | 20 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | replace | 43 | 44 | 43 | 44 | 0 | |
p02912 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (int i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (int i = x.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (int i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (int i = x.size() - 1; i... | replace | 42 | 44 | 42 | 45 | TLE | |
p02912 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
ll ans = 0;
rep(i, N) {
scanf("%d", &a[i]);
ans += a[i];
}
vector<int> x;... | #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) int(x.size())
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define MOD 1000000007
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
ll ans = 0;
rep(i, N) {
scanf("%d", &a[i]);
ans += a[i];
}
vector<int> x;... | insert | 28 | 28 | 28 | 32 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
int maxv = 0;
for (int i = 0; i < N; i++) {
char ch = S[i];
for (int j = i + 1; j < N; j++) {
if (S[j] != ch)
continue;
if (i + maxv > j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
int maxv = 0;
for (int i = 0; i < N; i++) {
char ch = S[i];
for (int j = i + 1; j < N; j++) {
if (S[j] != ch)
continue;
if (i + maxv > j ... | insert | 19 | 19 | 19 | 21 | TLE | |
p02913 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>... | replace | 47 | 48 | 47 | 48 | -11 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::vector<ll> lls;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
void cinv(lls &llVec, ll n) {
ll val;
llVec.reserve((size_t)(n... | #include <algorithm>
#include <iostream>
#include <set>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef std::vector<ll> lls;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
void cinv(lls &llVec, ll n) {
ll val;
llVec.reserve((size_t)(n... | replace | 30 | 33 | 30 | 34 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr long double EPS = 1e-15;
const long double PI = acos(-1);
constexpr int inf = 1e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
// #define all(v) (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr long double EPS = 1e-15;
const long double PI = acos(-1);
constexpr int inf = 1e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
// #define all(v) (... | replace | 27 | 39 | 27 | 32 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
string... | replace | 24 | 25 | 24 | 25 | 0 | |
p02913 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9 + 7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#ifdef LOCAL
#define debug(x) cerr << #x << ": " << x << endl
#else
#define debug(x)... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9 + 7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#ifdef LOCAL
#define debug(x) cerr << #x << ": " << x << endl
#else
#define debug(x)... | replace | 33 | 34 | 33 | 34 | -11 | |
p02913 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int n;
string s;
struct RollingHash {
vector<unsigned long long> hash[2], power[2];
const unsigned int seed = 10007;
const unsigned int mod[2] = {999999937, 1000000007};
RollingHash(const string &s) {
int n = (int)s.size();
for (int m = 0; m ... | #include <iostream>
#include <vector>
using namespace std;
int n;
string s;
struct RollingHash {
vector<unsigned long long> hash[2], power[2];
const unsigned int seed = 10007;
const unsigned int mod[2] = {999999937, 1000000007};
RollingHash(const string &s) {
int n = (int)s.size();
for (int m = 0; m ... | replace | 34 | 35 | 34 | 35 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (i... | replace | 33 | 34 | 33 | 34 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.