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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02270 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | replace | 26 | 27 | 26 | 27 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | replace | 26 | 28 | 26 | 28 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
// ------ main ------ //
int n, k, w[100000];
bool check(long long value) {
long long v = 0;
int c = 0;
for (int i = 0; i < n; i++) {
if (c >= k) {
return false;
}
if (v + w[i] > value) {
v = 0;
c++;
i--;
} else {
v += ... | #include <iostream>
using namespace std;
// ------ main ------ //
int n, k, w[100000];
bool check(long long value) {
long long v = 0;
int c = 0;
for (int i = 0; i < n; i++) {
if (c >= k) {
return false;
}
if (v + w[i] > value) {
v = 0;
c++;
i--;
} else {
v += ... | replace | 46 | 47 | 46 | 47 | TLE | |
p02270 | C++ | Runtime Error | #include <iostream>
using namespace std;
int w[100000];
int n, k;
int count(long long P) {
int count = 0, i;
long long Pn;
for (i = k; i > 0; i--) {
Pn = P;
while (Pn - w[count] >= 0) {
Pn -= w[count];
count++;
if (count == n)
break;
}
}
return count;
}
int main() {
... | #include <iostream>
using namespace std;
int w[100000];
int n, k;
int count(long long P) {
int count = 0, i;
long long Pn;
for (i = k; i > 0; i--) {
Pn = P;
while (Pn - w[count] >= 0) {
Pn -= w[count];
count++;
if (count == n)
return count;
}
}
return count;
}
int mai... | replace | 16 | 17 | 16 | 17 | 0 | |
p02270 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int P(long long p, long long T[], int n, int k) {
int i = 0, j;
long long s;
for (j = 0; j <= k - 1; j++) {
s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int main() {
int... | #include <cstdio>
#include <iostream>
using namespace std;
int P(long long p, long long T[], int n, int k) {
int i = 0, j;
long long s;
for (j = 0; j <= k - 1; j++) {
s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int main() {
int... | replace | 33 | 34 | 33 | 34 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, k, w[100000], max = 1, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> w[i];
if (max < w[i])
max = w[i];
sum += w[i];
}
int ave = sum / n;
int t;
// tは平均値と要素の最大値のうちの大きいほう
if (ave < max)
t = max;
else
t... | #include <iostream>
using namespace std;
int main() {
int n, k, w[100000], max = 1, sum = 0;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> w[i];
if (max < w[i])
max = w[i];
sum += w[i];
}
int ave = sum / k;
int t;
// tは平均値と要素の最大値のうちの大きいほう
if (ave < max)
t = max;
else
t... | replace | 12 | 13 | 12 | 13 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int w[100000], n, k;
int cntp(int p) {
int cnt = 1, wgh = 0;
for (int i = 0; i < n;) {
if (wgh + w[i] <= p) {
wgh += w[i++];
} else {
if (wgh > 0)
cnt++;
else
return k + 1;
wgh = 0;
}
}
return cnt;
}
int main() {
scanf... | #include <cstdio>
using namespace std;
int w[100000], n, k;
int cntp(int p) {
int cnt = 1, wgh = 0;
for (int i = 0; i < n;) {
if (wgh + w[i] <= p) {
wgh += w[i++];
} else {
if (wgh > 0)
cnt++;
else
return k + 1;
wgh = 0;
}
}
return cnt;
}
int main() {
scanf... | replace | 23 | 24 | 23 | 24 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int n, k;
int total = 0;
vector<int> w;
cin >> n >> k;
REP... | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int n, k;
int total = 0;
vector<int> w;
cin >> n >> k;
REP... | replace | 23 | 24 | 23 | 24 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int num_truck(const vector<int> &w, int P) {
int num = 1;
int p = P;
for (int i = 0; i < w.size(); i++) {
if (w[i] > P)
return -1; //??????????????´???
if (p >= w[i]) {
p -= w[i];
continue... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int num_truck(const vector<int> &w, int P) {
int num = 1;
int p = P;
for (int i = 0; i < w.size(); i++) {
if (w[i] > P)
return -1; //??????????????´???
if (p >= w[i]) {
p -= w[i];
continue... | insert | 22 | 22 | 22 | 25 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <cstdio>
#include <vector>
using namespace std;
static int f(const int *ws, int n, int P, int k) {
int v = 0;
int c = 0;
int ntrack = 0;
for (int i = 0; i < n; ++i) {
if (c > 0 && P > 0 && c + ws[i] > P) {
c = 0;
ntrack++;
}
if (ntrack == k) {
break;
}
if (c + w... | #include <cstdio>
#include <vector>
using namespace std;
static int f(const int *ws, int n, int P, int k) {
int v = 0;
int c = 0;
int ntrack = 0;
for (int i = 0; i < n; ++i) {
if (c > 0 && P > 0 && c + ws[i] > P) {
c = 0;
ntrack++;
}
if (ntrack == k) {
break;
}
if (c + w... | replace | 41 | 42 | 41 | 42 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long ll;
int n, k;
ll T[MAX];
int check(ll p) {
int i = 0;
for (int j = 0; j < k; ++j) {
ll s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return i;
}
}
return i;
}
int slove() {
ll left... | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long ll;
int n, k;
ll T[MAX];
int check(ll p) {
int i = 0;
for (int j = 0; j < k; ++j) {
ll s = 0;
while (s + T[i] <= p) {
s += T[i];
i++;
if (i == n)
return i;
}
}
return i;
}
int slove() {
ll left... | replace | 23 | 24 | 23 | 24 | TLE | |
p02270 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int n, k;
int A[100010];
bool f(ll p) {
ll temp = p;
int x = 0;
for (int i = 0; i < k; i++) {
while (temp >= A[x]) {
temp -= A[x];
x++;
}
temp = p;
}
if (x >= n)
return true;
else... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int n, k;
ll A[100010];
bool f(ll p) {
ll temp = p;
int x = 0;
for (int i = 0; i < k; i++) {
while (temp >= A[x]) {
temp -= A[x];
x++;
}
temp = p;
}
if (x >= n)
return true;
else
... | replace | 7 | 8 | 7 | 8 | -11 | |
p02270 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll lon... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll lon... | delete | 62 | 63 | 62 | 62 | 0 | hoge
|
p02270 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll lon... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define len(n) (int)n.length()
#define pb push_back
#define ll lon... | replace | 49 | 50 | 49 | 50 | 0 | //"kita":kita
|
p02270 | C++ | Time Limit Exceeded | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
vector<int> Input(const int n) {
vector<int> W;
for (int i = 0; i < n; i++) {
int w;
cin >> w;
W.push_back(w);
}
return W;
}
bool IsAllLoaded(int P, vector<int> &W, int k) {
int TrackIndex = 0;
int CurrentSum = 0;
... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
vector<int> Input(const int n) {
vector<int> W;
for (int i = 0; i < n; i++) {
int w;
cin >> w;
W.push_back(w);
}
return W;
}
bool IsAllLoaded(int P, vector<int> &W, int k) {
int TrackIndex = 0;
int CurrentSum = 0;
... | replace | 47 | 48 | 47 | 50 | TLE | |
p02270 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MAX = 100000;
int function(int P, int k, int w[], int m) {
int j = 0;
int c = 0;
int nk = 0;
int np = 0;
while (nk < k) {
for (int i = j; i < m; i++, c++) {
np += w[i];
if... | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MAX = 100000;
int function(int P, int k, int w[], int m) {
int j = 0;
int c = 0;
int nk = 0;
int np = 0;
while (nk < k) {
for (int i = j; i < m; i++, c++) {
np += w[i];
if... | insert | 21 | 21 | 21 | 23 | TLE | |
p02270 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a... | replace | 31 | 32 | 31 | 32 | 0 | |
p02271 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
bool can_make(vector<int> &A, int m, vector<vector<int>> dp, size_t i = 0) {
if (i == A.size())
return !m;
if (!m)
return (dp[m][i] = 1);
if (m < 0)
return false;
if (~dp[m][i])
return dp[m][i];
if (m >= A[i])
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
bool can_make(vector<int> &A, int m, vector<vector<int>> &dp, size_t i = 0) {
if (i == A.size())
return !m;
if (!m)
return (dp[m][i] = 1);
if (m < 0)
return false;
if (~dp[m][i])
return dp[m][i];
if (m >= A[i])
... | replace | 6 | 7 | 6 | 7 | TLE | |
p02271 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, A[20], s[20], b[1000000], bc = 0, q, m;
bool rec(int i) {
if (i == n) {
int sum = 0;
for (int j = 0; j < n; ++j) {
// cout << s[j] << ",";
if (s[j])
sum += A[j];
}
b[bc] = sum;
++bc;
// cout << endl;
return 0;
}
re... | #include <iostream>
using namespace std;
int n, A[20], s[20], b[10000000], bc = 0, q, m;
bool rec(int i) {
if (i == n) {
int sum = 0;
for (int j = 0; j < n; ++j) {
// cout << s[j] << ",";
if (s[j])
sum += A[j];
}
b[bc] = sum;
++bc;
// cout << endl;
return 0;
}
r... | replace | 4 | 5 | 4 | 5 | 0 | |
p02271 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
bool isSumExist(vector<int> A, int pos, int digit) {
if (digit == 0) {
return (true);
}
if (pos >= A.size() || digit < 0) {
return (false);
}
return (isSumExist(A, pos + 1, digit - A[pos]) ||
isSumExist(A, pos + 1, digit));
}
void... | #include <iostream>
#include <vector>
using namespace std;
bool isSumExist(vector<int> &A, int pos, int digit) {
if (digit == 0) {
return (true);
}
if (pos >= A.size() || digit < 0) {
return (false);
}
return (isSumExist(A, pos + 1, digit - A[pos]) ||
isSumExist(A, pos + 1, digit));
}
voi... | replace | 5 | 6 | 5 | 6 | TLE | |
p02271 | C++ | Runtime Error | #include <iostream>
#define N_MAX 20
#define M_MAX 2001
#define NIL -1
using namespace std;
int n;
int a[N_MAX], dp[N_MAX][M_MAX];
// can make m after a[i] or not
bool solve(int i, int m) {
if (dp[i][m] != NIL)
return dp[i][m];
if (m == 0) {
dp[i][m] = 1;
} else if (i >= n) {
dp[i][m] = 0;
} els... | #include <iostream>
#define N_MAX 100
#define M_MAX 100000
#define NIL -1
using namespace std;
int n;
int a[N_MAX], dp[N_MAX][M_MAX];
// can make m after a[i] or not
bool solve(int i, int m) {
if (dp[i][m] != NIL)
return dp[i][m];
if (m == 0) {
dp[i][m] = 1;
} else if (i >= n) {
dp[i][m] = 0;
} ... | replace | 2 | 4 | 2 | 4 | 0 | |
p02271 | C++ | Time Limit Exceeded | #include <climits>
#include <iostream>
#include <list> //???????????????????????????
#include <vector> //????????¢??????????????????
using namespace std;
bool solve(int i, int m, vector<int> A) {
if (m == 0) {
return true;
}
int n = A.size();
if (i >= n) {
return false;
}
bool res = solve(i + ... | #include <climits>
#include <iostream>
#include <list> //???????????????????????????
#include <vector> //????????¢??????????????????
using namespace std;
bool solve(int i, int m, vector<int> &A) {
if (m == 0) {
return true;
}
int n = A.size();
if (i >= n) {
return false;
}
bool res = solve(i +... | replace | 6 | 7 | 6 | 7 | TLE | |
p02271 | C++ | Runtime Error | #include <stdio.h>
#define MAX 20
int A[MAX], n;
bool check(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = check(i + 1, m) || check(i + 1, m - A[i]);
return res;
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%... | #include <stdio.h>
#define MAX 20
int A[MAX], n;
bool check(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = check(i + 1, m) || check(i + 1, m - A[i]);
return res;
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%... | replace | 22 | 23 | 22 | 23 | -11 | |
p02271 | C++ | Runtime Error | // 枝刈り無し
#include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int n, q;
vector<int> A;
bool solve(int i, int m) {
if (m == 0)
return true;
return solve(i + 1, m) || solve(i + 1, m - A[i]);
}
int mai... | // 枝刈り無し
#include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int n, q;
vector<int> A;
bool solve(int i, int m) {
if (m == 0)
return true;
if (i >= n)
return false;
return solve(i + 1, m) || so... | insert | 18 | 18 | 18 | 20 | -11 | |
p02271 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
bool serach(std::vector<int>, int);
bool serach(std::vector<int>, int, int, int);
int main(int argc, char const *argv[]) {
int n, q;
int a, m;
std::vector<int> A;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a;
A.push_back(a);
}
std::cin >> q;
... | #include <iostream>
#include <vector>
bool serach(std::vector<int>, int);
bool serach(std::vector<int>, int, int, int);
int main(int argc, char const *argv[]) {
int n, q;
int a, m;
std::vector<int> A;
std::cin >> n;
for (int i = 0; i < n; ++i) {
std::cin >> a;
A.push_back(a);
}
std::cin >> q;
... | replace | 43 | 45 | 43 | 44 | TLE | |
p02271 | C++ | Runtime Error | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 1000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせから求... | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 10000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせから... | replace | 11 | 12 | 11 | 12 | 0 | |
p02271 | C++ | Runtime Error | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 1000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせから求... | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 100000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせか... | replace | 11 | 12 | 11 | 12 | 0 | |
p02271 | C++ | Time Limit Exceeded | #include <cstdio>
bool solve(int A[], int size, int index, int remain) {
bool a, b;
if (remain == 0) {
return true;
} else if (size <= index || remain < 0) {
return false;
} else {
a = solve(A, size, index + 1, remain);
b = solve(A, size, index + 1, remain - A[index]);
}
return a || b;
}
in... | #include <cstdio>
bool solve(int A[], int size, int index, int remain) {
bool a, b;
if (remain == 0) {
return true;
} else if (size <= index || remain < 0) {
return false;
} else {
a = solve(A, size, index + 1, remain);
b = solve(A, size, index + 1, remain - A[index]);
}
return a || b;
}
in... | replace | 25 | 26 | 25 | 26 | TLE | |
p02271 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
bool solve(vector<int> a, int target) {
int last = a[a.size() - 1];
if (last ... | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
bool solve(vector<int> a, int target) {
int last = a[a.size() - 1];
if (last ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02271 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
bool a[2001] = {0};
int x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = 2001; j >= 0; j--) {
if (a[j]) {
a[j + x] = true;
}
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
bool a[2001] = {0};
int x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
for (int j = 2000; j >= 0; j--) {
if (a[j]) {
a[j + x] = true;
}
}
... | replace | 15 | 16 | 15 | 16 | -6 | *** stack smashing detected ***: terminated
|
p02271 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | replace | 67 | 68 | 67 | 68 | -11 | |
p02271 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, A[30];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q;
int M[210];... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int n, A[30];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q;
int M[210];... | replace | 23 | 24 | 23 | 24 | TLE | |
p02271 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int data[20], n;
bool solve(int i, int m) {
if (i > n)
return false;
if (m - data[i] == 0)
return true;
if (solve(i + 1, m - data[i]))
return true;
if (solve(i + 1, m))
return true;
return false;
}
int main() {
for (; cin >> n, n;) {
for (int i... | #include <iostream>
using namespace std;
int data[20], n;
bool solve(int i, int m) {
if (i > n)
return false;
if (m - data[i] == 0)
return true;
if (solve(i + 1, m - data[i]))
return true;
if (solve(i + 1, m))
return true;
return false;
}
int main() {
for (; cin >> n;) {
for (int i = ... | replace | 18 | 19 | 18 | 19 | TLE | |
p02271 | C++ | Time Limit Exceeded | #include <cstdint>
#include <vector>
using namespace std;
static bool aux(vector<uint32_t> vec, uint32_t index, int32_t val) {
if (val == 0)
return true;
if (vec.size() == index || (val < 0)) {
return false;
}
int32_t rem = val - vec[index];
return aux(vec, index + 1, rem) || aux(vec, index + 1, ... | #include <cstdint>
#include <vector>
using namespace std;
static bool aux(vector<uint32_t> &vec, uint32_t index, int32_t val) {
if (val == 0)
return true;
if (vec.size() == index || (val < 0)) {
return false;
}
int32_t rem = val - vec[index];
return aux(vec, index + 1, rem) || aux(vec, index + 1,... | replace | 5 | 6 | 5 | 6 | TLE | |
p02271 | C++ | Runtime Error | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 1000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせから求... | // 全探索
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
using namespace std;
const int MAX_N = 20;
const int MAX_N_2 = 10000000;
const int MAX_Q = 200;
// 入力値を保持するバッファ
int input_buffer[MAX_N + 1];
// 組み合わせの管理用バッファ
int comb_buffer[MAX_N + 1];
// 組み合わせから... | replace | 11 | 12 | 11 | 12 | 0 | |
p02271 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int m, n, q, A[20];
int ans(int x, int y) {
if (x == 0)
return 0;
if (ans(x, y + 1) == 0 || ans(x - A[y], y + 1) == 0)
return 0;
else
return 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; ... | #include <bits/stdc++.h>
using namespace std;
int m, n, q, A[20];
int ans(int x, int y) {
if (x == 0)
return 0;
if (y >= n)
return 1;
if (ans(x, y + 1) == 0 || ans(x - A[y], y + 1) == 0)
return 0;
else
return 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> ... | insert | 6 | 6 | 6 | 8 | -11 | |
p02271 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, a[21], num;
bool saiki(int i, int sum) {
if (sum == num)
return 1;
if (saiki(i + 1, a[i] + sum))
return 1;
if (saiki(i + 1, sum))
return 1;
return 0;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int q;
cin >> q;
whi... | #include <iostream>
using namespace std;
int n, a[21], num;
bool saiki(int i, int sum) {
if (sum == num)
return 1;
if (i == n)
return 0;
if (saiki(i + 1, a[i] + sum))
return 1;
if (saiki(i + 1, sum))
return 1;
return 0;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i]... | insert | 7 | 7 | 7 | 9 | -11 | |
p02271 | C++ | Runtime Error | #include <cstdio>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
struct Node {
size_t v;
bool used[20];
char padding[4];
Node() : v(0) { memset(used, false, 20); }
};
static vector<int> FindPossibleValues(const size_t *A, int n, size_t size) {
vector<int> values(size + 1);
v... | #include <cstdio>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
struct Node {
size_t v;
bool used[20];
char padding[4];
Node() : v(0) { memset(used, false, 20); }
};
static vector<int> FindPossibleValues(const size_t *A, int n, size_t size) {
vector<int> values(size + 1);
v... | replace | 27 | 28 | 27 | 28 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define INFTY 2000000000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int *L = new int[n1 + 1];
int *R = new int[n2 + 1];
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n... | #include <iostream>
using namespace std;
#define INFTY 2000000000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int *L = new int[n1 + 1];
int *R = new int[n2 + 1];
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n... | replace | 44 | 45 | 44 | 45 | 0 | |
p02272 | C++ | Time Limit Exceeded | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
void merge(vector<int> &A, int left, int mid, int right, int &c) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1, 0);
vector<int> R(n2 + 1, 0);
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i =... | #include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
void merge(vector<int> &A, int left, int mid, int right, int &c) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1, 0);
vector<int> R(n2 + 1, 0);
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i =... | replace | 49 | 52 | 49 | 55 | TLE | |
p02272 | C++ | Runtime Error | #include <stdio.h>
#define SENTINEL 1000000001
int count = 0;
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
... | #include <stdio.h>
#define SENTINEL 1000000001
int count = 0;
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
... | replace | 53 | 54 | 53 | 54 | 0 | |
p02272 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
constexpr int MAX_N = 500'000;
constexpr int MAX_VAL = 1e9 + 1;
int merge(int *A, const int &left, const int &mid, const int &right) {
const int n1 = mid - left;
const int n2 = right - mid;
auto... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
constexpr int MAX_N = 500'000;
constexpr int MAX_VAL = 1e9 + 1;
int merge(int *A, const int &left, const int &mid, const int &right) {
const int n1 = mid - left;
const int n2 = right - mid;
auto... | insert | 37 | 37 | 37 | 39 | MLE | |
p02272 | C++ | Runtime Error | #include <iostream>
#include <limits>
#define INFINITY 0xFFFFFF
void mergeSort(int *A, int left, int right);
using namespace std;
int ct = 0;
int main() {
int *S;
int n;
cin >> n;
S = new int[n];
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
/*for (int i = 0; i < n; ++i) {
cout << S[i];
cout << " "... | #include <iostream>
#include <limits>
#define INFINITY 0x7FFFFFFF
void mergeSort(int *A, int left, int right);
using namespace std;
int ct = 0;
int main() {
int *S;
int n;
cin >> n;
S = new int[n];
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
/*for (int i = 0; i < n; ++i) {
cout << S[i];
cout << "... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 50000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2;... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int MAX = 50000;
const int SENTINEL = 2000000000;
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for... | #include <iostream>
using namespace std;
const int MAX = 500000;
const int SENTINEL = 2000000000;
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
fo... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
int num_comp = 0;
const int MAX = 500000;
int L[MAX / 2 + 2];
int R[MAX / 2 + 2];
const int SENTINEL = 200000000;
// Merge
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];... | #include <iostream>
using namespace std;
int num_comp = 0;
const int MAX = 500000;
int L[MAX / 2 + 2];
int R[MAX / 2 + 2];
const int SENTINEL = 2000000000;
// Merge
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i]... | replace | 8 | 9 | 8 | 9 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 500000
#define Sentinel 19970328
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i ... | #include <iostream>
using namespace std;
#define MAX 500000
#define Sentinel 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 5000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i <... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[50105], m;
long long inf = 2e9;
void Merge(int left, int mid, int rigth) {
int n1 = mid - left, n2 = rigth - mid;
int l[n1], r[n2];
for (int i = 0; i < n1; i++) {
l[i] = a[left + i];
}
for (int i = 0; i < n2; i++) {
r[i] = a[mid + i];
}
l[n1]... | #include <bits/stdc++.h>
using namespace std;
int n, a[500105], m;
long long inf = 2e9;
void Merge(int left, int mid, int rigth) {
int n1 = mid - left, n2 = rigth - mid;
int l[n1], r[n2];
for (int i = 0; i < n1; i++) {
l[i] = a[left + i];
}
for (int i = 0; i < n2; i++) {
r[i] = a[mid + i];
}
l[n1... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 50000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2;... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | replace | 17 | 18 | 17 | 18 | -11 | |
p02272 | C++ | Runtime Error | //
// test.cpp
// AtCoder
//
// Created by A on 2018/06/01.
// Copyright © 2018年 A. All rights reserved.
//
#include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 200000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid... | //
// test.cpp
// AtCoder
//
// Created by A on 2018/06/01.
// Copyright © 2018年 A. All rights reserved.
//
#include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mi... | replace | 11 | 12 | 11 | 12 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int merges(int start, int end) {
int middle;
if (start + 1 < end) {
middle = (start + end) / 2;
return (merges(start, middle) + merges(middle, end) - start + end);
} else {
return 0;
... | #include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
using namespace std;
int merges(int start, int end) {
int middle;
if (start + 1 < end) {
middle = (start + end) / 2;
return (merges(start, middle) + merges(middle, end) - start + end);
} else {
return 0;
... | replace | 18 | 19 | 18 | 19 | -11 | |
p02272 | C++ | Memory Limit Exceeded | #include <iostream>
using namespace std;
int n;
int a[500005];
int count = 0;
void merge(int l, int mid, int r) {
int n1 = mid - l;
int n2 = r - mid;
int *lf = new int[n1];
int *rt = new int[n2];
for (int i = 0; i < n1; i++) {
lf[i] = a[l + i];
}
for (int i = 0; i < n2; i++) {
rt[i] = a[mid + i... | #include <iostream>
using namespace std;
int n;
int a[500005];
int count = 0;
void merge(int l, int mid, int r) {
int n1 = mid - l;
int n2 = r - mid;
int *lf = new int[n1];
int *rt = new int[n2];
for (int i = 0; i < n1; i++) {
lf[i] = a[l + i];
}
for (int i = 0; i < n2; i++) {
rt[i] = a[mid + i... | insert | 31 | 31 | 31 | 33 | MLE | |
p02272 | C++ | Memory Limit Exceeded | #include <cstdlib>
#include <iostream>
using namespace std;
#define INF 1000000000
int count = 0;
void merge(int a[], int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid, i, j, k;
int *m1 = (int *)malloc((n1 + 1) * sizeof(int)),
*m2 = (int *)malloc((n2 + 1) * sizeof(int));
for (i = 0; i < ... | #include <cstdlib>
#include <iostream>
using namespace std;
#define INF 1000000000
int count = 0;
void merge(int a[], int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid, i, j, k;
int *m1 = (int *)malloc((n1 + 1) * sizeof(int)),
*m2 = (int *)malloc((n2 + 1) * sizeof(int));
for (i = 0; i < ... | insert | 25 | 25 | 25 | 27 | MLE | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | replace | 29 | 30 | 29 | 30 | -11 | |
p02272 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAX_N 500000
#define INF 1000000001
void print_array(int A[], int n) {
for (int i = 0; i < n; i++) {
printf("%d", A[i]);
if (i != n - 1) {
printf(" ");
}
}
printf("\n");
}
int merge(int A[], int left, int ... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAX_N 500000
#define INF 1000000001
void print_array(int A[], int n) {
for (int i = 0; i < n; i++) {
printf("%d", A[i]);
if (i != n - 1) {
printf(" ");
}
}
printf("\n");
}
int merge(int A[], int left, int ... | replace | 21 | 23 | 21 | 23 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define INFTY 100100100
int S[500100] = {0};
int n, cnt = 0;
void merge(int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int *L = new int[n1 + 1], *R = new int[n2 + 1];
for (int i = 0; i < n1; ++i) {
L[i] = S[left + i];
}
for (int i... | #include <iostream>
using namespace std;
#define INFTY 1001001001
int S[500100] = {0};
int n, cnt = 0;
void merge(int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int *L = new int[n1 + 1], *R = new int[n2 + 1];
for (int i = 0; i < n1; ++i) {
L[i] = S[left + i];
}
for (int ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int INF = 1 << 30;
template <class RandomIt> size_t msort(RandomIt first, RandomIt last) {
if (first + 1 >= last)
return 0;
using T = typename RandomIt::value_type;
ptrdiff_t lhalf = (last - first) >> 1;
RandomIt mid = f... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int INF = 1 << 30;
template <class RandomIt> size_t msort(RandomIt first, RandomIt last) {
if (first + 1 >= last)
return 0;
using T = typename RandomIt::value_type;
ptrdiff_t lhalf = (last - first) >> 1;
RandomIt mid = f... | replace | 26 | 27 | 26 | 27 | -6 | malloc(): corrupted top size
|
p02272 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[120000], t[120000], r = 0;
void mergesort(int lo, int hi) {
if (lo == hi)
return;
int mid = (lo + hi) / 2;
mergesort(lo, mid);
mergesort(mid + 1, hi);
int i, j, k;
i = lo;
j = mid + 1;
for (k = lo; k <= hi; k++) {
if (i == mid + 1)
t[k]... | #include <bits/stdc++.h>
using namespace std;
int a[500009], t[500009], r = 0;
void mergesort(int lo, int hi) {
if (lo == hi)
return;
int mid = (lo + hi) / 2;
mergesort(lo, mid);
mergesort(mid + 1, hi);
int i, j, k;
i = lo;
j = mid + 1;
for (k = lo; k <= hi; k++) {
if (i == mid + 1)
t[k]... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#define NMAX 5000
#define SENTINEL 1000000001
int cnt = 0;
using namespace std;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[NMAX], R[NMAX];
for (int i = 0; i <= n1 - 1; i++) {
L[i] = A[left + i];
}
for (in... | #include <cstdio>
#include <iostream>
#define NMAX 500000
#define SENTINEL 1000000001
int cnt = 0;
using namespace std;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[NMAX], R[NMAX];
for (int i = 0; i <= n1 - 1; i++) {
L[i] = A[left + i];
}
for (... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Runtime Error | #include <stdio.h>
int count = 0;
int temp[500000];
void MergeSort(int *, int, int);
int main(void) {
int i, n;
int A[1000000000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
MergeSort(A, 0, n - 1);
/*出力*/
for (i = 0; i < n - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A... | #include <stdio.h>
int count = 0;
int temp[500000];
void MergeSort(int *, int, int);
int main(void) {
int i, n;
int A[1000000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
MergeSort(A, 0, n - 1);
/*出力*/
for (i = 0; i < n - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[n ... | replace | 10 | 11 | 10 | 11 | -11 | |
p02272 | C++ | Runtime Error | #define PI 3.14159265359
#define INF 200000000
#define MAX 500000
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int cnt = 0;
int L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(int A[],... | #define PI 3.14159265359
#define INF 2000000000
#define MAX 500000
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int cnt = 0;
int L[MAX / 2 + 2], R[MAX / 2 + 2];
void merge(int A[]... | replace | 1 | 2 | 1 | 2 | 0 | |
p02272 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int A[50001], S = 0;
int merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++)
L[i] = A[i + l];
for (i = 0; i < n2; i++)
R[i] = A[i + m];
i = j = 0;
for (int k = 0; k < r - l; k++... | #include <cstdio>
#include <iostream>
using namespace std;
int A[500000], S = 0;
int merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++)
L[i] = A[i + l];
for (i = 0; i < n2; i++)
R[i] = A[i + m];
i = j = 0;
for (int k = 0; k < r - l; k+... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
int b[100099], n = 0, ans = 0;
void Merge(int a[], int l, int r) {
int m = (l + r) / 2;
int i = l, j = m + 1, sum[r - l + 1], cnt = -1;
ans += r - l + 1;
while (i <= m && j <= r) {
if (a[i] < a[j])
sum[++cnt] = a[i++];
else
sum[++cnt] = a[j++];
}... | #include <iostream>
using namespace std;
int b[500099], n = 0, ans = 0;
void Merge(int a[], int l, int r) {
int m = (l + r) / 2;
int i = l, j = m + 1, sum[r - l + 1], cnt = -1;
ans += r - l + 1;
while (i <= m && j <= r) {
if (a[i] < a[j])
sum[++cnt] = a[i++];
else
sum[++cnt] = a[j++];
}... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 4], R[MAX / 4];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | replace | 5 | 6 | 5 | 6 | 0 | |
p02272 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <type_traits>
#include <vector>
using namespace std;
static int comp_count = 0;
#ifndef NDEBUG
#define _DBG 1
#include <stdio.h>
#else
#define _DBG 0
#endif
#define DbgP(fmt, ...) \
do { ... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <type_traits>
#include <vector>
using namespace std;
static int comp_count = 0;
#define NDEBUG 1
#ifndef NDEBUG
#define _DBG 1
#include <stdio.h>
#else
#define _DBG 0
#endif
#define DbgP(fmt, ...) \... | insert | 9 | 9 | 9 | 11 | 0 | merge(0,0,1,1)
merge(0,1,2,2)
merge(3,3,4,4)
merge(0,2,3,4)
merge(5,5,6,6)
merge(5,6,7,7)
merge(8,8,9,9)
merge(5,7,8,9)
merge(0,4,5,9)
|
p02272 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int A[5000], S = 0;
int merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++)
L[i] = A[i + l];
for (i = 0; i < n2; i++)
R[i] = A[i + m];
i = 0;
j = 0;
// printf("%d %d : \n", L[... | #include <cstdio>
#include <iostream>
using namespace std;
int A[500000], S = 0;
int merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++)
L[i] = A[i + l];
for (i = 0; i < n2; i++)
R[i] = A[i + m];
i = 0;
j = 0;
// printf("%d %d : \n", ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Memory Limit Exceeded | #include <climits>
#include <iostream>
#include <vector>
void merge(std::vector<int> *A, int left, int mid, int right, int *count) {
int n1 = mid - left;
int n2 = right - mid;
std::vector<int> *L = new std::vector<int>(n1 + 1, 0);
std::vector<int> *R = new std::vector<int>(n2 + 1, 0);
for (int i = 0; i < n... | #include <climits>
#include <iostream>
#include <vector>
void merge(std::vector<int> *A, int left, int mid, int right, int *count) {
int n1 = mid - left;
int n2 = right - mid;
std::vector<int> *L = new std::vector<int>(n1 + 1, 0);
std::vector<int> *R = new std::vector<int>(n2 + 1, 0);
for (int i = 0; i < n... | insert | 36 | 36 | 36 | 39 | MLE | |
p02272 | C++ | Runtime Error | #include <iostream>
#define MAXN 100000 + 5
using namespace std;
int a[MAXN];
int t[MAXN];
int count = 0;
void merge(int *A, int x, int y, int *T) {
if (y - x > 1) {
int mid = x + (y - x) / 2;
int p = x, q = mid, i = x;
merge(A, x, mid, T);
merge(A, mid, y, T);
while (q < y || p < mid) {
if ... | #include <iostream>
#define MAXN 500000 + 5
using namespace std;
int a[MAXN];
int t[MAXN];
int count = 0;
void merge(int *A, int x, int y, int *T) {
if (y - x > 1) {
int mid = x + (y - x) / 2;
int p = x, q = mid, i = x;
merge(A, x, mid, T);
merge(A, mid, y, T);
while (q < y || p < mid) {
if ... | replace | 1 | 2 | 1 | 2 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define INFINITY 2000000000
#define MAX 50000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
L[n1] = R[n2] = INFINITY;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];... | #include <iostream>
using namespace std;
#define INFINITY 2000000000
#define MAX 500000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
L[n1] = R[n2] = INFINITY;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <stdio.h>
#define INF 999999999
int l[25002] = {};
int r[25002] = {};
int c;
void merge(int *s, int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
l[i] = s[left + i];
for (i = 0; i < n2; i++)
r[i] = s[mid + i];
l[n1] ... | #include <stdio.h>
#define INF 999999999
int l[250002] = {};
int r[250002] = {};
int c;
void merge(int *s, int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
l[i] = s[left + i];
for (i = 0; i < n2; i++)
r[i] = s[mid + i];
l[n1... | replace | 3 | 5 | 3 | 5 | 0 | |
p02272 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
#define INF 1000000000
#define nmax 500005
using namespace std;
int n;
int cnt = 0;
vector<int> a;
void merge(int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> l(nmax);
vector<int> r(nmax);
int i, j;
for (i = 0; i < n1; i++)
... | #include <iostream>
#include <vector>
#define INF 1000000000
#define nmax 500005
using namespace std;
int n;
int cnt = 0;
vector<int> a;
void merge(int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> l(n1 + 5);
vector<int> r(n1 + 5);
int i, j;
for (i = 0; i < n1; i++)
... | replace | 13 | 15 | 13 | 15 | TLE | |
p02272 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int MargeElem(int elem[], int start, int mid, int end) {
int i, j, k, l;
int num = 0;
int A[2500], B[2500];
i = mid - start;
j = end - mid;
l = (i > j) ? i : j;
for (k = 0; k < l; k++) {
A[k] = elem[start + k];
B[k] = elem[mid + k];
}
... | #include <cstdio>
#include <iostream>
using namespace std;
int MargeElem(int elem[], int start, int mid, int end) {
int i, j, k, l;
int num = 0;
int A[250001], B[250001];
i = mid - start;
j = end - mid;
l = (i > j) ? i : j;
for (k = 0; k < l; k++) {
A[k] = elem[start + k];
B[k] = elem[mid + k];
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int INFTY = 1000000;
int cnt = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2;
int *L, *R;
n1 = mid - left;
n2 = right - mid;
L = new int[n1 + 1];
R = new int[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; ... | #include <iostream>
using namespace std;
const int INFTY = 1000000000;
int cnt = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2;
int *L, *R;
n1 = mid - left;
n2 = right - mid;
L = new int[n1 + 1];
R = new int[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02272 | C++ | Runtime Error | //??????????????????
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, k, n) for (int i = k; i < n; i++)
#define INFTY 200000000
using namespace std;
int L[250002], R[250002], cnt;
//???????????????????£????????????§????????????
void merge(int A[], int n, int left, int mid, int right) ... | //??????????????????
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep3(i, k, n) for (int i = k; i < n; i++)
#define INFTY 2000000000
using namespace std;
int L[250002], R[250002], cnt;
//???????????????????£????????????§????????????
void merge(int A[], int n, int left, int mid, int right)... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
const int INFTY = 1000000001;
int S[200010], n, cmp;
void merge(int left, int mid, int right) {... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
const int INFTY = 1000000001;
int S[500010], n, cmp;
void merge(int left, int mid, int right) {... | replace | 14 | 15 | 14 | 15 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 50000
#define INF 200000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i+... | #include <iostream>
using namespace std;
#define MAX 500000
#define INF 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; ... | replace | 3 | 5 | 3 | 5 | 0 | |
p02272 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define MAX 500000
#define INFTY 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2], count;
void marge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid;
int i, j, k;
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0;... | #include <iostream>
using namespace std;
#define MAX 500000
#define INFTY 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2], count;
void marge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid;
int i, j, k;
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0;... | replace | 18 | 19 | 18 | 19 | TLE | |
p02272 | C++ | Runtime Error | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static void inputArray(uint32_t A[], int num) {
for (int i = 0; i < num; i++) {
cin >> A[i];
}
}
static void printArray(uint32_t A[], int num) {
for (int i = 0; i < num; i++) {
cout << (i != 0 ? " " : "") << A[i];
}
cout ... | #include <cstdint>
#include <iostream>
#include <vector>
using namespace std;
static void inputArray(uint32_t A[], int num) {
for (int i = 0; i < num; i++) {
cin >> A[i];
}
}
static void printArray(uint32_t A[], int num) {
for (int i = 0; i < num; i++) {
cout << (i != 0 ? " " : "") << A[i];
}
cout ... | replace | 21 | 23 | 21 | 23 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i =... | replace | 28 | 29 | 28 | 29 | 0 | |
p02272 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[10005], l[10005], r[10005], inf = 5e5 + 1, s;
void merge(int x, int y) {
if (x == y)
return;
int c1 = (x + y) / 2;
int c2 = ((x + y) / 2) + 1;
merge(x, c1);
merge(c2, y);
for (int i = 0; i <= c1 - x; i++)
l[i] = a[i + x];
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int n, a[500005], l[500005], r[500005], inf = 1e9 + 1, s;
void merge(int x, int y) {
if (x == y)
return;
int c1 = (x + y) / 2;
int c2 = ((x + y) / 2) + 1;
merge(x, c1);
merge(c2, y);
for (int i = 0; i <= c1 - x; i++)
l[i] = a[i + x];
for (int i = 0;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 500000
#define NIL 1000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void Merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
... | #include <iostream>
using namespace std;
#define MAX 500000
#define NIL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void Merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int S[500000];
int n;
int cnt;
void merge(int l, int m, int r) {
int n1 = m - l;
int n2 = r - m;
int *L = (int *)malloc(sizeof(int) * (n1 + 1));
int *R = (int *)malloc(sizeof(int) * (n2 + 1));
for (int i = 0; i < n1; i++)
L[i] = S[l + i];
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int S[500000];
int n;
int cnt;
void merge(int l, int m, int r) {
int n1 = m - l;
int n2 = r - m;
int *L = (int *)malloc(sizeof(int) * (n1 + 1));
int *R = (int *)malloc(sizeof(int) * (n2 + 1));
for (int i = 0; i < n1; i++)
L[i] = S[l + i];
for (int i = 0; i... | insert | 29 | 29 | 29 | 31 | MLE | |
p02272 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#define MAX 500000
#define INFINITY 100000000
int n;
int L[MAX / 2 + 1], R[MAX / 2 + 1];
int sum(0);
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0;... | #include <iostream>
#include <stdio.h>
#define MAX 500000
#define INFINITY 1000000000
int n;
int L[MAX / 2 + 1], R[MAX / 2 + 1];
int sum(0);
void Merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <cstdio>
using namespace std;
#define INF 123456789;
int L[300000], R[300000];
int cnt;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = INF... | #include <cstdio>
using namespace std;
#define INF 1234567890;
int L[300000], R[300000];
int cnt;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = IN... | replace | 3 | 4 | 3 | 4 | 0 | |
p02272 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX_LEN 50000
#define BIG 2000000000
int L[MAX_LEN / 2 + 2], R[MAX_LEN / 2 + 2];
int cnt;
void merge_sort_helper(int *A, int n, int l, int m, int r) {
for (int i = l; i < m; ++i)
L[i - l] = A[i];
for (int i = m; i < r; ++i... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define MAX_LEN 500000
#define BIG 2000000000
int L[MAX_LEN / 2 + 2], R[MAX_LEN / 2 + 2];
int cnt;
void merge_sort_helper(int *A, int n, int l, int m, int r) {
for (int i = l; i < m; ++i)
L[i - l] = A[i];
for (int i = m; i < r; ++... | replace | 6 | 7 | 6 | 7 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define LL long long
#define MAX 600000
#define SENTINEL 200000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int ... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define FOR(k, m, n) for (int(k) = (m); (k) < (n); (k)++)
#define REP(i, n) FOR((i), 0, (n))
#define LL long long
#define MAX 600000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int... | replace | 10 | 11 | 10 | 11 | 0 | |
p02272 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 100000 + 2
int AA[MAXN], TT[MAXN];
int n, g = 0;
void input() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> AA[i];
}
}
void syf(int *A, int x, int y, int *T) {
if (y - x > 1) {
int m = (x + y) / 2;
int i... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 500000 + 2
int AA[MAXN], TT[MAXN];
int n, g = 0;
void input() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> AA[i];
}
}
void syf(int *A, int x, int y, int *T) {
if (y - x > 1) {
int m = (x + y) / 2;
int i... | replace | 4 | 5 | 4 | 5 | 0 | |
p02272 | C++ | Runtime Error | #include <stdio.h>
#define SIZE 500
#define INFTY 120000
int count = 0;
void show(int *a, int size) {
int i;
printf("%d", a[0]);
for (i = 1; i < size; i++)
printf(" %d", a[i]);
printf("\n");
}
void Merge(int *A, int left, int mid, int right) {
int R[SIZE], L[SIZE];
int i, j, k, n1, n2;
n1 = mid - l... | #include <stdio.h>
#define SIZE 500000
#define INFTY 1200000000
int count = 0;
void show(int *a, int size) {
int i;
printf("%d", a[0]);
for (i = 1; i < size; i++)
printf(" %d", a[i]);
printf("\n");
}
void Merge(int *A, int left, int mid, int right) {
int R[SIZE], L[SIZE];
int i, j, k, n1, n2;
n1 = ... | replace | 2 | 4 | 2 | 4 | 0 | |
p02273 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
// びっくりするくらいつまらないことで詰まってることも多い
int n; // 問題で設定された呼び出し階層の深さ
class dot {
public:
double x;
double y;
dot(double X, double Y) {
x = X;
y = Y;
}
};
void mak... | #include <iostream>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
// びっくりするくらいつまらないことで詰まってることも多い
int n; // 問題で設定された呼び出し階層の深さ
class dot {
public:
double x;
double y;
dot(double X, double Y) {
x = X;
y = Y;
}
};
void mak... | insert | 68 | 68 | 68 | 69 | 0 | |
p02274 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
#define int long long
int tempmarge[1000100];
int N, A[10000000];
int MargeSort(int x[], int left, int right) {
int mid, i, j, k, cl, cr, c;
if (left >= right)
return 0;
mid = (left + right) / 2;
cl = MargeSort(x, left, mid);... | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
#define int long long
int tempmarge[1000100];
int N, A[10000000];
int MargeSort(int x[], int left, int right) {
int mid, i, j, k, cl, cr, c;
if (left >= right)
return 0;
mid = (left + right) / 2;
cl = MargeSort(x, left, mid);... | delete | 39 | 41 | 39 | 39 | 0 | 1
2
3
4
5
|
p02274 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (1000000001)
int N;
int A[(1 << 21) + 1];
int T[(1 << 21) + 1];
ll res = 0;
void marge(int l, int r) {
if (r - l == 2) {
if (A[l] > A[r - 1]) {
res++;
swap(A[l], A[r - 1]);
}
} else {
int m = (l + r) / 2;
ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (1000000001)
int N;
int A[(1 << 21) + 1];
int T[(1 << 21) + 1];
ll res = 0;
void marge(int l, int r) {
if (r - l == 2) {
if (A[l] > A[r - 1]) {
res++;
swap(A[l], A[r - 1]);
}
} else {
int m = (l + r) / 2;
ma... | replace | 42 | 50 | 42 | 54 | 0 | |
p02274 | C++ | Runtime Error |
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 2e4 + 5;
const int sentinel = 0x3f3f3f3f;
int l[maxn / 2 + 2], r[maxn / 2 + 2], a[maxn], n;
LL merge(int left, int mid, int right) {
int i, j, k;
LL cnt = 0;
int n1 = mid - left;
int n2 = right - mid;
for (... |
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 5;
const int sentinel = 0x3f3f3f3f;
int l[maxn / 2 + 2], r[maxn / 2 + 2], a[maxn], n;
LL merge(int left, int mid, int right) {
int i, j, k;
LL cnt = 0;
int n1 = mid - left;
int n2 = right - mid;
for (... | replace | 8 | 9 | 8 | 9 | 0 | |
p02274 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | replace | 58 | 59 | 58 | 59 | 0 | |
p02274 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
template <class V, int ME> class BIT {
public:
V bit... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
template <class V, int ME> class BIT {
public:
V bit... | replace | 42 | 43 | 42 | 43 | 0 | |
p02274 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100010;
int bit[MAX_N], n_, n;
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 1000100;
int bit[MAX_N], n_, n;
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02274 | Python | Time Limit Exceeded | n = int(input())
nd = list(map(int, input().split()))
c = 0
for i in range(n):
m = min(nd)
index = nd.index(m)
nd.remove(m)
c += index
print(c)
| n = int(input())
nlist = list(map(int, input().split()))
W = [0 for i in range(n)]
def M(l, r): ##l~r-1 까지의 리스트.
if l + 1 >= r:
return 0
elif l + 2 == r:
if nlist[l] <= nlist[l + 1]:
return 0
else:
nlist[l], nlist[l + 1] = nlist[l + 1], nlist[l]
ret... | replace | 1 | 9 | 1 | 47 | TLE | |
p02275 | C++ | Runtime Error | #include <iostream>
#define N 1000000
using namespace std;
int main() {
int i, j, n, k = 0;
int A[N], B[N], C[N];
cin >> n;
for (i = 0; i < n; ++i) {
cin >> A[i];
if (A[i] > k)
k = A[i];
}
for (i = 0; i <= k; ++i)
C[i] = 0;
for (i = 0; i < n; ++i)
C[A[i]]++;
for (i = 0; i <= k;... | #include <iostream>
#define N 2000000
using namespace std;
int main() {
int i, j, n, k = 0;
int A[N], B[N], C[N];
cin >> n;
for (i = 0; i < n; ++i) {
cin >> A[i];
if (A[i] > k)
k = A[i];
}
for (i = 0; i <= k; ++i)
C[i] = 0;
for (i = 0; i < n; ++i)
C[A[i]]++;
for (i = 0; i <= k;... | replace | 1 | 2 | 1 | 2 | -11 | |
p02275 | C++ | Runtime Error | #include "iostream"
using namespace std;
int main() {
int in[2000000];
int ans[2000000];
int co[10001];
int n;
cin >> n;
for (int i = 0; i <= 10000; i++) {
co[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> in[i];
co[in[i]]++;
}
co[0]--;
for (int i = 1; i <= 10000; i++) {
co[... | #include "iostream"
using namespace std;
int main() {
short in[2000000];
short ans[2000000];
int co[10001];
int n;
cin >> n;
for (int i = 0; i <= 10000; i++) {
co[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> in[i];
co[in[i]]++;
}
co[0]--;
for (int i = 1; i <= 10000; i++) {
... | replace | 6 | 8 | 6 | 8 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.