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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00449 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(c) (c).begin(), (c).end()
int N, K;
#define INF 11451419
#define MAX_V 1010
int cost[MAX_V][MAX_V];
int V;
int d[MAX_... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define all(c) (c).begin(), (c).end()
int N, K;
#define INF 11451419
#define MAX_V 1010
int cost[MAX_V][MAX_V];
int V;
int d[MAX_... | replace | 48 | 49 | 48 | 49 | 0 | |
p00449 | C++ | Time Limit Exceeded | #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;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | #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;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt"
int m... | insert | 15 | 15 | 15 | 17 | TLE | |
p00449 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | replace | 44 | 46 | 44 | 51 | TLE | |
p00449 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a | b) {
int c[100][100];
for (int x = 0; x < a; x++) {
for (int y = 0; y < a; y++) {
c[x][y] = 1 << 29;
}
}
for (int e = 0; e < b; e++)... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b, a | b) {
int c[100][100];
for (int x = 0; x < a; x++) {
for (int y = 0; y < a; y++) {
c[x][y] = 1 << 29;
}
}
for (int e = 0; e < b; e++)... | replace | 32 | 40 | 32 | 42 | TLE | |
p00449 | C++ | Time Limit Exceeded | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | insert | 97 | 97 | 97 | 99 | TLE | |
p00449 | C++ | Runtime Error | #include <queue>
#include <stdio.h>
using namespace std;
int main() {
const int INF = 10000000;
int n, k, map[100][100], a, b, c;
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
q;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
... | #include <queue>
#include <stdio.h>
using namespace std;
int main() {
const int INF = 10000000;
int n, k, map[100][100], a, b, c;
priority_queue<pair<int, int>, vector<pair<int, int>>,
greater<pair<int, int>>>
q;
while (true) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
... | replace | 41 | 42 | 41 | 42 | TLE | |
p00450 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i, n) ... | replace | 77 | 79 | 77 | 79 | 0 | |
p00450 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_b... | #include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define val first
#define num second
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<P> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0)
mp.push_b... | replace | 27 | 28 | 27 | 28 | 0 | |
p00450 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include... | delete | 108 | 112 | 108 | 108 | TLE | |
p00450 | C++ | Time Limit Exceeded | #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;
ll n;
vector<P> v; // first ???????????? second: 0or1
ll ... | #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;
ll n;
vector<P> v; // first ???????????? second: 0or1
ll ... | replace | 18 | 21 | 18 | 20 | TLE | |
p00450 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
scanf("%d", &n);
if (n == 0)
break;
priority_queue<int> q[2];
int s[2] = {0};
int prev = -1;
for (int i = 0; i < n; ++i) {
int c, d;
scanf("%... | #include <algorithm>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main() {
while (true) {
int n;
scanf("%d", &n);
if (n == 0)
break;
priority_queue<int> q[2];
int s[2] = {0};
int prev = -1;
for (int i = 0; i < n; ++i) {
int c, d;
scanf("%... | insert | 29 | 29 | 29 | 31 | 0 | |
p00450 | C++ | Runtime Error | #include <iostream>
using namespace std;
int st[100002] = {0};
int main() {
int j;
int n;
int cnt = 0;
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i += 2) {
cin >> st[i];
if (n - i != 1) {
cin >> st[i + 1];
if (st[i] != st[i + 1]) {
j = i;
while (st... | #include <iostream>
using namespace std;
int st[100002] = {0};
int main() {
int j;
int n;
int cnt = 0;
cin >> n;
while (n != 0) {
for (int i = 0; i < n; i += 2) {
cin >> st[i];
if (n - i != 1) {
cin >> st[i + 1];
if (st[i] != st[i + 1]) {
j = i;
while (st... | insert | 21 | 21 | 21 | 24 | 0 | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#define N 4000
using namespace std;
int n, m, dp[N][N], ans;
int main() {
string A, B;
while (cin >> A >> B) {
n = A.size();
m = B.size();
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
dp[i][j] = 0;
ans = 0;
for (... | #include <algorithm>
#include <iostream>
#include <string>
#define N 4001
using namespace std;
int n, m, dp[N][N], ans;
int main() {
string A, B;
while (cin >> A >> B) {
n = A.size();
m = B.size();
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
dp[i][j] = 0;
ans = 0;
for (... | replace | 3 | 4 | 3 | 4 | 0 | |
p00451 | C++ | Runtime Error | #include <iostream>
using namespace std;
string s, t;
int l[100][100];
int m;
void list(string s, string t) {
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < t.length(); j++) {
if (s[i] == t[j]) {
if (i == 0 || j == 0) {
l[i][j] = 1;
} else {
l[i][j] = l[i - ... | #include <iostream>
using namespace std;
string s, t;
int l[4000][4000];
int m;
void list(string s, string t) {
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < t.length(); j++) {
if (s[i] == t[j]) {
if (i == 0 || j == 0) {
l[i][j] = 1;
} else {
l[i][j] = l[i ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00451 | C++ | Runtime Error | // AOJ 0528
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int NMAX = 20000;
int n, k;
int Rank[NMAX + 1];
int tmp[NMAX + 1];
bool compare_sa(int i, int j) {
if (Rank[i] != Rank[j])
return Rank[i] < Rank[j];
else {
int ri = i + k <= n ? Rank[i + k] : -1;
int rj ... | // AOJ 0528
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int NMAX = 20000;
int n, k;
int Rank[NMAX + 1];
int tmp[NMAX + 1];
bool compare_sa(int i, int j) {
if (Rank[i] != Rank[j])
return Rank[i] < Rank[j];
else {
int ri = i + k <= n ? Rank[i + k] : -1;
int rj ... | replace | 67 | 68 | 67 | 68 | 0 | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class SuffixArray {
void CEB(vector<int> &v, vector<int> &b) {
int vs = v.size(), bs = b.size();
fill(b.begin(), b.end(), 0);
for (int i = 0; i < vs; i++)
b[v[i]]++;
for (int i = 1; i < bs; i++)
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class SuffixArray {
void CEB(vector<int> &v, vector<int> &b) {
int vs = v.size(), bs = b.size();
fill(b.begin(), b.end(), 0);
for (int i = 0; i < vs; i++)
b[v[i]]++;
for (int i = 1; i < bs; i++)
... | replace | 98 | 99 | 98 | 99 | -11 | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 4000;
int dp[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
while (1) {
cin >> s;
if (cin.eof() || s == "0") {
break;
}
cin >> t;
for (size_t i = 0; i < s.size();... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 4001;
int dp[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
while (1) {
cin >> s;
if (cin.eof() || s == "0") {
break;
}
cin >> t;
for (size_t i = 0; i < s.size();... | replace | 4 | 5 | 4 | 5 | 0 | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[4005][4005];
int main() {
string s;
while (cin >> s) {
string sa;
cin >> sa;
for (int i = 0; i < 4003; i++)
for (int j = 0; j < 4003; j++)
dp[i][j] = 0;
s.push_back('@');
int ans = 0;
for (... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[4005][4005];
int main() {
string s;
while (cin >> s) {
string sa;
cin >> sa;
for (int i = 0; i < 4003; i++)
for (int j = 0; j < 4003; j++)
dp[i][j] = 0;
s.push_back('@');
int ans = 0;
for (... | replace | 20 | 26 | 20 | 27 | 0 | |
p00451 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
while (cin >> s >> t) {
int ans = 0;
vector<vector<int>> dp(s.size() + 1, vector<int>(t.size() + 1, 0));
for (unsigned int i = 0; i < s.size(); ++i) {
for (unsigned int j = ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
while (cin >> s >> t) {
short int ans = 0;
vector<vector<short int>> dp(s.size() + 1,
vector<short int>(t.size() + 1, 0));
for (unsigned int i = 0... | replace | 9 | 11 | 9 | 12 | MLE | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int dp[4001][4001];
int main() {
string s;
string t;
int mx;
while (getline(cin, s)) {
fill(dp[0], dp[4000] + 4000, 0);
getline(cin, t);
int n = s.size(), m = t.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[4002][4002];
int main() {
string s;
string t;
int mx;
while (getline(cin, s)) {
fill(dp[0], dp[4000] + 4000, 0);
getline(cin, t);
int n = s.size(), m = t.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++... | replace | 4 | 5 | 4 | 5 | 0 | |
p00451 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
short dp[4000][4000];
int main() {
for (;;) {
string s, t;
if (!(cin >> s >> t)) {
break;
}
for (int i = 0; i <= s.size(); i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= t.size(); j++) {
dp[0][j] = 0;
}
fo... | #include <iostream>
#include <string>
using namespace std;
short dp[4001][4001];
int main() {
for (;;) {
string s, t;
if (!(cin >> s >> t)) {
break;
}
for (int i = 0; i <= s.size(); i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= t.size(); j++) {
dp[0][j] = 0;
}
fo... | replace | 5 | 6 | 5 | 6 | 0 | |
p00451 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | insert | 44 | 44 | 44 | 46 | TLE | |
p00451 | C++ | Memory Limit Exceeded | #include <stdio.h>
#include <string.h>
#define max(i, j) (i < j ? j : i)
int dp[4001][4001];
int main(void) {
char s[4001], t[4001];
// printf("%d\n",4000*4000);
while (scanf("%s", s) != EOF) {
scanf("%s", t);
// dp[0][0]=s[0]==t[0];
for (int i = 0; i < 4001; i++)
dp[i][0] = dp[0][i] = 0;
i... | #include <stdio.h>
#include <string.h>
#define max(i, j) (i < j ? j : i)
short dp[4001][4001];
int main(void) {
char s[4001], t[4001];
// printf("%d\n",4000*4000);
while (scanf("%s", s) != EOF) {
scanf("%s", t);
// dp[0][0]=s[0]==t[0];
for (int i = 0; i < 4001; i++)
dp[i][0] = dp[0][i] = 0;
... | replace | 3 | 4 | 3 | 4 | MLE | |
p00451 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#incl... | replace | 88 | 89 | 88 | 93 | 0 | |
p00451 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b;
while (cin >> a >> b) {
int n = 0;
int la = a.size();
int lb = b.size();
for (int i = 0; i < la; i++) {
for (int j = 0; j < lb; j++) {
int k = 0, m = 0;
do {
if (... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b;
while (cin >> a >> b) {
int n = 0;
int la = a.size();
int lb = b.size();
for (int i = 1 - la; i < lb; i++) {
int k = 0;
for (int j = 0; j < la; j++) {
if (j + i < 0 || j + i ... | replace | 10 | 25 | 10 | 21 | TLE | |
p00451 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int DP[4096][4096];
int main() {
string s, t;
while (cin >> s >> t) {
memset(DP, 0, sizeof(DP));
int n = s.size(), m = t.size(), ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int DP[4001][4001];
int main() {
string s, t;
while (cin >> s >> t) {
memset(DP, 0, sizeof(DP));
int n = s.size(), m = t.size(), ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {... | replace | 6 | 7 | 6 | 8 | MLE | |
p00451 | 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
#define MAX_S 4000
#define MAX_T 4000
template <typename T> int long... | #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 MAX_S 4000
#define MAX_T 4000
template <typename T> int long... | replace | 14 | 15 | 14 | 17 | -11 | |
p00451 | C++ | Memory Limit Exceeded | #include <stdio.h>
#include <string.h>
char a[4001];
char b[4001];
int dp[4001][4001];
int max(int a, int b) { return a > b ? a : b; }
int main() {
while (scanf(" %s", a) != EOF) {
scanf(" %s", b);
int n = strlen(a);
int m = strlen(b);
int i, j;
for (i = 0; i <= n; i++)
for (j = 0; j <= m; j... | #include <stdio.h>
#include <string.h>
char a[4001];
char b[4001];
short dp[4001][4001];
int max(int a, int b) { return a > b ? a : b; }
int main() {
while (scanf(" %s", a) != EOF) {
scanf(" %s", b);
int n = strlen(a);
int m = strlen(b);
int i, j;
for (i = 0; i <= n; i++)
for (j = 0; j <= m;... | replace | 4 | 5 | 4 | 5 | MLE | |
p00451 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
string s[2];
int search(int id) {
int id2 = (id + 1) % 2;
int ret = 0;
int a[40004];
for (int j = (int)s[id2].size() - 1; j > -(int)s[id].size(); j--) {
memse... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
string s[2];
int search(int id) {
int id2 = (id + 1) % 2;
int ret = 0;
int a[40004];
for (int j = (int)s[id2].size() - 1; j > -(int)s[id].size(); j--) {
memse... | replace | 38 | 39 | 38 | 39 | TLE | |
p00451 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define f first
#define s second
#define mp make... | replace | 58 | 68 | 58 | 65 | TLE | |
p00451 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
char A[4002], B[4002];
int DP[4002];
int main() {
while (1) {
scanf("%s", A);
scanf("%s", B);
int ans = 0;
rep(i, strlen(A)) {
... | #include <algorithm>
#include <cstdio>
#include <math.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
char A[4002], B[4002];
int DP[4002];
int main() {
while (scanf("%s", A) != EOF) {
scanf("%s", B);
int ans = 0;
rep(i, strlen(A)) {
... | replace | 12 | 14 | 12 | 13 | TLE | |
p00452 | 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() {
const int MAX_N = 105;
int n, m, p[MAX_N];
int x[MAX_N * MAX_N];
while (true) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
const int MAX_N = 1005;
int n, m, p[MAX_N];
int x[MAX_N * MAX_N];
while (true) {
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
... | replace | 10 | 11 | 10 | 11 | 0 | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef int... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef int... | replace | 29 | 30 | 29 | 30 | TLE | |
p00452 | C++ | Runtime Error | #include "stdio.h"
#include <algorithm>
#include <iostream>
using namespace std;
long long int gten[1000000];
long long int p[1111];
long long int ans[1000];
int main() {
int ww = 0;
while (1) {
long long int n, m;
scanf("%lld %lld", &n, &m);
if (n == 0 && m == 0) {
break;
}
p[0] = 0;
... | #include "stdio.h"
#include <algorithm>
#include <iostream>
using namespace std;
long long int gten[1111111];
long long int p[1111];
long long int ans[1000];
int main() {
int ww = 0;
while (1) {
long long int n, m;
scanf("%lld %lld", &n, &m);
if (n == 0 && m == 0) {
break;
}
p[0] = 0;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
unsigned int N, M;
while (cin >> N >> M, N || M) {
vector<unsigned int> P(N + 1);
P[0] = 0;
for (int i = 1; i <= N; i++)
cin >> P[i];
vector<unsigned int> P2;
for (int i = 0; i <= N; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
unsigned int N, M;
while (cin >> N >> M, N || M) {
vector<unsigned int> P(N + 1);
P[0] = 0;
for (int i = 1; i <= N; i++)
cin >> P[i];
vector<unsigned int> P2;
for (int i = 0; i <= N; i++) {
... | replace | 25 | 26 | 25 | 26 | TLE | |
p00452 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
int n, m;
int a[1001];
int b[51000];
bool f[1001][1001];
int i, j;
int ans;
int c;
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int comp(const void *a, const void *b) {
int p = *(int *)a;
int q = *(int *)b;
return p - q;
}
int search(int num)... | #include <stdio.h>
#include <stdlib.h>
int n, m;
int a[1001];
int b[510000];
bool f[1001][1001];
int i, j;
int ans;
int c;
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int comp(const void *a, const void *b) {
int p = *(int *)a;
int q = *(int *)b;
return p - q;
}
int search(int num... | replace | 4 | 5 | 4 | 5 | 0 | |
p00452 | C++ | Runtime Error | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit
#include <cstring> // require memset
#include <ctime>
#i... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit
#include <cstring> // require memset
#include <ctime>
#i... | replace | 47 | 48 | 47 | 48 | 0 | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int tsP[1001 * 1001];
int main() {
int N, M;
int P[1001];
int ans;
int cnt;
P[0] = 0;
// cin >> N >> M;
while (cin >> N >> M, N && M) {
ans = 0;
cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> P[i];
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int tsP[1001 * 1001];
int main() {
int N, M;
int P[1001];
int ans;
int cnt;
P[0] = 0;
// cin >> N >> M;
while (cin >> N >> M, N && M) {
ans = 0;
cnt = 0;
for (int i = 1; i <= N; i++) {
cin >> P[i];
}
... | replace | 31 | 36 | 31 | 37 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m, a, ans = 0;
vector<int> p, pp;
scanf("%d%d", &n, &m);
p.push_back(0);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
p.push_back(a);
}
for (int ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m, a, ans = 0;
vector<int> p, pp;
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
p.push_back(0);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
... | insert | 11 | 11 | 11 | 13 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define reep(i, a, b... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define reep(i, a, b... | replace | 60 | 64 | 60 | 64 | TLE | |
p00452 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
static const int MAX_N = 100;
int main() {
int N, M;
int point[MAX_N + 1];
int a[(MAX_N + 1) * (MAX_N + 1)];
for (;;) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0)
break;
point[0] = 0;
for (int i = 1; i <= N; i++)
scanf("%d", &point[i])... | #include <bits/stdc++.h>
using namespace std;
static const int MAX_N = 1000;
int main() {
int N, M;
int point[MAX_N + 1];
int a[(MAX_N + 1) * (MAX_N + 1)];
for (;;) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0)
break;
point[0] = 0;
for (int i = 1; i <= N; i++)
scanf("%d", &point[i]... | replace | 2 | 3 | 2 | 3 | 0 | |
p00452 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
int N, M;
ll P[1111];
ll PP[1111];
int p;
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
int NN = N * N;
rep(i, N) cin >> P[i];
rep(i, N) rep(j, N) PP[i + j * N] = P[i] +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long int ll;
int N, M;
ll P[1111];
ll PP[11111111];
int p;
int main(int argc, char *argv[]) {
while (cin >> N >> M, N) {
int NN = N * N;
rep(i, N) cin >> P[i];
rep(i, N) rep(j, N) PP[i + j * N] = P[... | replace | 8 | 9 | 8 | 9 | 0 | |
p00452 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define INF 200000000
using namespace std;
int point2[500500];
int search(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (a[mid] == key)
return a[mid];
else if (a[mid] < key)
... | #include <algorithm>
#include <iostream>
#define INF 200000000
using namespace std;
int point2[1000000];
int search(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (a[mid] == key)
return a[mid];
else if (a[mid] < key)
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00452 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | replace | 47 | 48 | 47 | 48 | 0 | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | replace | 54 | 58 | 54 | 55 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define SCAN(x) cin >> x
#define ALL(a) (a).... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define SCAN(x) cin >> x
#define ALL(a) (a).... | replace | 73 | 74 | 73 | 74 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> a;
vector<int> all;
int n, m;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
a.push_back(0);
all.clear();
f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<int> a;
vector<int> all;
int n, m;
int main() {
while (1) {
cin >> n >> m;
if (n == 0 && m == 0)
break;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
a.push_back(0);
all.clear();
f... | insert | 35 | 35 | 35 | 36 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
vector<int> v;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int size = v.size();
for (int i = 0; i < size; i++) {
fo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n + m) {
vector<int> v;
int a;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
int size = v.size();
for (int i = 0; i < size; i++) {
fo... | replace | 28 | 31 | 28 | 44 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n && m) {
vector<int> point(n + 1);
vector<int> sum;
for (int i = 0; i < n; i++) {
cin >> point[i];
}
for (int i = 0; i < n + 1; i++) {
for (int j = i; j < ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n && m) {
vector<int> point(n + 1);
vector<int> sum;
for (int i = 0; i < n; i++) {
cin >> point[i];
}
for (int i = 0; i < n + 1; i++) {
for (int j = i; j < ... | delete | 25 | 26 | 25 | 25 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int N, M;
int NN;
int *dd;
int *d;
int search(int var) {
int i = 0, j = NN - 1;
int cut;
while (i != j) {
cut = (i + j) / 2;
if (dd[cut] + var > M) {
j = cut - 1;
} else if (dd[cut] + var < M) {
i = cut + 1;
} else
... | #include <algorithm>
#include <iostream>
using namespace std;
int N, M;
int NN;
int *dd;
int *d;
int search(int var) {
int i = 0, j = NN - 1;
int cut;
while (i != j) {
cut = (i + j) / 2;
if (dd[cut] + var > M) {
j = cut;
} else if (dd[cut] + var < M) {
i = cut + 1;
} else
retu... | replace | 16 | 17 | 16 | 17 | TLE | |
p00452 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int point[1000 + 10] = {0};
vector<int> sec;
int sum;
int i, j;
while (cin >> n >> m, n != 0 && m != 0) {
sec.clear();
sum = 0;
for (i = 1; i <= n; i++) {
cin >> point[i];
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
int point[1000 + 10] = {0};
vector<int> sec;
int sum;
int i, j;
while (cin >> n >> m, n != 0 && m != 0) {
sec.clear();
sum = 0;
for (i = 1; i <= n; i++) {
cin >> point[i];
}
... | replace | 29 | 36 | 29 | 44 | TLE | |
p00452 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int sum[1001100];
int main() {
int n, d;
int m[1111];
while (cin >> n >> d, n) {
memset(sum, 0, sizeof(sum));
for (int i = 1; i <= n; i++) {
cin >> m[i];
}
m[0] = 0;
n++;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int sum[1002100];
int main() {
int n, d;
int m[1111];
while (cin >> n >> d, n) {
memset(sum, 0, sizeof(sum));
for (int i = 1; i <= n; i++) {
cin >> m[i];
}
m[0] = 0;
n++;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p00452 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int P[1000], mem[1000 * 1000], N, M;
int main() {
loop:
cin >> N >> M;
if (!N)
return 0;
N++;
P[0] = 0;
for (int i = 1; i < N; i++)
cin >> P[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
mem[N * i + j] = P[i] + P[... | #include <algorithm>
#include <iostream>
using namespace std;
int P[1001], mem[1001 * 1001], N, M;
int main() {
loop:
cin >> N >> M;
if (!N)
return 0;
N++;
P[0] = 0;
for (int i = 1; i < N; i++)
cin >> P[i];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
mem[N * i + j] = P[i] + P[... | replace | 4 | 5 | 4 | 5 | 0 | |
p00452 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <ss... | replace | 50 | 51 | 50 | 51 | 0 | |
p00453 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int fie[152][1002][78];
int main() {
while (1) {
int M, N;
cin >> M >> N;
if (M == 0 && N == 0)
break;
int lis[152][1002];
for (int i = 0; i < 152; i++) {
for (int j = 0; j < 1002; j++) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int fie[152][1002][78];
int main() {
while (1) {
int M, N;
cin >> M >> N;
if (M == 0 && N == 0)
break;
int lis[154][1002];
for (int i = 0; i < 154; i++) {
for (int j = 0; j < 1002; j++) {
... | replace | 12 | 14 | 12 | 14 | 0 | |
p00453 | C++ | Time Limit Exceeded | #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;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #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;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | insert | 35 | 35 | 35 | 37 | TLE | |
p00453 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | replace | 71 | 74 | 71 | 74 | TLE | |
p00453 | 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 | 47 | 48 | 47 | 48 | -11 | |
p00454 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 1001
#define ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#define se second
using names... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define MAX 1001
#define ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#define se second
using names... | replace | 15 | 16 | 15 | 16 | MLE | |
p00454 | C++ | Time Limit Exceeded | #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 dx[4] = {1, -1, 0, 0... | #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 dx[4] = {1, -1, 0, 0... | replace | 37 | 38 | 37 | 38 | TLE | |
p00454 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int n;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// vector<int> xl, yl, xr, yr;
// 座標は 2n+2 個ある
void coordinate_compress(vector<int> &xl, vector<int> &xr, in... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int n;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// vector<int> xl, yl, xr, yr;
// 座標は 2n+2 個ある
void coordinate_compress(vector<int> &xl, vector<int> &xr, in... | replace | 40 | 41 | 40 | 41 | TLE | |
p00454 | C++ | Memory Limit Exceeded | /*
AOJ 0531 Paint Color
?¢???????????????£???????????????????????¨????????¢??????????????????????????\??¶??????????????????????????????????¶?????????¨????¢?????´´?\?????????????
?¢??????????????????????????¶??????????????¢????????????????????°±?????\?¶????5?§??¢???????
????????????????¨???????????¶??????°???????????\?... | /*
AOJ 0531 Paint Color
?¢???????????????£???????????????????????¨????????¢??????????????????????????\??¶??????????????????????????????????¶?????????¨????¢?????´´?\?????????????
?¢??????????????????????????¶??????????????¢????????????????????°±?????\?¶????5?§??¢???????
????????????????¨???????????¶??????°???????????\?... | replace | 66 | 67 | 66 | 67 | MLE | |
p00454 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define MAX_N 1000 + 16
using namespace std;
int N, H, W;
int X1[MAX_N], X2[MAX_N], Y1[MAX_N], Y2[MAX_N];
int fld[6 * MAX_N][6 * MAX_N], dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
int compress(int *x1, int *x2, int w) {... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define MAX_N 1000 + 16
using namespace std;
int N, H, W;
int X1[MAX_N], X2[MAX_N], Y1[MAX_N], Y2[MAX_N];
int fld[2 * MAX_N][2 * MAX_N], dx[4] = {1, -1, 0, 0}, dy[4] = {0, 0, 1, -1};
int compress(int *x1, int *x2, int w) {... | replace | 11 | 12 | 11 | 12 | MLE | |
p00454 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;... | replace | 32 | 33 | 32 | 33 | MLE | |
p00454 | C++ | Memory Limit Exceeded | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
void seach(int x, int y, int X, int Y);
int speace[10000][10000], n;
int main() {
int X, Y, N, x1, y1, x2, y2;
while (1) {
cin >> X >> Y;
if (X == 0 && Y == 0) {
break;
}
cin >> N;
n = 0;
for (int i... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
void seach(int x, int y, int X, int Y);
int speace[5000][5000], n;
int main() {
int X, Y, N, x1, y1, x2, y2;
while (1) {
cin >> X >> Y;
if (X == 0 && Y == 0) {
break;
}
cin >> N;
n = 0;
for (int i =... | replace | 8 | 9 | 8 | 9 | MLE | |
p00454 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define GRGR(dx, dy) \
for (int i = 0, dir[6] = {0, -1, 0, 1, 0, 0}, dx, dy; \
dx = dir[... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, n) for (int i = s; i < n; i++)
#define GRGR(dx, dy) \
for (int i = 0, dir[6] = {0, -1, 0, 1, 0, 0}, dx, dy; \
dx = dir[... | replace | 37 | 38 | 37 | 38 | 0 | |
p00454 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF INT_MAX / 2
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF INT_MAX / 2
#define... | replace | 33 | 34 | 33 | 34 | MLE | |
p00454 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, true) : false;
}
typedef long long ll... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
template <typename T> bool chmax(T &a, const T &b) {
return a < b ? (a = b, true) : false;
}
template <typename T> bool chmin(T &a, const T &b) {
return b < a ? (a = b, true) : false;
}
typedef long long ll... | replace | 15 | 17 | 15 | 17 | MLE | |
p00454 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define... | replace | 42 | 44 | 42 | 44 | MLE | |
p00455 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int h[3] = {0};
int m[3] = {0};
int s[3] = {0};
int H[3] = {0};
int M[3] = {0};
int S[3] = {0};
int j, f, b;
for (int i = 0; i < 4; i++) {
cin >> h[i] >> m[i] >> s[i] >> H[i] >> M[i] >> S[i];
j = (3600 * H[i] + 60 * M[i] + S[i] - 3600 * h[i] ... | #include <iostream>
using namespace std;
int main() {
int sh, sm, ss, eh, em, es;
int h, m, s;
for (int i = 0; i < 3; i++) {
cin >> sh >> sm >> ss >> eh >> em >> es;
if (es < ss) {
em = em - 1;
es = es + 60;
}
s = es - ss;
if (em < sm) {
eh = eh - 1;
em = em + 60;
}... | replace | 3 | 20 | 3 | 19 | 0 | |
p00457 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using namesp... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using namesp... | insert | 46 | 46 | 46 | 48 | TLE | |
p00457 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
char chain[10000];
int ccount(int a, int b, int cnt) {
if (chain[a] != chain[b])
return cnt;
int len = 0;
int i, j;
for (i = a; i >= 0 && chain[a] == chain[i]; i--, len++)
;
for (j = b; j < n && chain[b] == chain[j... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int chain[10002];
int ccount(int a, int b, int cnt) {
if (chain[a] != chain[b])
return cnt;
int len = 0;
int i, j;
for (i = a; i >= 0 && chain[a] == chain[i]; i--, len++)
;
for (j = b; j < n && chain[b] == chain[j]... | replace | 6 | 7 | 6 | 7 | TLE | |
p00457 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 100000000;
int n, x[10001][2], list[4], save[10001], l1 = 0, l2 = 0, ans = INF;
vector<int> v1, v2, v3;
int solve(int a) {
l1 = 0;
l2 = 0;
for (int i = 1; i < v2.size(); i++) {
if (v2[a + i] == v2[a]) {
l1++;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 100000000;
int n, x[10001][2], list[4], save[10001], l1 = 0, l2 = 0, ans = INF;
vector<int> v1, v2, v3;
int solve(int a) {
l1 = 0;
l2 = 0;
for (int i = 1; i < v2.size(); i++) {
if (v2[a + i] == v2[a]) {
l1++;... | replace | 24 | 25 | 24 | 25 | 0 | |
p00457 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[10010] = {0};
int b[10010] = {0};
int ans = 1001, w;
void kotani(int i, int j, int c, int n);
int main() {
while (1) {
int n;
scanf("%d", &n);
w = n;
ans = n;
if (n == 0)
break;
for... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int a[10010] = {0};
int b[10010] = {0};
int ans = 1001, w;
void kotani(int i, int j, int c, int n);
int main() {
while (1) {
int n;
scanf("%d", &n);
w = n;
ans = n;
if (n == 0)
break;
for... | delete | 27 | 28 | 27 | 27 | -6 | free(): invalid pointer
|
p00457 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
void debug(vector<P> &v) {
cout << "[debug]" << endl;
for (int i = 0; i < v.size(); i++) {
cout << "(" << v[i].first << "," << v[i].second << ")" << endl;
}
cout << endl;
}
vector<P> r... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
void debug(vector<P> &v) {
cout << "[debug]" << endl;
for (int i = 0; i < v.size(); i++) {
cout << "(" << v[i].first << "," << v[i].second << ")" << endl;
}
cout << endl;
}
vector<P> r... | replace | 16 | 17 | 16 | 17 | MLE | |
p00457 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int64;
const int inf = (int)1e9;
int calc(int it1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int64;
const int inf = (int)1e9;
int calc(int it1... | replace | 25 | 26 | 25 | 26 | TLE | |
p00457 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int a[10000];
int b[10001];
int ans = 1e9;
int c(int x, int y) { // change b[x] to y return remaining
b[x] = y;
int e = n;
bool f = true;
while (f) {
f = false;
int d = 1;
int p = b[0];
for (int i = 1; i < n ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int a[10000];
int b[10001];
int ans = 1e9;
int c(int x, int y) { // change b[x] to y return remaining
b[x] = y;
int e = n;
bool f = true;
while (f) {
f = false;
int d = 1;
int p = b[0];
for (int i = 1; i < n ... | replace | 67 | 68 | 67 | 70 | TLE | |
p00458 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy... | #include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) FOR(i, 0, a)
using namespace std;
bool maps[100][100];
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int search(int y, int x) {
int maxim = 0;
maps[y][x] = false;
REP(i, 4)
if (y + dy... | replace | 12 | 13 | 12 | 13 | 0 | |
p00458 | C++ | Time Limit Exceeded | #include "stdio.h"
int ido(int x, int y, int aw[90][90]) {
int a[90][90];
for (int i = 0; i < 90; i++) {
for (int ii = 0; ii < 90; ii++) {
a[i][ii] = aw[i][ii];
}
}
a[x][y] = 0;
int max = 0;
if (x + 1 < 90) {
if (a[x + 1][y] == 1) {
int w = ido(x + 1, y, a);
if (max < w) {
... | #include "stdio.h"
int ido(int x, int y, int aw[90][90]) {
int a[90][90];
for (int i = 0; i < 90; i++) {
for (int ii = 0; ii < 90; ii++) {
a[i][ii] = aw[i][ii];
}
}
a[x][y] = 0;
int max = 0;
if (x + 1 < 90) {
if (a[x + 1][y] == 1) {
int w = ido(x + 1, y, a);
if (max < w) {
... | replace | 69 | 72 | 69 | 87 | TLE | |
p00458 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define INF 1234567890
int map[60][60];
int x_max, y_max;
int ans;
int dp(int x, int y) {
if (map[x][y] == 0)
return 0;
int answer = 1;
map[x][y] = 0;
if (map[x][y - 1] == 1)
answer = max(answer, dp(x, y - 1) + 1);
if (... | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define INF 1234567890
int map[100][100];
int x_max, y_max;
int ans;
int dp(int x, int y) {
if (map[x][y] == 0)
return 0;
int answer = 1;
map[x][y] = 0;
if (map[x][y - 1] == 1)
answer = max(answer, dp(x, y - 1) + 1);
if... | replace | 6 | 7 | 6 | 7 | 0 | |
p00459 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
struct tb {
int f, t;
tb(int f, int t) : f(f), t(t) {}
};
int n, m, pr, q, r;
int chx[5001][3];
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
queue<tb> c;
queue<tb> d[4];
c.push(tb(1, n));
... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
struct tb {
int f, t;
tb(int f, int t) : f(f), t(t) {}
};
int n, m, pr, q, r;
int chx[5001][3];
int main(void) {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
queue<tb> c;
queue<tb> d[4];
c.push(tb(1, n));
... | replace | 78 | 84 | 78 | 90 | TLE | |
p00459 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | replace | 86 | 87 | 86 | 87 | TLE | |
p00459 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, m, p, q, r;
int main() {
while (scanf("%d", &n), n) {
scanf("%d", &m);
scanf("%d%d%d", &p, &q, &r);
vector<P> *z = new vector<P>;
z->push_back(... | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, m, p, q, r;
int main() {
while (scanf("%d", &n), n) {
scanf("%d", &m);
scanf("%d%d%d", &p, &q, &r);
vector<P> *z = new vector<P>;
z->push_back(... | insert | 39 | 39 | 39 | 40 | MLE | |
p00460 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<int, P> P1;
#define fr first
#define... | replace | 83 | 84 | 83 | 85 | TLE | |
p00460 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
#define rep(i, n) for (i = 0; i < n; i++)
#define reps(i, n) for (i = 1; i <= n; i++)
int dp[50][2][3001];
int main() {
int n, m, s, nn, st, i, j, k;
int t1 = 0, t2 = 1;
while (1) {
scanf("%d%d%d", &n, &m, &s);
if (n == 0)
break;
... | #include <algorithm>
#include <cstdio>
using namespace std;
#define rep(i, n) for (i = 0; i < n; i++)
#define reps(i, n) for (i = 1; i <= n; i++)
int dp[50][2][3001];
int main() {
int n, m, s, nn, st, i, j, k;
int t1 = 0, t2 = 1;
while (1) {
scanf("%d%d%d", &n, &m, &s);
if (n == 0)
break;
... | replace | 38 | 39 | 38 | 39 | 0 | |
p00460 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mod 100000
typedef pair<int, int> P;
int n, m, s, ans;
int dp[2][3010][4010];
int main() {
while (cin >> n >> m >> s && n) {
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int i = 0; i < n * n; ++i) {
for (int j... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mod 100000
typedef pair<int, int> P;
int n, m, s, ans;
int dp[2][2001][3001];
int main() {
while (cin >> n >> m >> s && n) {
memset(dp, 0, sizeof(dp));
dp[0][0][0] = 1;
for (int i = 0; i < n * n; ++i) {
for (int j... | replace | 7 | 8 | 7 | 8 | MLE | |
p00460 | C++ | Time Limit Exceeded | #include <cstdio>
#include <string.h>
using namespace std;
int n, m, s, ans;
int dp[2][2001][3001];
int main() {
while (scanf("%d%d%d", &n, &m, &s) && n && m && s) {
for (int i = 1; i <= m; i++)
dp[0][i][i] = 1;
for (int i = 2; i <= n * n; i++) {
for (int j = 1; j <= m; j++) {
for (int ... | #include <cstdio>
#include <string.h>
using namespace std;
int n, m, s, ans;
int dp[2][2001][3001];
int main() {
while (scanf("%d%d%d", &n, &m, &s) && n && m && s) {
for (int i = 1; i <= m; i++)
dp[0][i][i] = 1;
for (int i = 2; i <= n * n; i++) {
for (int j = 1; j < m; j++) {
for (int k... | replace | 13 | 23 | 13 | 18 | TLE | |
p00460 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
const int mod = 100000;
int main() {
int n, m, s;
int dp[50][2001];
while (cin >> n >> m >> s, n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; ++i) {
for (int j = n * n - 1; j >= 0; --j) {
for (int k = 0; ... | #include <cstring>
#include <iostream>
using namespace std;
const int mod = 100000;
int main() {
int n, m, s;
int dp[50][3001];
while (cin >> n >> m >> s, n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; ++i) {
for (int j = n * n - 1; j >= 0; --j) {
for (int k = 0; ... | replace | 7 | 8 | 7 | 8 | 0 | |
p00460 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = 1; k <= s; k++) {
dp[j][k] += dp[j - 1][... | #include <cstdio>
#include <cstring>
int dp[50][3001];
int main() {
int n, m, s;
while (scanf("%d %d %d", &n, &m, &s), n) {
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= m; i++)
for (int j = n * n; j >= 1; j--)
for (int k = i; k <= s; k++) {
dp[j][k] += dp[j - 1][... | replace | 10 | 11 | 10 | 11 | 0 | |
p00460 | C++ | Runtime Error |
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespac... |
// y09-6 ビンゴ(2回目)
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
using namespac... | replace | 48 | 49 | 48 | 49 | 0 | |
p00460 | 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 | 61 | 62 | 61 | 62 | -11 | |
p00460 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int dp[50][3001];
const int MOD = 100000;
int main() {
while (true) {
int n, m, s;
cin >> n >> m >> s;
if (n == 0)
break;
n = n * n;
rep(i, 50) rep(j, 3001) dp[i][j] = 0;
dp[0][0] = 1;
rep... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int dp[50][3001];
const int MOD = 100000;
int main() {
while (true) {
int n, m, s;
cin >> n >> m >> s;
if (n == 0)
break;
n = n * n;
rep(i, 50) rep(j, 3001) dp[i][j] = 0;
dp[0][0] = 1;
rep... | replace | 18 | 19 | 18 | 19 | 0 | |
p00460 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int mod = 100000;
int n, m, s;
int dp[50][2010][3100];
int dfs(int i = 0, int pre = 0, int sum = s) {
if (sum < 0)
return 0;
if (pre > m)
return 0;
if (i == n * n) {
return sum == 0;
}
int &ret = dp[i][pre][sum];
if (ret != -1)
return... | #include "bits/stdc++.h"
main() {
for (int n, m, s, i, j, d[50][3500], M = 1e5;
std::cin >> n >> m >> s, n *= n;) {
std::fill(d[0], d[50], M);
d[0][0] = 1;
for (i = 1; i <= n; ++i)
for (j = 0; j <= s; ++j) {
if (j >= i)
d[i][j] += d[i - 1][j - i] + d[i][j - i];
if (j... | replace | 0 | 35 | 0 | 15 | MLE | |
p00461 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#includ... | replace | 277 | 278 | 277 | 278 | 0 | ioi.size() = 3
ioi.size() = 5
|
p00461 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int n, m;
string s;
int main() {
while (cin >> n) {
if (!n)
return 0;
cin >> m >> s;
int a = 0;... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int n, m;
string s;
int main() {
while (cin >> n) {
if (!n)
return 0;
cin >> m >> s;
int a = 0,... | replace | 20 | 27 | 20 | 32 | TLE | |
p00461 | C++ | Time Limit Exceeded | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | replace | 50 | 52 | 50 | 52 | TLE | |
p00461 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
while (cin >> n >> l, n || l) {
string str;
cin >> str;
int mode = 0;
int chain = 0;
int ans = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == 'I') {
switch (mode) {
case 0:
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, l;
while (cin >> n, n) {
cin >> l;
string str;
cin >> str;
int mode = 0;
int chain = 0;
int ans = 0;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == 'I') {
switch (mode) {
case 0:... | replace | 7 | 8 | 7 | 9 | TLE | |
p00461 | 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;
ll n, m;
string s;
ll dp[100001];
ll ans = 0;
int main() ... | #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;
ll n, m;
string s;
ll dp[1000001];
ll ans = 0;
int main()... | replace | 16 | 17 | 16 | 17 | 0 | |
p00461 | C++ | Runtime Error | #include "stdio.h"
char s[1111111];
int w[1111111];
int h[1000000];
int main() {
int noww = 0;
while (1) {
int n;
int m;
{
scanf("%d", &n);
if (n == 0) {
break;
}
scanf("%d", &m);
scanf("%s", s + 1);
}
{
s[0] = s[1];
w[0] = 0;
for (int ... | #include "stdio.h"
char s[1111111];
int w[1111111];
int h[1000000];
int main() {
int noww = 0;
while (1) {
int n;
int m;
{
scanf("%d", &n);
if (n == 0) {
break;
}
scanf("%d", &m);
scanf("%s", s + 1);
}
{
s[0] = s[1];
w[0] = 0;
for (int ... | replace | 44 | 45 | 44 | 45 | -11 | |
p00461 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int m;
string s;
while (cin >> n, n != 0) {
cin >> m >> s;
int p[100] = {0};
int f = 1;
... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
int m;
string s;
while (cin >> n, n != 0) {
cin >> m >> s;
int p[1000001] = {0};
int f = 1;... | replace | 17 | 18 | 17 | 18 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.