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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00513 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, s, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
int flag = 0;
for (int j = 1; j < s; j++) {
int a = s - j;
int b = 2 * j + 1;
if (a % b == 0) {
if (a / b < s) {
flag = 1;
break;
... | #include <iostream>
using namespace std;
int main() {
int n, s, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
int flag = 0;
for (int j = 1; j * j < s; j++) {
int a = s - j;
int b = 2 * j + 1;
if (a % b == 0) {
if (a / b < s) {
flag = 1;
break;... | replace | 8 | 9 | 8 | 9 | TLE | |
p00513 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
bool flag = false;
for (int x = 1; x < s && flag == false; x++) {
if ((s ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
bool flag = false;
for (int x = 1; x * x <= s && flag == false; x++) {
if... | replace | 16 | 17 | 16 | 17 | TLE | |
p00514 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include... | replace | 102 | 103 | 102 | 103 | TLE | |
p00514 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n, m, r;
int now = 1, prev = 0;
ll dp[1001];
ll mod = 1000000;
int main(void) {
scanf("%d%d%d", &n, &m, &r);
r -= m * n;
if (r < 0) {
puts("0");
return 0;
}
if (r == 0) {
puts("1");
return... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n, m, r;
int now = 1, prev = 0;
ll dp[100001];
ll mod = 1000000;
int main(void) {
scanf("%d%d%d", &n, &m, &r);
r -= m * n;
if (r < 0) {
puts("0");
return 0;
}
if (r == 0) {
puts("1");
retu... | replace | 8 | 9 | 8 | 9 | 0 | |
p00516 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, a[1000], b[1000], cnt[1000] = {};
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
int j = 0;
while (a[j] > b[i])
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, a[5000], b[5000], cnt[5000] = {};
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
int j = 0;
while (a[j] > b[i])
... | replace | 4 | 5 | 4 | 5 | 0 | |
p00516 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<int> votes(N);
for (int i = 0; i < M; i++) {
for (int j = 0; j < N... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < M; i++) {
cin >> B[i];
}
vector<int> votes(N);
for (int i = 0; i < M; i++) {
for (int j = 0; j < N... | replace | 8 | 9 | 8 | 9 | 0 | |
p00516 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a[101], b[101], c[101] = {0}, ruio = 0, hideo = 0, nagase = 0, temp = 0;
scanf("%d %d", &ruio, &hideo);
for (int i = 1; i <= ruio; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= hideo; i++) {
scanf("%d", &b[i]);
}
for (int i = 1; i <= hideo; i++) {
for (i... | #include <stdio.h>
int main() {
int a[2001], b[2001], c[2001] = {0}, ruio = 0, hideo = 0, nagase = 0,
temp = 0;
scanf("%d %d", &ruio, &hideo);
for (int i = 1; i <= ruio; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= hideo; i++) {
scanf("%d", &b[i]);
}
for (int i = 1; i ... | replace | 2 | 3 | 2 | 4 | 0 | |
p00517 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int a[100], b[100], w, h;
int solve(int i) {
int x = 0, y = 0, ans = 0, j;
x = max(a[i] - a[i + 1], a[i + 1] - a[i]);
y = max(b[i] - b[i + 1], b[i + 1] - b[i]);
ans = ans + x + y;
for (j = 0; j <= min(w, h); j++) {
if (a[i] - a[i + 1] > j && b[... | #include <algorithm>
#include <iostream>
using namespace std;
int a[10000], b[10000], w, h;
int solve(int i) {
int x = 0, y = 0, ans = 0, j;
x = max(a[i] - a[i + 1], a[i + 1] - a[i]);
y = max(b[i] - b[i + 1], b[i + 1] - b[i]);
ans = ans + x + y;
for (j = 0; j <= min(w, h); j++) {
if (a[i] - a[i + 1] > j &... | replace | 3 | 4 | 3 | 4 | 0 | |
p00517 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#in... | replace | 56 | 57 | 56 | 57 | -11 | |
p00518 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
const int MOD = 10007;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int dp[1000][8] = {};
dp[0][1] = 1;
map<char, int> dic;
for (int i = 0; i < 3; i++)
dic["JOI"[i]] = i;
for (int i = 0; i < ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
const int MOD = 10007;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int dp[1010][8] = {};
dp[0][1] = 1;
map<char, int> dic;
for (int i = 0; i < 3; i++)
dic["JOI"[i]] = i;
for (int i = 0; i < ... | replace | 11 | 12 | 11 | 12 | 0 | |
p00518 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n;
string ta;
int memo[200][200];
int solve(int day, int f) {
if (memo[day][f] != 0)
return memo[day][f];
if (day == n) {
return memo[day][f] = 1;
}
int tmp, sum = 0;
;
for (int i = 0; i < 8; i++) {
if (ta[day] == 'J')
tmp ... | #include <algorithm>
#include <iostream>
using namespace std;
int n;
string ta;
int memo[20000][10];
int solve(int day, int f) {
if (memo[day][f] != 0)
return memo[day][f];
if (day == n) {
return memo[day][f] = 1;
}
int tmp, sum = 0;
;
for (int i = 0; i < 8; i++) {
if (ta[day] == 'J')
tmp... | replace | 5 | 6 | 5 | 6 | 0 | |
p00518 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <string>
#define MOD 10007
using namespace std;
int n;
long long dp[1111][8];
string s;
map<char, int> shift;
long long rec(int idx, int prev) {
if (idx == n)
return 1;
if (dp[idx][prev])
return dp[idx][prev];
long long ret = 0;
int sft = shift[s[idx]];
... | #include <iostream>
#include <map>
#include <string>
#define MOD 10007
using namespace std;
int n;
long long dp[1111][8];
string s;
map<char, int> shift;
long long rec(int idx, int prev) {
if (idx == n)
return 1;
if (dp[idx][prev])
return dp[idx][prev];
long long ret = 0;
int sft = shift[s[idx]];
... | replace | 22 | 23 | 22 | 23 | TLE | |
p00518 | C++ | Runtime Error | // メモリ数確認したか?
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int n;
string ss;
cin >> n >> ss;
const int MAX_N = 1000;
const int mod = 10007;
int dp[MAX_N + 1][7];
for (int j = 0... | // メモリ数確認したか?
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int n;
string ss;
cin >> n >> ss;
const int MAX_N = 1000;
const int mod = 10007;
int dp[MAX_N + 1][7];
for (int j = 0... | replace | 22 | 23 | 22 | 23 | 0 | |
p00519 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef vector<int> Node;
typedef vector<Node> Graph;
typedef pair<int, int> P;
void bfs(int s, int MAX, const Graph &G, vector<int> &res) {
vector<int> dist(G.size(), -1);
queue<int> que;
que.push(s);
dist[s] =... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef vector<int> Node;
typedef vector<Node> Graph;
typedef pair<int, int> P;
void bfs(int s, int MAX, const Graph &G, vector<int> &res) {
vector<int> dist(G.size(), -1);
queue<int> que;
que.push(s);
dist[s] =... | replace | 34 | 35 | 34 | 35 | 0 | |
p00519 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct P {
int c, r;
};
struct State {
int t, pos, remain;
};
/*--------heap begin---------*/
#define SIZE 5000
#define ELEMENT State
ELEMENT heap[SIZE];
int heap_size = 0;
/*
push(x) (up_heap)
... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
struct P {
int c, r;
};
struct State {
int t, pos, remain;
};
/*--------heap begin---------*/
#define SIZE 10000
#define ELEMENT State
ELEMENT heap[SIZE];
int heap_size = 0;
/*
push(x) (up_heap)
... | replace | 16 | 17 | 16 | 17 | 127 | /tmp/c90a7a7c-a527-400b-947c-ba339d3c3958.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p00519 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAX_N 5500
bool x[MAX_N][MAX_N];
int y[MAX_N][2];
bool z[MAX_N];
int m[MAX_N];
int s[MAX_N];
int t[MAX_N][MAX_N];
queue<int> Q;
int main() {
memset(x, false, sizeof(x));
for (int i = 0; i < 5500; i++) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#define MAX_N 5500
bool x[MAX_N][MAX_N];
int y[MAX_N][2];
bool z[MAX_N];
int m[MAX_N];
int s[MAX_N];
int t[MAX_N][MAX_N];
queue<int> Q;
int main() {
memset(x, false, sizeof(x));
for (int i = 0; i < 5500; i++) {
... | replace | 46 | 47 | 46 | 47 | TLE | |
p00519 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
static const int INF = 2e9;
struct Edge {
int to;
int cost;
};
vector<Edge> G1[5001];
vector<Edge> G2[5001];
int d[5001];
bool isUs... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
typedef pair<int, int> P;
static const int INF = 2e9;
struct Edge {
int to;
int cost;
};
vector<Edge> G1[5001];
vector<Edge> G2[5001];
int d[5001];
bool isUs... | replace | 27 | 28 | 27 | 28 | -11 | |
p00521 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | replace | 16 | 17 | 16 | 17 | 0 | |
p00521 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int mm[1001][1001][3];
string flag[1000], emb[2];
int main() {
int m, n;
cin >> m >> n;
int ans = 0;
for (int i = 0; i < m; ++i)
cin >> flag[i];
for (int i = 0; i < 2; ++i)
cin >> emb[i];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
int mm[1005][1005][3];
string flag[1005], emb[2];
int main() {
int m, n;
cin >> m >> n;
int ans = 0;
for (int i = 0; i < m; ++i)
cin >> flag[i];
for (int i = 0; i < 2; ++i)
cin >> emb[i];
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
... | replace | 4 | 6 | 4 | 6 | 0 | |
p00522 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int m, n, p[10100], sum[10100], c[550], e[550];
int dp[10100];
int main() {
cin >> m >> n;
for (int i = 0; i < m; i++)
cin >> p[i];
sort(p, p + m);
for (int i = 0; i < m; i++)
sum[i + 1] = sum[i] + p[m - 1 - i];
for (int i = 0; i < n; i++)
cin >> c[... | #include <bits/stdc++.h>
using namespace std;
int m, n, p[10100], sum[10100], c[550], e[550];
int dp[10100];
int main() {
cin >> m >> n;
for (int i = 0; i < m; i++)
cin >> p[i];
sort(p, p + m);
for (int i = 0; i < m; i++)
sum[i + 1] = sum[i] + p[m - 1 - i];
for (int i = 0; i < n; i++)
cin >> c[... | replace | 20 | 21 | 20 | 21 | 0 | |
p00522 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define rep(x, y) for (int x = 0; x < (y); x++)
typedef long long ll;
int M, N;
int P[10005], C[512], E[512];
ll dp[10005][512];
ll dfs(int m, int n) {
if (m > M || n >= N)
return 0;
ll res ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define rep(x, y) for (int x = 0; x < (y); x++)
typedef long long ll;
int M, N;
int P[10005], C[512], E[512];
ll dp[10005][512];
ll dfs(int m, int n) {
if (m > M || n >= N)
return 0;
ll &res... | replace | 19 | 20 | 19 | 23 | TLE | |
p00522 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1e9;
int dp[100100];
int main... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1e9;
int dp[100100];
int main... | replace | 26 | 27 | 26 | 27 | 0 | |
p00522 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#de... | replace | 44 | 45 | 44 | 45 | 0 | |
p00522 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | replace | 43 | 44 | 43 | 44 | 0 | |
p00522 | C++ | Time Limit Exceeded | // AOJ 0599
#include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); ++i)
const int MAX_M = 10000, MAX_N = 500, INF = 1 << 29;
int M, N;
int P[MAX_M];
int C[MAX_N], E[MAX_N];
int dp[MAX_N + 1][MAX_M + 1];
int main() {
scanf("%d%d", &M, &N);
rep(i, ... | // AOJ 0599
#include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>
#define rep(i, a) for (int i = 0; i < (a); ++i)
const int MAX_M = 10000, MAX_N = 500, INF = 1 << 29;
int M, N;
int P[MAX_M];
int C[MAX_N], E[MAX_N];
int dp[MAX_N + 1][MAX_M + 1];
int main() {
scanf("%d%d", &M, &N);
rep(i, ... | replace | 23 | 25 | 23 | 29 | TLE | |
p00522 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
struct box {
int c, e;
};
int dp[10010];
int main() {
int m, n;
cin >> m >> n;
int p[n], sum[m + 1];
sum[0] = 0;
box b[n];
for (int i = 0; i < m; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
cin >> b[i].c >> b[i].e;
sort(p, p + m... | #include <algorithm>
#include <iostream>
using namespace std;
struct box {
int c, e;
};
int dp[10010];
int main() {
int m, n;
cin >> m >> n;
int p[m], sum[m + 1];
sum[0] = 0;
box b[n];
for (int i = 0; i < m; i++)
cin >> p[i];
for (int i = 0; i < n; i++)
cin >> b[i].c >> b[i].e;
sort(p, p + m... | replace | 10 | 11 | 10 | 11 | 0 | |
p00522 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
#define INF (1 << 29)
using namespace std;
int main() {
int N, M;
scanf("%d", &N);
scanf("%d", &M);
vector<int> P(N);
vector<int> C(M);
vector<int> E(M);
for (int i = 0; i < N; i++) {
scanf("%d", &P[i]);
}
for ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
#define INF (1 << 29)
using namespace std;
int main() {
int N, M;
scanf("%d", &N);
scanf("%d", &M);
vector<int> P(N);
vector<int> C(M);
vector<int> E(M);
for (int i = 0; i < N; i++) {
scanf("%d", &P[i]);
}
for ... | replace | 33 | 38 | 33 | 34 | TLE | |
p00522 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int x[1000][50000], n, m, a, b, c, s[100000], t[1000][2], sum, MAX;
int main() {
memset(x, 127, sizeof(x));
x[0][0] = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
for (int i = 1; i <= m; i... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int x[1000][50000], n, m, a, b, c, s[100000], t[1000][2], sum, MAX;
int main() {
memset(x, 127, sizeof(x));
x[0][0] = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
sum += s[i];
}
for (int i = 1; i <= m; i... | insert | 21 | 21 | 21 | 23 | TLE | |
p00522 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main() {
int M, N, P[10000], C[100], E[100];
cin >> M >> N;
for (int i = 0; i < M; i++) {
cin >> P[i];
}
sort(P, P + M, greater<int>());
for (int i = 0; i < N; i++) {
cin >> C[i] >> E[i];
}
int dp[50001]; // dp[i]:饅頭をi... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main() {
int M, N, P[10000], C[500], E[500];
cin >> M >> N;
for (int i = 0; i < M; i++) {
cin >> P[i];
}
sort(P, P + M, greater<int>());
for (int i = 0; i < N; i++) {
cin >> C[i] >> E[i];
}
int dp[50001]; // dp[i]:饅頭をi... | replace | 5 | 6 | 5 | 6 | 0 | |
p00522 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF (1 << 29)
int manju[10000], c[10000], e[10000];
int m, n;
int sum[10000], dp[501][10001];
int main()... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define INF (1 << 29)
int manju[10000], c[10000], e[10000];
int m, n;
int sum[10001], dp[501][10001];
int main()... | replace | 14 | 15 | 14 | 15 | 0 | |
p00523 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using nam... | replace | 93 | 94 | 93 | 94 | 0 | |
p00523 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#define INF (1e+15)
using namespace std;
typedef long long ll;
int main() {
int n, a[100001];
ll ssum[100001 * 2] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ssum[0] = a[0];
for (int i = 1; i < n * 2; i++)
ssum[i] = ssum[i - 1] + a[i % n];
... | #include <algorithm>
#include <iostream>
#define INF (1e+15)
using namespace std;
typedef long long ll;
int main() {
int n, a[100001];
ll ssum[100001 * 2] = {0};
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
ssum[0] = a[0];
for (int i = 1; i < n * 2; i++)
ssum[i] = ssum[i - 1] + a[i % n];
... | replace | 23 | 24 | 23 | 24 | TLE | |
p00523 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
struct Piece {
int top;
int end;
ll size;
};
class Baumkuchen {
private:
int N;
const int DevideNum;
ll *A;
ll *sum;
Piece *piece;
void input();
void newArrays(int n);
void setSum();
bool isContainPiece(int ... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
struct Piece {
int top;
int end;
ll size;
};
class Baumkuchen {
private:
int N;
const int DevideNum;
ll *A;
ll *sum;
Piece *piece;
void input();
void newArrays(int n);
void setSum();
bool isContainPiece(int ... | replace | 58 | 59 | 58 | 59 | 1 | |
p00523 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define Ford(i, a, b) for (int i = (a); i >= (b); i--)
const int maxn = 100000 + 1912;
int n, a[maxn];
long long totalSum = 0;
long long sum[maxn];
void ReadData() {
... | #include <bits/stdc++.h>
using namespace std;
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define Ford(i, a, b) for (int i = (a); i >= (b); i--)
const int maxn = 200000 + 1912;
int n, a[maxn];
long long totalSum = 0;
long long sum[maxn];
void ReadData() {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p00523 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits>
#ifndef LLONG_MAX
#define LLONG_MAX 9223372036854775807
#endif
using namespace std;
typedef long long llong;
int N;
llong *v_list;
double tripartition;
llong BaumukuchenGetAnswer();
llong searchOne(int n0);
llong getMinV(int n0, int n1, int n2);
int findInd... | #include <algorithm>
#include <iostream>
#include <limits>
#ifndef LLONG_MAX
#define LLONG_MAX 9223372036854775807
#endif
using namespace std;
typedef long long llong;
int N;
llong *v_list;
double tripartition;
llong BaumukuchenGetAnswer();
llong searchOne(int n0);
llong getMinV(int n0, int n1, int n2);
int findInd... | replace | 82 | 83 | 82 | 83 | TLE | |
p00523 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cstdio>
using namespace std;
int a[111111 * 2];
long long sum[111111 * 2];
long long res = 0;
int n;
long long C(int s, int e) {
long long lim = sum[e] - sum[s];
// printf("[%d,%d) [%d,%d)\n",s,e,e,s+n);
s += n;
int l = e, r = s;
while (e < s) {
int m =... | #include <algorithm>
#include <cassert>
#include <cstdio>
using namespace std;
int a[111111 * 3];
long long sum[111111 * 3];
long long res = 0;
int n;
long long C(int s, int e) {
long long lim = sum[e] - sum[s];
// printf("[%d,%d) [%d,%d)\n",s,e,e,s+n);
s += n;
int l = e, r = s;
while (e < s) {
int m =... | replace | 6 | 8 | 6 | 8 | 0 | |
p00523 | C++ | Runtime Error | // 初めての尺取り
#include <iostream>
#include <stdio.h>
using namespace std;
#define GOMAE (long long)50000
#define EPS (long long)4000
#define TO_OUTSIDE (long long)1500
#define IS_NOT_EVEN_HOBBY (long long)114
int N;
long long input;
long long A[200010];
long long ans;
// A[i]-A[st] >= A[ed]-A[i]となる最小のiを返す。
int seach1(i... | // 初めての尺取り
#include <iostream>
#include <stdio.h>
using namespace std;
#define GOMAE (long long)50000
#define EPS (long long)4000
#define TO_OUTSIDE (long long)1500
#define IS_NOT_EVEN_HOBBY (long long)114
int N;
long long input;
long long A[300010];
long long ans;
// A[i]-A[st] >= A[ed]-A[i]となる最小のiを返す。
int seach1(i... | replace | 12 | 13 | 12 | 13 | 0 | |
p00523 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... | replace | 73 | 74 | 73 | 74 | 0 | sh: 1: pause: not found
|
p00523 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <string.h>
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
int A[200004];
long long int B[100002];
int main() {
// FILE *fp;
// fp=fopen("F:\\1JOI本選\\2014\\joi2014-ho-data\\joi2014-ho-data\\2014-ho-t3\\in\\03-06.txt... | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <string.h>
const int INF = 1001001001;
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
int A[200004];
long long int B[100002];
int main() {
// FILE *fp;
// fp=fopen("F:\\1JOI本選\\2014\\joi2014-ho-data\\joi2014-ho-data\\2014-ho-t3\\in\\03-06.txt... | replace | 68 | 69 | 68 | 69 | 1 | |
p00524 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, pii> P;
const ll INF = 100000000000007;
int n, m, x;
int h[100000];
ll d[100000];
vector<pii> G[100000];
priority_queue<P, vector<P>, greater<P>> q;
int m... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, pii> P;
const ll INF = 100000000000007;
int n, m, x;
int h[100000];
ll d[100000];
vector<pii> G[100000];
priority_queue<P, vector<P>, greater<P>> q;
int m... | replace | 55 | 56 | 55 | 56 | MLE | |
p00524 | C++ | Runtime Error | #include <bitset>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, long long int> pi;
typedef pair<long long int, pi> plpi;
#define F first
#define S second
#define PB push_back
const int N = 1e5 + 10;
const long long int INF = 1LL << 60;
int main() {
int... | #include <bitset>
#include <queue>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, long long int> pi;
typedef pair<long long int, pi> plpi;
#define F first
#define S second
#define PB push_back
const int N = 1e5 + 10;
const long long int INF = 1LL << 60;
int main() {
int... | insert | 53 | 53 | 53 | 54 | 0 | |
p00524 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1001001001001001001LL;
typedef pair<int, int> P;
struct edge {
int to, cost;
edge(int a, int b) : to(a), cost(b) {}
};
int N, M, X;
int H[100000];
vector<edge> G[100000];
int dist[100000];
signed main() {
cin >> N >> M >> X;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1001001001001001001LL;
typedef pair<int, int> P;
struct edge {
int to, cost;
edge(int a, int b) : to(a), cost(b) {}
};
int N, M, X;
int H[100000];
vector<edge> G[100000];
int dist[100000];
signed main() {
cin >> N >> M >> X;
... | replace | 31 | 32 | 31 | 32 | TLE | |
p00524 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define N 100000
#define M 300000
#define HT 1000000000
#define INF 2e18
#define int long long
#define MP(i, j) make_pair((i), (j))
typedef pair<int, int> P;
int n, m, x, ans = INF, tree[... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define N 100000
#define M 300000
#define HT 1000000000
#define INF 2e18
#define int long long
#define MP(i, j) make_pair((i), (j))
typedef pair<int, int> P;
int n, m, x, ans = INF, tree[... | replace | 47 | 48 | 47 | 48 | 0 | |
p00524 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | replace | 96 | 97 | 96 | 97 | 0 | |
p00524 | C++ | Time Limit Exceeded | //??????????§????(??????or???????????????????????£?????????)???????????¨,
//????¨??????????t??§??¨?????°???????????¨???, t<X??????X-t[m],
//t>=X??????0[m]?????????????????????
//??????????????????????????????????????£???, (??????,
//????????§?????????)????????§??????????§????????±??????????
//??????????????????????????... | //??????????§????(??????or???????????????????????£?????????)???????????¨,
//????¨??????????t??§??¨?????°???????????¨???, t<X??????X-t[m],
//t>=X??????0[m]?????????????????????
//??????????????????????????????????????£???, (??????,
//????????§?????????)????????§??????????§????????±??????????
//??????????????????????????... | replace | 41 | 42 | 41 | 42 | TLE | |
p00525 | C++ | Runtime Error | #pragma comment(linker, "/STACK:36777216")
// #pragma GCC optimize ("O2")
#define LOCAL
// #include "testlib.h"
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
// #include <tr1/unordered_set>
// #include <tr1/unordered_map>
// #include <array>
using namespace std;
#define ... | #pragma comment(linker, "/STACK:36777216")
// #pragma GCC optimize ("O2")
#define LOCAL
// #include "testlib.h"
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
// #include <tr1/unordered_set>
// #include <tr1/unordered_map>
// #include <array>
using namespace std;
#define ... | replace | 502 | 503 | 502 | 503 | 0 | |
p00527 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | replace | 25 | 26 | 25 | 26 | 0 | |
p00527 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
int dp[2001][2001][2];
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
int dp[2001][2001][2];
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest... | replace | 44 | 46 | 44 | 45 | 0 | |
p00527 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
char s[2][2001];
int dp[2001][2001][2], n[2];
int main() {
scanf("%d%d%s%s", &n[0], &n[1], s[0], s[1]);
int Max = 0;
for (int i = n[0]; i >= 0; i--)
for (int j = n[1]; j >= 0; j--)
rep(t, 2) rep(k, 2) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
char s[2][2001];
int dp[2002][2002][2], n[2];
int main() {
scanf("%d%d%s%s", &n[0], &n[1], s[0], s[1]);
int Max = 0;
for (int i = n[0]; i >= 0; i--)
for (int j = n[1]; j >= 0; j--)
rep(t, 2) rep(k, 2) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00527 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, m, n, ans = 0, l;
static int r[52][52][2] = {0};
char s[4001], t[4001];
scanf("%d%d", &m, &n);
scanf("%s", s);
scanf("%s", t);
for (i = 0; i <= m; i++) {
for (j = 0; j <= n; j++)... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int i, j, m, n, ans = 0, l;
static int r[2001][2001][2] = {0};
char s[4001], t[4001];
scanf("%d%d", &m, &n);
scanf("%s", s);
scanf("%s", t);
for (i = 0; i <= m; i++) {
for (j = 0; j <= n; ... | replace | 7 | 8 | 7 | 8 | 0 | |
p00527 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int dp[2000][2000][2]; // a???n??????b???m????????§?????????(1,0)=(I,O)
int a, b;
string c, d;
int main() {
cin >> a >> b >> c >> d;
c += " ";
d += " ";
for (... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int dp[2005][2005][2]; // a???n??????b???m????????§?????????(1,0)=(I,O)
int a, b;
string c, d;
int main() {
cin >> a >> b >> c >> d;
c += " ";
d += " ";
for (... | replace | 9 | 10 | 9 | 10 | 0 | |
p00527 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
//--------------------------------------... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
//--------------------------------------... | replace | 74 | 75 | 74 | 75 | 0 | |
p00527 | C++ | Runtime Error |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
... | replace | 64 | 65 | 64 | 65 | -11 | |
p00527 | C++ | Runtime Error | #include <iostream>
#include <string>
#define max(a, b) a > b ? a : b
using namespace std;
int dp[1005][1005][2];
int main() {
int n, m;
int i, j, k;
int a, b;
string t[2];
string sa = "IO";
int s = 0;
cin >> n >> m;
for (i = 0; i < 2; i++) {
cin >> t[i];
}
for (i = 0; i <= n; i++) {
for (j ... | #include <iostream>
#include <string>
#define max(a, b) a > b ? a : b
using namespace std;
int dp[2005][2005][2];
int main() {
int n, m;
int i, j, k;
int a, b;
string t[2];
string sa = "IO";
int s = 0;
cin >> n >> m;
for (i = 0; i < 2; i++) {
cin >> t[i];
}
for (i = 0; i <= n; i++) {
for (j ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00527 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 2200
int dp[MAX_N][MAX_N][2];
string S, T;
int a, b, g, h, maxn;
int main() {
cin >> a >> b;
cin >> S >> T;
while (S.size() != MAX_N) {
S += ' ';
}
while (T.size() != MAX_N) {
T += ' ';
}
g = max(a, b)... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#define MAX_N 2200
int dp[MAX_N][MAX_N][2];
string S, T;
int a, b, g, h, maxn;
int main() {
cin >> a >> b;
cin >> S >> T;
while (S.size() != MAX_N) {
S += ' ';
}
while (T.size() != MAX_N) {
T += ' ';
}
g = max(a, b)... | replace | 21 | 22 | 21 | 22 | TLE | |
p00527 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int N, M;
char S[2001], T[2001];
int dp[2000][2000][2];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
dp[i][j][1] = -0x7ffffff;
dp[i][j][0] = 0;
}
}
sc... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int N, M;
char S[4001], T[4001];
int dp[4000][4000][2];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
dp[i][j][1] = -0x7ffffff;
dp[i][j][0] = 0;
}
}
sc... | replace | 6 | 8 | 6 | 8 | 0 | |
p00528 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define PB push_back
#define ALL(V) V.begin(), V.end()
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> ppiii;
constexpr int INF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MAX_K = 100005;
int d[MAX_K]... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define PB push_back
#define ALL(V) V.begin(), V.end()
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> ppiii;
constexpr int INF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MAX_K = 200005;
int d[MAX_K]... | replace | 13 | 14 | 13 | 14 | 0 | |
p00528 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define int long long
#define INF 1e+18
using namespace std;
typedef pair<int, int> P;
signed main() {
int m, n, k;
bool start = false;
int d[200002][2]; // 0:tate 1:yoko
vector<P> G[200002][2];
vector<P> tate[100000], yoko[100000];... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define int long long
#define INF 1e+18
using namespace std;
typedef pair<int, int> P;
signed main() {
int m, n, k;
bool start = false;
static int d[200002][2]; // 0:tate 1:yoko
static vector<P> G[200002][2];
static vector<P> tate[1... | replace | 13 | 16 | 13 | 16 | -11 | |
p00528 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
struct Point {
int x, y, id;
};
bool linkx(Point &p1, Point &p2) {
return p1.y == p2.y ? p1.x < p2.x : p1.y < p2.y;
}
bool linky(Point &p1, Point &p2) {
return p1.x == p2.x ? p1.y < p2.y : p1.x < p2.x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
struct Point {
int x, y, id;
};
bool linkx(Point &p1, Point &p2) {
return p1.y == p2.y ? p1.x < p2.x : p1.y < p2.y;
}
bool linky(Point &p1, Point &p2) {
return p1.x == p2.x ? p1.y < p2.y : p1.x < p2.x... | replace | 19 | 20 | 19 | 20 | 0 | |
p00529 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int n;
string s;
bool check(int x) {
int l, r;
static bool isUseI[1000001], isUseO[1000001];
int cntI = 0;
for (r = 0; r < n; r++) {
isUseI[r] = false;
isUseO[r] = false;
}
for (r = n - 1; r >= 0; r--) {
if (cntI... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int n;
string s;
bool check(int x) {
int l, r;
static bool isUseI[1000001], isUseO[1000001];
int cntI = 0;
for (r = 0; r < n; r++) {
isUseI[r] = false;
isUseO[r] = false;
}
for (r = n - 1; r >= 0; r--) {
if (cntI... | replace | 69 | 71 | 69 | 70 | 0 | |
p00529 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
string S;
vector<P> OI;
bool check(int h) {
// cout << "h " << h << endl;
int tk = S.size() - 1;
for (int i = 0; i < h; i++) {
tk = min(tk, OI[i].second);
}
int res = 0;
int H = h;
h--;
for (int i = 0; i < (int)S.size() && h > -... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
string S;
vector<P> OI;
bool check(int h) {
// cout << "h " << h << endl;
int tk = S.size() - 1;
if (OI.size() < h)
return false;
for (int i = 0; i < h; i++) {
tk = min(tk, OI[i].second);
}
int res = 0;
int H = h;
h--;
for... | insert | 8 | 8 | 8 | 10 | 0 | |
p00530 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
using namespace std;
int b[110000];
int z[110000];
long long bit[110000];
long long sum(int a, int b) {
if (a)
return sum(0, b) - sum(0, a - 1);
long long ret = 0;
for (; b >= 0; b = (b & (b + 1)) - 1)
ret += bit[b];
return ret;
}
void add(int a, int b) {
for (;... | #include <algorithm>
#include <stdio.h>
using namespace std;
int b[110000];
int z[110000];
long long bit[110000];
long long sum(int a, int b) {
if (a)
return sum(0, b) - sum(0, a - 1);
long long ret = 0;
for (; b >= 0; b = (b & (b + 1)) - 1)
ret += bit[b];
return ret;
}
void add(int a, int b) {
for (;... | replace | 138 | 139 | 138 | 139 | TLE | |
p00531 | C++ | Runtime Error | #include <stdio.h>
int main() {
int a, b, c, d, p, x, y;
scanf("%d %d %d %d %d", a, b, c, d, p);
x = a * p;
if (p <= c) {
y = b;
} else {
y = (p - c) * d + b;
}
if (x <= y) {
printf("%d\n", x);
} else {
printf("%d\n", y);
}
return 0;
} | #include <stdio.h>
int main() {
int a, b, c, d, p, x, y;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &p);
x = a * p;
if (p <= c) {
y = b;
} else {
y = (p - c) * d + b;
}
if (x <= y) {
printf("%d\n", x);
} else {
printf("%d\n", y);
}
return 0;
} | replace | 3 | 4 | 3 | 4 | -11 | |
p00532 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | replace | 52 | 53 | 52 | 53 | 0 | |
p00532 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
int main() {
int n, m;
cin >> n >> m;
vi player(n);
rep(i, m... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
int main() {
int n, m;
cin >> n >> m;
vi player(m);
rep(i, m... | replace | 13 | 14 | 13 | 14 | 0 | |
p00532 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int a, s, d[10001][10001], g[10001], h[10001], i, j;
scanf("%d", &a);
scanf("%d", &s);
for (i = 1; i <= s; i++) {
scanf("%d", &g[i]);
}
for (i = 1; i <= s; i++) {
for (j = 1; j <= a; j++) {
scanf("%d", &d[i][j]);
}
}
for (i = 1; i <= s; i++) {
fo... | #include <stdio.h>
int main(void) {
int a, s, d[1001][1001], g[1001], h[1001], i, j;
scanf("%d", &a);
scanf("%d", &s);
for (i = 1; i <= s; i++) {
scanf("%d", &g[i]);
}
for (i = 1; i <= s; i++) {
for (j = 1; j <= a; j++) {
scanf("%d", &d[i][j]);
}
}
for (i = 1; i <= s; i++) {
for (j... | replace | 2 | 3 | 2 | 3 | -11 | |
p00534 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 3000
#define MAX_M 3000
int main() {
int dp[MAX_N + 1][MAX_M + 1];
int n, m, s, x[MAX_N], y[MAX_M];
memset(dp, 127, sizeof(dp));
memset(x, 127, sizeof(x));
memset(y, 127, sizeof(y));
cin >> m >> n;
for (int i ... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 1100
#define MAX_M 1100
int main() {
int dp[MAX_N + 1][MAX_M + 1];
int n, m, s, x[MAX_N], y[MAX_M];
memset(dp, 127, sizeof(dp));
memset(x, 127, sizeof(x));
memset(y, 127, sizeof(y));
cin >> m >> n;
for (int i ... | replace | 5 | 7 | 5 | 7 | -11 | |
p00534 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <stdio.h>
#define MM 2100000000
using namespace std;
long long int dp[1001][1001];
int main(void) {
int n, m, a[1001], b[1001], i, k;
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= m; i++)
scanf("%d", &b[i]);
a... | #include <algorithm>
#include <functional>
#include <stdio.h>
#define MM 2100000000
using namespace std;
long long int dp[1001][1001];
int main(void) {
int n, m, a[1001], b[1001], i, k;
scanf("%d %d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (i = 1; i <= m; i++)
scanf("%d", &b[i]);
a... | replace | 22 | 23 | 22 | 23 | 0 | |
p00534 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, M;
int h[100][100] = {0}, l[1500] = {0}, t[1500] = {0};
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> l[i];
}
for (int j = 0; j < M; j++) {
cin >> t[j];
}
for (int j = 0; j < N; j++) {
for (int i = j; i < j + M - N + 1; i++) ... | #include <iostream>
using namespace std;
int main() {
int N, M;
int h[1500][1500] = {0}, l[1500] = {0}, t[1500] = {0};
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> l[i];
}
for (int j = 0; j < M; j++) {
cin >> t[j];
}
for (int j = 0; j < N; j++) {
for (int i = j; i < j + M - N + 1; i++... | replace | 4 | 5 | 4 | 5 | 0 | |
p00534 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int n, m, an = 1e9;
int d[1002];
int c[1002];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = 0; i < m; i++)
cin >> c[i];
vector<vector<int>> vec(m + 2, vector<int>(n + 1e9));
vec[0][0] = 0;
for (int i = 0;... | #include <iostream>
#include <vector>
using namespace std;
int n, m, an = 1e9;
int d[1002];
int c[1002];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i];
for (int i = 0; i < m; i++)
cin >> c[i];
vector<vector<int>> vec(m + 2, vector<int>(n + 2, 1e9));
vec[0][0] = 0;
for (int i =... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p00534 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 1001 * 1001 * 1001
int dp[1001][1001];
int main(void) {
int N, M;
int C[1001], D[1001];
int i, j;
cin >> N >> M;
for (i = 1; i <= N; i++) {
cin >> D[i];
}
for (i = 1; i <= M; i++) {
cin >> C[i];
}
for (i = 1; i <= M; i++) {
for (j =... | #include <bits/stdc++.h>
using namespace std;
#define MAX 1001 * 1001 * 1001
int dp[1001][1001];
int main(void) {
int N, M;
int C[1001], D[1001];
int i, j;
cin >> N >> M;
for (i = 1; i <= N; i++) {
cin >> D[i];
}
for (i = 1; i <= M; i++) {
cin >> C[i];
}
for (i = 1; i <= M; i++) {
for (j =... | replace | 23 | 24 | 23 | 24 | 0 | |
p00535 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
double EPS = ... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
double EPS = ... | replace | 12 | 15 | 12 | 15 | 0 | |
p00535 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> PA;
typedef pair<PA, int> PPA;
int main() {
int h, w;
char masu[50][50];
int suji[50][50] = {};
queue<PPA> que;
PA p;
int sum = 0;
cin >> h >> w;
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
cin >> ma... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> PA;
typedef pair<PA, int> PPA;
int main() {
int h, w;
char masu[1001][1001];
int suji[1001][1001] = {};
queue<PPA> que;
PA p;
int sum = 0;
cin >> h >> w;
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++) {
c... | replace | 7 | 9 | 7 | 9 | 0 | |
p00535 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
char c[1000][1000];
bool flag[1000][1000];
int w, h, ans;
int cdt[1000][1000];
queue<PP> que, que2;
void fanc(PP p) {
... | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#define F first
#define S second
#define MP make_pair
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> PP;
char c[1000][1000];
bool flag[1000][1000];
int w, h, ans;
int cdt[1000][1000];
queue<PP> que, que2;
void fanc(PP p) {
... | replace | 21 | 22 | 21 | 22 | 0 | |
p00535 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
in... |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long int ll;
in... | delete | 53 | 54 | 53 | 53 | TLE | |
p00535 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR... | replace | 52 | 53 | 52 | 53 | MLE | |
p00535 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define rep(a, b, c) for (int a = b; a < c; a++)
#define repm(a, b, c) for (int a = (b - 1); a >= c; a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d", &a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v)... | #include <bits/stdc++.h>
#define int long long int
#define rep(a, b, c) for (int a = b; a < c; a++)
#define repm(a, b, c) for (int a = (b - 1); a >= c; a--)
#define pb push_back
#define str string
#define sf(a) scanfs("%d", &a)
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v)... | replace | 45 | 46 | 45 | 46 | 0 | |
p00536 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MP make_pair
#define PB push_back
#define FI first
#define SE second
typedef tuple<int, int> T1;
static const int INF = 1ll << 60;
static const int dx[] = {
1,
-1,
0,
0,
};
static const int dy[] = {0, 0, 1, -1};
int N, D;
int... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MP make_pair
#define PB push_back
#define FI first
#define SE second
typedef tuple<int, int> T1;
static const int INF = 1ll << 60;
static const int dx[] = {
1,
-1,
0,
0,
};
static const int dy[] = {0, 0, 1, -1};
int N, D;
int... | replace | 21 | 22 | 21 | 22 | -11 | |
p00536 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF (1LL << 60)
typedef pair<long long, long long> P;
int N;
long long D;
long long X[30], Y[30];
int n2;
long long seg[1 << 24];
vector<P> M1, M2;
void dfs(int i, int until, vector<P> &p, long long a, long long b) {
if (i >= u... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF (1LL << 60)
typedef pair<long long, long long> P;
int N;
long long D;
long long X[30], Y[30];
int n2;
long long seg[1 << 25];
vector<P> M1, M2;
void dfs(int i, int until, vector<P> &p, long long a, long long b) {
if (i >= u... | replace | 12 | 13 | 12 | 13 | -11 | |
p00536 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <set>
#include <utility>
#include <vector>
using namespace std;
vector<pair<long long, long long>> p[2];
long long x[31], y[31];
void dfs(int z, int dep, int dep_for, long long cur_x, long long cur_y) {
if (dep == dep_for) {
p[z].push_back({cur_x + x[dep], cur_y ... | #include <algorithm>
#include <cstdio>
#include <set>
#include <utility>
#include <vector>
using namespace std;
vector<pair<long long, long long>> p[2];
long long x[31], y[31];
void dfs(int z, int dep, int dep_for, long long cur_x, long long cur_y) {
if (dep == dep_for) {
p[z].push_back({cur_x + x[dep], cur_y ... | insert | 29 | 29 | 29 | 33 | TLE | |
p00536 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PB push_back
#define FI first
#define SE second
#define MP make_pair
#define int long long
using namespace std;
static const int inf = 1ll << 60;
static const int MAX_N = 1 << 20;
typedef pair<int, int> P;
int N, D;
int X[40], Y[40];
int ans = 0;
int dat[MAX_N * 4];
class Segment {
pu... | #include <bits/stdc++.h>
#define PB push_back
#define FI first
#define SE second
#define MP make_pair
#define int long long
using namespace std;
static const int inf = 1ll << 60;
static const int MAX_N = 16777216;
typedef pair<int, int> P;
int N, D;
int X[40], Y[40];
int ans = 0;
int dat[MAX_N * 4];
class Segment {
p... | replace | 8 | 9 | 8 | 9 | 0 | |
p00536 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i =... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 1e9
#define REP(i, n) for (int i =... | replace | 111 | 116 | 111 | 114 | TLE | |
p00537 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " -> " << x << "\n"
static const int INF = 1e9 + 7;
static const double EPS = 1e-10;
static const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
static const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
template <class T> ostream &operator<<(ostream &... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " -> " << x << "\n"
static const int INF = 1e9 + 7;
static const double EPS = 1e-10;
static const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
static const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
template <class T> ostream &operator<<(ostream &... | delete | 42 | 43 | 42 | 42 | 0 | moved -> 1 3 1 -1
|
p00538 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
int A[6000];
int memo[6000][6000];
int dfs(int l, int r) {
if (~memo[l][r])
return memo[l][r];
int ret;
int cnt = r - l - 1;
if (cnt == N)
ret = 0;
else if (cnt & 1) {
if (A[l] > A[r])
ret = dfs(l - 1, r);
el... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N;
int A[6000];
int memo[4000][6000];
int dfs(int l, int r) {
if (~memo[l][r])
return memo[l][r];
int ret;
int cnt = r - l - 1;
if (cnt == N)
ret = 0;
else if (cnt & 1) {
if (A[l] > A[r])
ret = dfs(l - 1, r);
el... | replace | 8 | 9 | 8 | 9 | MLE | |
p00538 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[4010];
ll dp[4010][4010];
ll f(int l, int r) {
ll &d = dp[l][r];
if (d != -1)
return d;
int len = r - l + 1;
if (len == 1)
return d = A[l];
if (len == 2)
return d = max(A[l], A[l + 1]);
d = 0;
int nl = l + 1, nr = r;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[4010];
ll dp[4010][4010];
ll f(int l, int r) {
ll &d = dp[l][r];
if (d != -1)
return d;
int len = r - l + 1;
if (len <= 0)
return d = 0;
if (len == 1)
return d = A[l];
if (len == 2)
return d = max(A[l], A[l + 1]);
d... | insert | 12 | 12 | 12 | 14 | -11 | |
p00538 | C++ | Runtime Error | #include <iostream>
#define int long long
using namespace std;
signed main() {
int n, a[2000];
int dp[2000][2000] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (n % 2)
dp[i][i] = a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((n - i) % 2)
... | #include <iostream>
#define int long long
using namespace std;
signed main() {
int n, a[2000];
static int dp[2000][2000] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (n % 2)
dp[i][i] = a[i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
if ((n - i) %... | replace | 6 | 7 | 6 | 7 | -11 | |
p00538 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int n;
vector<int> a;
ll dp[2003][2003][2];
ll solve(int left, int right, int player) {
if (left == right)
return player * a[left];
ll maxi = -1;
if ((!player && a[left] > a[right]) || pla... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int n;
vector<int> a;
ll dp[2003][2003][2];
ll solve(int left, int right, int player) {
if (left == right)
return player * a[left];
if (dp[left][right][player] != -1)
return dp[left][righ... | insert | 12 | 12 | 12 | 14 | TLE | |
p00538 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | replace | 16 | 17 | 16 | 17 | -11 | |
p00538 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long int DP[2000][2000];
long long int A[2000];
long long int INF = 100000000000000LL;
int main() {
int N;
cin >> N;
for (int i = 0; i < 2100; i++) {
for (int j = 0; j ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
long long int DP[2000][2000];
long long int A[2000];
long long int INF = 100000000000000LL;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N... | replace | 18 | 20 | 18 | 20 | -11 | |
p00538 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
#define MK make_pair
#define ALL(V) V.begin(), V.end()
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<string, int> psi;
typedef pair<int, pii> pipii;
constexpr int INF = 1LL << 61... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
#define MK make_pair
#define ALL(V) V.begin(), V.end()
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<string, int> psi;
typedef pair<int, pii> pipii;
constexpr int INF = 1LL << 61... | delete | 21 | 22 | 21 | 21 | 0 | 4 1
3 2
2 1
0 2
4 3
3 2
1 3
1 0
0 4
2 4
2 1
1 0
3 0
|
p00538 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#def... | replace | 28 | 29 | 28 | 29 | MLE | |
p00538 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
#define JOI 1
#define IOI 0
int n;
vector<int> a;
ll dp[2003][2003]... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
#define JOI 1
#define IOI 0
int n;
vector<int> a;
ll dp[2003][2003]... | replace | 24 | 25 | 24 | 26 | TLE | |
p00538 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 1e18
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ... | replace | 43 | 44 | 43 | 44 | -11 | |
p00539 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long int LL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP;
const LL INF = 3e18;
LL n,... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long int LL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP;
const LL INF = 3e18;
LL n,... | replace | 21 | 22 | 21 | 22 | 0 | |
p00539 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
const int INF = 1001001001001001;
int N, M, C; //?????´??? N ???????????? M
//??¬???????????°???????????´?????????????????¢... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
const int INF = 1001001001001001;
int N, M, C; //?????´??? N ???????????? M
//??¬???????????°???????????´?????????????????¢... | replace | 91 | 92 | 91 | 92 | -11 | |
p00539 | C++ | Runtime Error | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algor... | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algor... | replace | 21 | 22 | 21 | 22 | 0 | |
p00539 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int> // cost to
using namespace std;
map<int, int> S;
int mincost[100000];
vector<P> rinsetu[100000];
signed main() {
int sum = 0;
int a, b, c;
cin >> a >> b >> c;
for (int d = 0; d < b; d++) {
int e, f, g;
scanf("%lld%lld%lld", &e, &f,... | #include <bits/stdc++.h>
#define int long long
#define P pair<int, int> // cost to
using namespace std;
map<int, int> S;
int mincost[200000];
vector<P> rinsetu[200000];
signed main() {
int sum = 0;
int a, b, c;
cin >> a >> b >> c;
for (int d = 0; d < b; d++) {
int e, f, g;
scanf("%lld%lld%lld", &e, &f,... | replace | 6 | 8 | 6 | 8 | 0 | |
p00539 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 1010
#define INF LLONG_MAX / 4
typedef long long ll;
struct State {
ll v, cost;
State(ll v, ll cost) : v(v), cost(cost) {}
bool operator>(const State &s) const { return cost > s.cost; }
};
struct P {
ll idx, cost;
P(ll idx, ll cost) : idx(idx), c... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100010
#define INF LLONG_MAX / 4
typedef long long ll;
struct State {
ll v, cost;
State(ll v, ll cost) : v(v), cost(cost) {}
bool operator>(const State &s) const { return cost > s.cost; }
};
struct P {
ll idx, cost;
P(ll idx, ll cost) : idx(idx),... | replace | 4 | 5 | 4 | 5 | 0 | |
p00539 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 10005
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
ll N, M, C, a, b, c;
vector<edge> G[MAX];
ll d[MAX];
void dijkstra() {
for (int i = 0; i < MAX; i++)
d[i] = (1LL << 60);
d[1] = 0;
priority_queue<P, vector<P>, greater... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100005
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
ll N, M, C, a, b, c;
vector<edge> G[MAX];
ll d[MAX];
void dijkstra() {
for (int i = 0; i < MAX; i++)
d[i] = (1LL << 60);
d[1] = 0;
priority_queue<P, vector<P>, greate... | replace | 2 | 3 | 2 | 3 | 0 | |
p00540 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 100000
#define INF 100000000 // 10^8
#define LLINF 40000000000000000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 100000
#define INF 100000000 // 10^8
#define LLINF 40000000000000000... | replace | 18 | 19 | 18 | 19 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.