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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02315 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
int N, W, dp[100][10005], v[105], w[105], i;
int dfs(int d, int nw) {
int r;
if (dp[d][nw] >= 0)
return dp[d][nw];
if (d == N)
r = 0;
else if (w[d] > nw)
r = dfs(d + 1, nw);
else
r = std::max(dfs(d + 1, nw), dfs(d + 1, nw - w[d]) + v... | #include <algorithm>
#include <stdio.h>
#include <string.h>
int N, W, dp[105][20005], v[105], w[105], i;
int dfs(int d, int nw) {
int r;
if (dp[d][nw] >= 0)
return dp[d][nw];
if (d == N)
r = 0;
else if (w[d] > nw)
r = dfs(d + 1, nw);
else
r = std::max(dfs(d + 1, nw), dfs(d + 1, nw - w[d]) + v... | replace | 3 | 4 | 3 | 4 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, W, a, b;
vector<int> v;
vector<int> w;
int memo[100][10000];
int fun(int i, int sw) {
int temp;
if (memo[i][sw] >= 0)
return memo[i][sw];
if (i == n) {
temp = 0;
} else if (w[i] > sw) {
temp = f... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int n, W, a, b;
vector<int> v;
vector<int> w;
int memo[101][10001];
int fun(int i, int sw) {
int temp;
if (memo[i][sw] >= 0)
return memo[i][sw];
if (i == n) {
temp = 0;
} else if (w[i] > sw) {
temp = f... | replace | 9 | 10 | 9 | 10 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> v(N);
vector<int> w(W + 1);
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
vector<vector<int>> DP(N);
for (int i = 0; i < N; i++) {
DP[i].resize(W + 1);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<int> v(N);
vector<int> w(N);
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
vector<vector<int>> DP(N);
for (int i = 0; i < N; i++) {
DP[i].resize(W + 1);
fill... | replace | 10 | 11 | 10 | 11 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
long long N, W, K, v[300], w[300];
long long dp[100][10100];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
for (int i = 1; i <= W; i++)
dp[N + 1][... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
long long N, W, K, v[300], w[300];
long long dp[1000][10100];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> v[i] >> w[i];
}
for (int i = 1; i <= W; i++)
dp[N + 1]... | replace | 9 | 10 | 9 | 10 | 0 | |
p02315 | C++ | Runtime Error | /**
* @brief 0-1ナップサック問題(0-1 knapsack problem)は次の問題である
*
* 泥棒がある店に盗みに入ってn個の品物を見つけた.
* i番目の品物はviドルの価値があり、重さはwiポンドである
* ただし、viとwiは整数である.
* 彼はできるだけ高価な品物を盗りたいが、彼のナップサックでは高々Wポンド(Wは整数)の荷物しか運べない
*
* 各品物は盗るか残すかのどちらかなので、この問題は0-1ナップサック問題と呼ばれる
* この泥棒は品物の一部だけを盗ったり、同じものを複数回盗ることはできない
*
* @... | /**
* @brief 0-1ナップサック問題(0-1 knapsack problem)は次の問題である
*
* 泥棒がある店に盗みに入ってn個の品物を見つけた.
* i番目の品物はviドルの価値があり、重さはwiポンドである
* ただし、viとwiは整数である.
* 彼はできるだけ高価な品物を盗りたいが、彼のナップサックでは高々Wポンド(Wは整数)の荷物しか運べない
*
* 各品物は盗るか残すかのどちらかなので、この問題は0-1ナップサック問題と呼ばれる
* この泥棒は品物の一部だけを盗ったり、同じものを複数回盗ることはできない
*
* @... | replace | 101 | 103 | 101 | 103 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#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 namespace std;
#defin... | #include <algorithm>
#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 namespace std;
#defin... | replace | 37 | 38 | 37 | 38 | 0 | |
p02315 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b) { return a.v == b.v ? a.w < b.w : a.v > b.v; }
int main(void) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b) { return a.v == b.v ? a.w < b.w : a.v > b.v; }
int main(void) {
... | delete | 40 | 41 | 40 | 40 | 0 | |
p02315 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b) { return a.v == b.v ? a.w < b.w : a.v > b.v; }
int main(void) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b) { return a.v == b.v ? a.w < b.w : a.v > b.v; }
int main(void) {
... | replace | 40 | 41 | 40 | 41 | 0 | |
p02315 | C++ | Runtime Error | // #define USE_CPP11
// #define USE_PRINTF
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#in... | // #define USE_CPP11
// #define USE_PRINTF
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#in... | replace | 160 | 161 | 160 | 161 | -11 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define MAX_N 100
#define MAX_W 1000
int N, W, v[MAX_N], w[MAX_N];
int dp[MAX_N + 1][MAX_W + 1];
void solve();
int main() {
std::cin >> N >> W;
for (int i = 0; i < N; ++i)
std::cin >> v[i] >> w[i];
solve();
return 0;
}
void solve() {
for (int i = N - 1; i >=... | #include <algorithm>
#include <iostream>
#define MAX_N 100
#define MAX_W 10000
int N, W, v[MAX_N], w[MAX_N];
int dp[MAX_N + 1][MAX_W + 1];
void solve();
int main() {
std::cin >> N >> W;
for (int i = 0; i < N; ++i)
std::cin >> v[i] >> w[i];
solve();
return 0;
}
void solve() {
for (int i = N - 1; i >... | replace | 4 | 5 | 4 | 5 | 0 | |
p02315 | C++ | Runtime Error | // ------------------------------------
// Date:2018/ 3/ 2
// Problem:AOJ DPL 0-1 Knapsack Problem 1_b.cpp
//
// ------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define EACH(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RFOR(i, a, b) fo... | // ------------------------------------
// Date:2018/ 3/ 2
// Problem:AOJ DPL 0-1 Knapsack Problem 1_b.cpp
//
// ------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define EACH(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RFOR(i, a, b) fo... | replace | 40 | 41 | 40 | 41 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
vector<int> dp(100000);
int main() {
int N, W;
int v[2000];
int w[2000];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int j = 0; j < N; j++) {
for (int i ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
vector<int> dp(100000);
int main() {
int N, W;
int v[2000];
int w[2000];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int j = 0; j < N; j++) {
for (int i ... | replace | 21 | 22 | 21 | 22 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, W;
cin >> N >> W;
int value[N];
int weight[N];
REP(n, N) {
cin >> value[n];
cin >> weight[n];
}
int dp[100][10000] = {{}};
REP(n, N) {
... | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, W;
cin >> N >> W;
int value[N];
int weight[N];
REP(n, N) {
cin >> value[n];
cin >> weight[n];
}
int dp[110][11000] = {{}};
REP(n, N) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02315 | C++ | Runtime Error | #include <stdio.h>
int i, j, a, b, c[101], d[101], e[101][10001], f = -1;
int main(void) {
scanf("%d %d", &a, &b);
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
e[i][j] = -1;
}
}
for (i = 0; i < a; i++) {
scanf("%d %d", &c[i], &d[i]);
}
e[0][0] = 0;
for (i = 0; i < a; i++) {
... | #include <stdio.h>
int i, j, a, b, c[101], d[101], e[102][10001], f = -1;
int main(void) {
scanf("%d %d", &a, &b);
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
e[i][j] = -1;
}
}
for (i = 0; i < a; i++) {
scanf("%d %d", &c[i], &d[i]);
}
e[0][0] = 0;
for (i = 0; i < a; i++) {
... | replace | 1 | 2 | 1 | 2 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define MP make_pair
typedef unsigned long long ULL;
// dp[i+][j]
// i番目まで... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define MP make_pair
typedef unsigned long long ULL;
// dp[i+][j]
// i番目まで... | replace | 20 | 21 | 20 | 21 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int dp[105][10005] = {};
int n;
cin >> n;
int W;
cin >> W;
int w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int dp[105][10005] = {};
int n;
cin >> n;
int W;
cin >> W;
int w[105], v[105];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {... | replace | 9 | 10 | 9 | 10 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int dp[105][10005] = {};
int n;
cin >> n;
int W;
cin >> W;
int w[n], v[n];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int dp[105][10005] = {};
int n;
cin >> n;
int W;
cin >> W;
int v[105], w[105];
for (int i = 0; i < n; i++) {
cin >> v[i] >> w[i];
}
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= W; j++) {
if (j < w[i]) {... | replace | 9 | 10 | 9 | 10 | 0 | |
p02315 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR_IN(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define IN(x, a, b) ((x) >= (a) && (x) <= (b))
using namespace std;
typedef long long int ll;
/*
N W
vi wi
N 100
W 10000
*/
int N, W;
int w[100], v[100];
ll d... | #include <bits/stdc++.h>
#include <cstdio>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR_IN(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define IN(x, a, b) ((x) >= (a) && (x) <= (b))
using namespace std;
typedef long long int ll;
/*
N W
vi wi
N 100
W 10000
*/
int N, W;
int w[100], v[100];
ll d... | replace | 20 | 21 | 20 | 21 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
#define max_i 100
#define max_j 10000
int dp[max_i][max_j];
void solve() {
int n, m;
int v[max_i + 1], w[max_i + 1];
std::cin >> n >> m;
for (int i = 0; i < n; i++) {
/* code */
std::cin >> v[i] >> w[i];
}
for (int i = 0; i < n; i++)... | #include <iostream>
using namespace std;
typedef long long ll;
#define max_i 100
#define max_j 10000
int dp[max_i + 1][max_j + 1];
void solve() {
int n, m;
int v[max_i + 1], w[max_i + 1];
std::cin >> n >> m;
for (int i = 0; i < n; i++) {
/* code */
std::cin >> v[i] >> w[i];
}
for (int i = 0; i <... | replace | 7 | 8 | 7 | 8 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
const int inf = 999999999999999999;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
const int inf = 999999999999999999;
... | replace | 32 | 33 | 32 | 33 | 0 | |
p02315 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int N, W;
int dp[10010][10010];
vector<int> v(1100);
vector<int> w(1100);
int rec(int i, int j) {
if (dp[i][j] >= 0)
return dp[i][j];
int res;
if (i == N)
res = 0;
else if (j < w[i])
res = rec(i + 1, j);
el... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int N, W;
int dp[110][10010];
vector<int> v(1100);
vector<int> w(1100);
int rec(int i, int j) {
if (dp[i][j] >= 0)
return dp[i][j];
int res;
if (i == N)
res = 0;
else if (j < w[i])
res = rec(i + 1, j);
else... | replace | 4 | 5 | 4 | 5 | MLE | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ... | replace | 118 | 119 | 118 | 119 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define pyfor(j, s, n, i) for... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <set>
#include <sstream>
#include <typeinfo>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define pyfor(j, s, n, i) for... | replace | 40 | 41 | 40 | 41 | 0 | pack(3 5): 8
pack(3 4): 8
pack(2 5): 10
pack(3 3): 8
pack(3 2): 0
pack(2 3): 8
pack(1 5): 13
pack(3 1): 0
pack(3 0): 0
pack(2 1): 2
pack(1 3): 8
pack(0 5): 13
|
p02315 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define LL long long
#define ULL unsigned long long
#define ull un... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define ll long long
#define LL long long
#define ULL unsigned long long
#define ull un... | replace | 24 | 25 | 24 | 25 | MLE | |
p02315 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, m, v[1100], w[1100];
bool done[100][11000];
int memo[100][11000];
int search(int i, int h) {
if (done[i][h])
return memo[i][h];
int res;
if (i == n)
res = 0;
else if (w[i] > h)
res = search(i + 1, h);
else if (w[i] <= h) {
int res1 = search(i... | #include <iostream>
using namespace std;
int n, m, v[1100], w[1100];
bool done[110][11000];
int memo[110][11000];
int search(int i, int h) {
if (done[i][h])
return memo[i][h];
int res;
if (i == n)
res = 0;
else if (w[i] > h)
res = search(i + 1, h);
else if (w[i] <= h) {
int res1 = search(i... | replace | 4 | 6 | 4 | 6 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
using namespace std;
const int maxn = 1010;
int dp[maxn], v[maxn], w[maxn];
int main() {
memset(dp, 0, sizeof(dp));
int n, W;
cin >> n >> W;
for (... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
using namespace std;
const int maxn = 10500;
int dp[maxn], v[maxn], w[maxn];
int main() {
memset(dp, 0, sizeof(dp));
int n, W;
cin >> n >> W;
for ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m... | replace | 48 | 49 | 48 | 49 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PII pair<int, int>
int dp[100][10001];
PII p[101];
int main() {
int N, W;
cin >> N >> W;
REP(i, N) cin >> p[i].first >> p[i].second;
REP(i, N + 1) REP(j, W + 1) dp[i][j] = -1;
REP(i, N) dp[i]... | #include <algorithm>
#include <iostream>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PII pair<int, int>
int dp[101][10001];
PII p[101];
int main() {
int N, W;
cin >> N >> W;
REP(i, N) cin >> p[i].first >> p[i].second;
REP(i, N + 1) REP(j, W + 1) dp[i][j] = -1;
REP(i, N) dp[i]... | replace | 6 | 7 | 6 | 7 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 100
#define MAX_W 100001
long long dp[MAX_N][MAX_W];
int main() {
long long N;
cin >> N;
long long W;
cin >> W;
vector<vector<long long>> v(N, vector<long long>(2));
for (long long i = 0; i < N; i++) {
cin >> ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 101
#define MAX_W 100001
long long dp[MAX_N][MAX_W];
int main() {
long long N;
cin >> N;
long long W;
cin >> W;
vector<vector<long long>> v(N, vector<long long>(2));
for (long long i = 0; i < N; i++) {
cin >> ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02315 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, W, w[100], v[100], memo[101][10001];
int rec(int i, int j) {
if (memo[i][j] != -1)
return memo[i][j];
int res;
if (i == n)
res = 0;
else if (j < w[i])
res = rec(i + 1, j);
else
res = max(rec(i + 1, j), rec... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int n, W, w[100], v[100], memo[101][10001];
int rec(int i, int j) {
if (memo[i][j] != -1)
return memo[i][j];
int res;
if (i == n)
res = 0;
else if (j < w[i])
res = rec(i + 1, j);
else
res = max(rec(i + 1, j), rec... | replace | 17 | 18 | 17 | 18 | TLE | |
p02315 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#define nMAX 1000
#define vMAX 10000
#define wMAX 10000
#define WMAX 100000
int n, W;
int v[nMAX], w[nMAX];
int dp[nMAX][WMAX];
using namespace std;
int rec(int i, int j) {
if (dp[i][j] >= 0)
return dp[i][j];
int res;
if (i == n)
res = 0;
e... | #include <algorithm>
#include <cstring>
#include <iostream>
#define nMAX 200
#define vMAX 2000
#define wMAX 2000
#define WMAX 20000
int n, W;
int v[nMAX], w[nMAX];
int dp[nMAX][WMAX];
using namespace std;
int rec(int i, int j) {
if (dp[i][j] >= 0)
return dp[i][j];
int res;
if (i == n)
res = 0;
else ... | replace | 4 | 8 | 4 | 8 | MLE | |
p02315 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 2000000000
#define int long long int
#define MOD 1000000007
#define pb push_back
#define cin1(n) (cin >> n)
#define cin2(a, b) (cin >> a >> b)
#define cin3(a, b, c) (cin >> a >> b >> c)
#define cout(n) (cout << n << endl)
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define ... | #include <bits/stdc++.h>
#define INF 2000000000
#define int long long int
#define MOD 1000000007
#define pb push_back
#define cin1(n) (cin >> n)
#define cin2(a, b) (cin >> a >> b)
#define cin3(a, b, c) (cin >> a >> b >> c)
#define cout(n) (cout << n << endl)
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define ... | replace | 33 | 34 | 33 | 34 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
using namespace std;
//
const int inf = 1e9 + 7;
cons... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
using namespace std;
//
const int inf = 1e9 + 7;
cons... | delete | 39 | 41 | 39 | 39 | 0 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr int INF = (1 << 30) - 1;
constexpr int MOD = 1000000000 + 7;
int N, W;
vector<int> v, w;
int dp[100][10001];
int main() {
cin >> N ... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr int INF = (1 << 30) - 1;
constexpr int MOD = 1000000000 + 7;
int N, W;
vector<int> v, w;
int dp[101][10001];
int main() {
cin >> N ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int dp[1000][10010] = {0}, w[10000] = {0}, k[10000] = {0}, N, M, i, j;
cin >> N >> M;
for (i = 1; i <= N; i++) {
cin >> k[i] >> w[i];
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
if (i == 1) {
if (j >= w[i]) {
dp[... | #include <iostream>
using namespace std;
int main() {
int dp[120][10001] = {0}, w[1000] = {0}, k[1000] = {0}, N, M, i, j;
cin >> N >> M;
for (i = 1; i <= N; i++) {
cin >> k[i] >> w[i];
}
for (i = 1; i <= N; i++) {
for (j = 1; j <= M; j++) {
if (i == 1) {
if (j >= w[i]) {
dp[i][... | replace | 3 | 4 | 3 | 4 | -11 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | replace | 75 | 76 | 75 | 76 | 0 | |
p02315 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int larger(int x, int y) {
if (x > y) {
return x;
} else {
return y;
}
}
int main() {
int N, W;
cin >> N >> W;
int values[N];
int weight[N];
for (int i = 0; i < N; i++) {
cin >> values[i] >> w... | #include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int larger(int x, int y) {
if (x > y) {
return x;
} else {
return y;
}
}
int main() {
int N, W;
cin >> N >> W;
int values[N];
int weight[N];
for (int i = 0; i < N; i++) {
cin >> values[i] >> w... | replace | 29 | 30 | 29 | 30 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
using namespace std;
int N = 0;
int W = 0;
int max = 0;
int a[1000] = {0};
int w[1000] = {0};
int v[1000] = {0};
int dp[1000][1000] = {0};
int main(void) {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int i = 1; i < W + 1; i++) {
for (int j = 0; j < N;... | #include <iostream>
using namespace std;
int N = 0;
int W = 0;
int max = 0;
int a[1000] = {0};
int w[1000] = {0};
int v[1000] = {0};
int dp[10000][1000] = {0};
int main(void) {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
for (int i = 1; i < W + 1; i++) {
for (int j = 0; j < N... | replace | 9 | 10 | 9 | 10 | 0 | |
p02315 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int N, W;
int w[1010],... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template <class T> void vin(vector<T> &v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
int N, W;
int w[1010],... | replace | 16 | 17 | 16 | 17 | MLE | |
p02315 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int item_v[100], item_w[100];
rep(i, n) { cin >> item_v[i] >> item_w[i]; }
int dp[101][10100] = {};
for (int i = 1; i <= n; i++) {
rep(j, 100001) {
dp[i][j] = ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int item_v[100], item_w[100];
rep(i, n) { cin >> item_v[i] >> item_w[i]; }
int dp[101][10100] = {};
for (int i = 1; i <= n; i++) {
rep(j, 10001) {
dp[i][j] = d... | replace | 12 | 13 | 12 | 13 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, W;
int v[N], w[N];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int j = 0; j <= W; j++)
DP[0][j] = 0;
for (int i = 1; i <= N; i++)
for (int j = 0; j <= W; j++)
if (j < w[i -... | #include <iostream>
using namespace std;
int main() {
int N, W;
int v[101], w[101];
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> v[i] >> w[i];
}
int DP[N + 1][W + 1];
for (int j = 0; j <= W; j++)
DP[0][j] = 0;
for (int i = 1; i <= N; i++)
for (int j = 0; j <= W; j++)
if (j < w... | replace | 5 | 6 | 5 | 6 | -11 | |
p02315 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define INF 10000000;
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (x >= A[j]) {
i = i + 1;
swap(A[i], A[j]);
}
}
swa... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define INF 10000000;
int partition(int A[], int p, int r) {
int x = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (x >= A[j]) {
i = i + 1;
swap(A[i], A[j]);
}
}
swa... | replace | 44 | 45 | 44 | 45 | 0 | |
p02315 | C++ | Runtime Error | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, W;
cin >> N >> W;
int value[N];
int weight[N];
REP(n, N) {
cin >> value[n];
cin >> weight[n];
}
int dp[100][10001] = {{}};
REP(n, N) {
... | #include <iostream>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int N, W;
cin >> N >> W;
int value[N];
int weight[N];
REP(n, N) {
cin >> value[n];
cin >> weight[n];
}
int dp[101][10002] = {{}};
REP(n, N) {
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02316 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); ++i)
#define repeat_rev(i, n) for (int i = (n)-1; 0 <= i; ++i)
#define MAX_N 100
#define MAX_W 10000
struct item {
int v, w;
};
int N, W;
item t[MAX_N];
int dp[2][MAX_W + 1];
int main() {
cin >> N >> W;
... | #include <algorithm>
#include <iostream>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); ++i)
#define repeat_rev(i, n) for (int i = (n)-1; 0 <= i; ++i)
#define MAX_N 100
#define MAX_W 10000
struct item {
int v, w;
};
int N, W;
item t[MAX_N];
int dp[2][MAX_W + 1];
int main() {
cin >> N >> W;
... | delete | 27 | 29 | 27 | 27 | 0 | 0 0 4 4 8 8 12 12 16
0 0 5 5 10 10 15 15 20
0 2 5 7 10 12 15 17 20
0 2 5 8 10 13 16 18 21
|
p02316 | C++ | Runtime Error | #include <stdio.h>
int i, j, k, a, b, c[1001], d[1001], e[10001], f = -1;
int main(void) {
scanf("%d %d", &a, &b);
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
e[i] = -1;
}
}
for (i = 0; i < a; i++) {
scanf("%d %d", &c[i], &d[i]);
}
e[0] = 0;
for (i = 0; i <= b; i++) {
if (e... | #include <stdio.h>
int i, j, k, a, b, c[1001], d[1001], e[10001], f = -1;
int main(void) {
scanf("%d %d", &a, &b);
for (i = 0; i <= a; i++) {
for (j = 0; j <= b; j++) {
e[i] = -1;
}
}
for (i = 0; i < a; i++) {
scanf("%d %d", &c[i], &d[i]);
}
e[0] = 0;
for (i = 0; i <= b; i++) {
if (e... | replace | 16 | 17 | 16 | 17 | 0 | |
p02316 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N, W, value[101], weight[101], dp[101][10001];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> value[i] >> weight[i];
}
for (int i = 0; i < N; ++i) {
for (int w = 0; w <= W; ++w) {
for (int k = 0; k * weight[i] <= w; ++k) {
... | #include <bits/stdc++.h>
using namespace std;
int N, W, value[101], weight[101], dp[101][10001];
int main() {
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> value[i] >> weight[i];
}
for (int i = 0; i < N; ++i) {
for (int w = 0; w <= W; ++w) {
if (w >= weight[i]) {
dp[i + 1][w] = ma... | replace | 13 | 16 | 13 | 17 | TLE | |
p02316 | C++ | Time Limit Exceeded | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int N, W;
int v[110];
int w[110];
int V[110][10010];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> v[i] >> w[i];
for (int i = 0; i <= N; i++) {
for (int c = 0; c <= W; c++) {
if (i == 0 || c ==... | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int N, W;
int v[110];
int w[110];
int V[110][10010];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> v[i] >> w[i];
for (int i = 0; i <= N; i++) {
for (int c = 0; c <= W; c++) {
if (i == 0 || c ==... | replace | 24 | 31 | 24 | 27 | TLE | |
p02316 | C++ | Runtime Error | /*
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C&lang=jp
*/
#include <iostream>
using namespace std;
int v[1001], w[1001];
int n, k;
int dp[101][10001];
/*
ナップサック
iは品物の番号、jはその時の重さ
*/
void knapsack() {
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= k; j++) {
if (w[i] > j) {
d... | /*
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_C&lang=jp
*/
#include <iostream>
using namespace std;
int v[1001], w[1001];
int n, k;
int dp[101][10001];
/*
ナップサック
iは品物の番号、jはその時の重さ
*/
void knapsack() {
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {
if (w[i] > j) {
dp... | replace | 14 | 15 | 14 | 15 | 0 | |
p02316 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int n, w_max;
int dp[100][10000];
bool f[100][100000];
vector<pair<int, int>> item(101);
int saiki(int i, int j) {
if (f[i][j]) {
return dp[i][j];
}
int res;
if (i == n) {
res = 0;
} else if (j < item[i].second) {
re... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int n, w_max;
int dp[101][10001];
bool f[101][100001];
vector<pair<int, int>> item(101);
int saiki(int i, int j) {
if (f[i][j]) {
return dp[i][j];
}
int res;
if (i == n) {
res = 0;
} else if (j < item[i].second) {
re... | replace | 7 | 9 | 7 | 9 | 0 | |
p02316 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
int dp[1001]{};
for (int c = 0; c < a; c++) {
int d, e;
cin >> d >> e;
for (int f = e; f <= b; f++) {
dp[f] = max(dp[f], ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
int dp[10001]{};
for (int c = 0; c < a; c++) {
int d, e;
cin >> d >> e;
for (int f = e; f <= b; f++) {
dp[f] = max(dp[f],... | replace | 11 | 12 | 11 | 12 | 0 | |
p02316 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
using namespace std;
int value[100], weight[100];
int table[101][10001] = {};
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; ++i) {
cin >> value[i] >> weight[i];
}
for (int i = 1; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
table[i][w] =... | #include <iomanip>
#include <iostream>
using namespace std;
int value[100], weight[100];
int table[101][10001] = {};
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; ++i) {
cin >> value[i] >> weight[i];
}
for (int i = 1; i <= N; ++i) {
for (int w = 0; w <= W; ++w) {
if (w >= weig... | replace | 17 | 22 | 17 | 22 | TLE | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
int dp[101][10001];
int main() {
int n, w;
scanf("%d %d\n", &n, &w);
int val[n], wei[n];
for (int i = 1; i <= n; i++) {
scanf("%d %d\n", &val[i], &wei[i]);
}
// init. dp table
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= w; j++) {... | #include <algorithm>
#include <cstdio>
int dp[101][10001];
int main() {
int n, w;
scanf("%d %d\n", &n, &w);
int val[n], wei[n];
for (int i = 1; i <= n; i++) {
scanf("%d %d\n", &val[i], &wei[i]);
}
// init. dp table
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= w; j++) {... | replace | 23 | 32 | 23 | 24 | TLE | |
p02316 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int item[101][2];
item[0][0] = 0;
item[0][1] = 0;
for (int i = 1; i < N + 1; ++i) {
int v, w;
cin >> v >> w;
item[i][0] = v;
item[i][1] = w;
}
int c[101][10001];
for (int i = 0; i < W + 1; i++) {
c[0][... | #include <iostream>
using namespace std;
int main() {
int N, W;
cin >> N >> W;
int item[101][2];
item[0][0] = 0;
item[0][1] = 0;
for (int i = 1; i < N + 1; ++i) {
int v, w;
cin >> v >> w;
item[i][0] = v;
item[i][1] = w;
}
int c[101][10001];
for (int i = 0; i < W + 1; i++) {
c[0][... | replace | 30 | 38 | 30 | 31 | TLE | |
p02316 | C++ | Runtime Error | #include <iostream>
using namespace std;
int val[110], weight[10010];
int res[110][10010];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> val[i] >> weight[i];
}
// res[number][weight]
for (int i = 0; i < N + 1; i++) {
res[i][0] = 0;
}
for (int i = 0; i < W + 1; i... | #include <iostream>
using namespace std;
int val[110], weight[10010];
int res[110][10010];
int main() {
int N, W;
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> val[i] >> weight[i];
}
// res[number][weight]
for (int i = 0; i < N + 1; i++) {
res[i][0] = 0;
}
for (int i = 0; i < W + 1; i... | replace | 31 | 40 | 31 | 32 | -11 | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, ws;
cin >> n >> ws;
int v[n + 1], w[n + 1];
for (int i = 1; i <= n; i++)
cin >> v[i] >> w[i];
int dp[n + 1][ws + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= ws; j++)
dp[i][j] = 0;... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, ws;
cin >> n >> ws;
int v[n + 1], w[n + 1];
for (int i = 1; i <= n; i++)
cin >> v[i] >> w[i];
int dp[n + 1][ws + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= ws; j++)
dp[i][j] = 0;... | replace | 20 | 25 | 20 | 24 | TLE | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int ui;
// using ui = unsigned int;
int main(void) {
string line;
ui max_n, max_w;
cin >> max_n >> max_w;
ui v, w;
vector<ui> table(max_w + 1, 0);
for (int i = 1; i <= max_n; ++i) {
cin... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int ui;
// using ui = unsigned int;
int main(void) {
string line;
ui max_n, max_w;
cin >> max_n >> max_w;
ui v, w;
vector<ui> table(max_w + 1, 0);
for (int i = 1; i <= max_n; ++i) {
cin... | replace | 19 | 27 | 19 | 24 | TLE | |
p02316 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> int_pair;
typedef pair<ll, ll> ll_pair;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
const int N = 100;
const int W = 10000;
int n, w, v[N], wi[N];
int dp[N + 1][W + 1];
int rec(int i, int j) {
if (dp[i][j] != -1) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> int_pair;
typedef pair<ll, ll> ll_pair;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
const int N = 100;
const int W = 10000;
int n, w, v[N], wi[N];
int dp[N + 1][W + 1];
int rec(int i, int j) {
if (dp[i][j] != -1) {
... | replace | 22 | 31 | 22 | 23 | TLE | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long calc(int i, int c, const vector<int> &v, const vector<int> &w,
vector<vector<long long>> &ans) {
if (i <= -1 || c < 0) {
return 0;
} else if (c == 0) {
ans[i][c] = 0;
} else if (ans[i][c] >= 0) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long calc(int i, int c, const vector<int> &v, const vector<int> &w,
vector<vector<long long>> &ans) {
if (i <= -1 || c < 0) {
return 0;
} else if (c == 0) {
ans[i][c] = 0;
} else if (ans[i][c] >= 0) {
... | replace | 16 | 23 | 16 | 27 | TLE | |
p02316 | C++ | Runtime Error | #include <stdio.h>
int dp[10100];
int main(void) {
int n, w;
scanf("%d %d", &n, &w);
int i, j;
for (i = 0; i <= w; i++) {
dp[i] = -1;
}
dp[0] = 0;
for (i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
for (j = 0; j <= w; j++) {
if (dp[j] >= 0 && dp[j + b] < dp[j] + a && j + b <... | #include <stdio.h>
int dp[20100];
int main(void) {
int n, w;
scanf("%d %d", &n, &w);
int i, j;
for (i = 0; i <= w; i++) {
dp[i] = -1;
}
dp[0] = 0;
for (i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
for (j = 0; j <= w; j++) {
if (dp[j] >= 0 && dp[j + b] < dp[j] + a && j + b <... | replace | 1 | 2 | 1 | 2 | 0 | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | #include <algorithm>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i <... | replace | 46 | 57 | 46 | 51 | TLE | |
p02316 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n, w;
struct {
int v, w;
} item[1... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n, w;
struct {
int v, w;
} item[1... | replace | 25 | 27 | 25 | 27 | 0 | |
p02316 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
#define REP(var, count) for (int var = 0; var < count; var++)
int DP[110][10010]; // N???????????§????????????????¨?w
int main(void) {
int N, W;
cin >> N >> W;
REP(i, N) {
int v, w;
cin >> v >> w;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
#define REP(var, count) for (int var = 0; var < count; var++)
int DP[110][10010]; // N???????????§????????????????¨?w
int main(void) {
int N, W;
cin >> N >> W;
REP(i, N) {
int v, w;
cin >> v >> w;
... | replace | 21 | 24 | 21 | 26 | TLE | |
p02316 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, ... | replace | 20 | 21 | 20 | 21 | 0 | |
p02317 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int b[10001];
int main() {
int n, temp;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
a.push_back(temp);
}
fill(b, b + n, 1 << 30);
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int b[100001];
int main() {
int n, temp;
vector<int> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
a.push_back(temp);
}
fill(b, b + n, 1 << 30);
for (int i = 0; i < n; i++)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02317 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 100010
int n, dat[2 * (MAX_N)-1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 0;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = ma... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 1000100
int n, dat[2 * (MAX_N)-1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 0;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = m... | replace | 2 | 3 | 2 | 3 | 0 | |
p02317 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 30, Array = 0x1e6;
int main() {
int n;
int seq[Array], dp[Array];
scanf("%d", &n);
fill(dp, dp + n, INF);
for ... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <vector>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 30, Array = int(1e5);
int main() {
int n;
int seq[Array], dp[Array];
scanf("%d", &n);
fill(dp, dp + n, INF);
f... | replace | 9 | 10 | 9 | 10 | 0 | |
p02317 | C++ | Runtime Error | #include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long i64;
int CeilIndex(const vector<i64> &tail, int l, int r, i64 key) {
while (r - l > 1) {
int m = (l + r) / 2;
if (tail[m] >= key)
r = m;
else
l = m;
}
return r;
}
vector<i64> LIS(const vector<i64... | #include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long i64;
int CeilIndex(const vector<i64> &tail, int l, int r, i64 key) {
while (r - l > 1) {
int m = (l + r) / 2;
if (tail[m] >= key)
r = m;
else
l = m;
}
return r;
}
vector<i64> LIS(const vector<i64... | replace | 27 | 28 | 27 | 28 | 0 | |
p02317 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1, -1);
int l = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (v[l] < a) {
v[l + 1] = a;
l++;
} else {
*lower_bound(v.begin(), v.end(), a) = a;
}
}
cout << l << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1, -1);
int l = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (v[l] < a) {
v[l + 1] = a;
l++;
} else {
*lower_bound(v.begin(), v.begin() + l, a) = a;
}
}
cout << l <... | replace | 16 | 17 | 16 | 17 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02317 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<long long int> dp(N + 1, LLONG_MAX / 6);
dp[0] = LLONG_MIN;
for (size_t i = 0; i < N; i++) {
long long int a;
cin >> a;
for (size_t j = 0; j < N; j++) {
if (dp[j] < a) {
dp[j + 1] = min(dp[j... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<long long int> dp(N + 1, LLONG_MAX / 6);
dp[0] = LLONG_MIN;
for (size_t i = 0; i < N; i++) {
long long int a;
cin >> a;
for (size_t j = lower_bound(dp.begin(), dp.end(), a) - dp.begin() - 1;
j < ... | replace | 11 | 12 | 11 | 13 | TLE | |
p02317 | C++ | Runtime Error | #include <iostream>
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 MAX 100000
#define INF 1000000001
int a[MAX];
int l[MAX];
int main() {
int n;
cin >> n;
REP(i, n) {
cin >> a[i];
l[i] = INF;
}
int length = 0;
l[leng... | #include <iostream>
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 MAX 100000
#define INF 1000000001
int a[MAX];
int l[MAX];
int main() {
int n;
cin >> n;
REP(i, n) {
cin >> a[i];
l[i] = INF;
}
int length = 0;
l[leng... | replace | 24 | 29 | 24 | 30 | 0 | |
p02317 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF 1e9
int main(void) {
int n, input;
cin >> n;
vector<int> dp(n + 1, INF);
dp[0] = -INF;
for (int i = 0; i < n; i++) {
cin >> input;
vector<int>::iterator it = upper_bound(dp.begin(), dp.end(), input);
if... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define INF 1e9
int main(void) {
int n, input;
cin >> n;
vector<int> dp(n + 2, INF);
dp[0] = -INF;
for (int i = 0; i < n; i++) {
cin >> input;
vector<int>::iterator it = upper_bound(dp.begin(), dp.end(), input);
if... | replace | 11 | 12 | 11 | 12 | 0 | |
p02317 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int N, a[100000];
in... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int N, a[100000];
in... | replace | 20 | 27 | 20 | 23 | TLE | |
p02318 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int L[1000][1000];
int main() {
string a, b;
cin >> a;
cin >> b;
for (int i = 0; i <= a.size(); ++i)
L[i][0] = i;
for (int i = 0; i <= b.size(); ++i)
L[0][i] = i;
for (int i = 1; i <= a.size(); ++i) {
for (int j = 1; j <= b.size(); ++j... | #include <iostream>
#include <string>
using namespace std;
int L[1001][1001];
int main() {
string a, b;
cin >> a;
cin >> b;
for (int i = 0; i <= a.size(); ++i)
L[i][0] = i;
for (int i = 0; i <= b.size(); ++i)
L[0][i] = i;
for (int i = 1; i <= a.size(); ++i) {
for (int j = 1; j <= b.size(); ++j... | replace | 3 | 4 | 3 | 4 | 0 | |
p02318 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[1000][1000]; // minimum edit distance
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s1;
string s2;
cin >> s1;
cin >> s2;
// init. dp table
for (int i = 0; i <= s1.length(); i++) {
dp[i][0] = i;... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int dp[1001][1001]; // minimum edit distance
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s1;
string s2;
cin >> s1;
cin >> s2;
// init. dp table
for (int i = 0; i <= s1.length(); i++) {
dp[i][0] = i;... | replace | 6 | 7 | 6 | 7 | 0 | |
p02318 | C++ | Runtime Error | class _in {
struct my_iterator {
int it;
const bool rev;
explicit constexpr my_iterator(int it_, bool rev = false)
: it(it_), rev(rev) {}
constexpr int operator*() { return it; }
constexpr bool operator!=(my_iterator &r) { return it != r.it; }
void operator++() { rev ? --it : ++it; }
... | class _in {
struct my_iterator {
int it;
const bool rev;
explicit constexpr my_iterator(int it_, bool rev = false)
: it(it_), rev(rev) {}
constexpr int operator*() { return it; }
constexpr bool operator!=(my_iterator &r) { return it != r.it; }
void operator++() { rev ? --it : ++it; }
... | replace | 29 | 30 | 29 | 30 | 0 | |
p02318 | C++ | Runtime Error | #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 | 56 | 58 | 56 | 58 | 0 | |
p02318 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int A[1000][1000];
int main() {
string s1, s2;
cin >> s1;
cin >> s2;
for (int i = 0; i <= s1.size(); ++i) {
for (int j = 0; j <= s2.size(); ++j) {
if (i == 0) {
A[0][j] = j;
continue;
}
if (j == 0) {
A[i]... | #include <iostream>
#include <string>
using namespace std;
int A[1001][1001];
int main() {
string s1, s2;
cin >> s1;
cin >> s2;
for (int i = 0; i <= s1.size(); ++i) {
for (int j = 0; j <= s2.size(); ++j) {
if (i == 0) {
A[0][j] = j;
continue;
}
if (j == 0) {
A[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02318 | C++ | Runtime Error | #include <iostream>
int main() { return 2; }
| #include <iostream>
#include <string>
int main() {
int i, j;
std::string x, y;
int a[1001][1001];
int knum;
for (i = 0; i < 1001; i++) {
for (j = 0; j < 1001; j++) {
if (j == 0)
a[i][j] = i;
else if (i == 0)
a[i][j] = j;
else
a[i][j] = 0;
}
}
std::cin >> ... | replace | 1 | 2 | 1 | 49 | 2 | |
p02318 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define inf 1999999999
#define pa pair<int, int>
using namespace std;
int main() {
// cout<<"1"<<endl;
string s, t;
cin >> s >> t;
int ls = s... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define inf 1999999999
#define pa pair<int, int>
using namespace std;
int main() {
// cout<<"1"<<endl;
string s, t;
cin >> s >> t;
int ls = s... | replace | 21 | 22 | 21 | 22 | 0 | |
p02318 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
int a = A.length(), b = B.length();
vector<vector<int>> Dist(a + 1, vector<int>(b, 0));
for (int i = 0; i <= a; i++)
Dist[i][0] = i;
for (int i = 0; i <= b; i++)
Dist[0][i] = i;
for (int i = 0; i < a; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B;
cin >> A >> B;
int a = A.length(), b = B.length();
vector<vector<int>> Dist(a + 1, vector<int>(b + 1, 0));
for (int i = 0; i <= a; i++)
Dist[i][0] = i;
for (int i = 0; i <= b; i++)
Dist[0][i] = i;
for (int i = 0; i < a; i++) ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02318 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int dist[1000][1000];
for (int i = 0; i <= s1.size(); ++i) {
for (int j = 0; j <= s2.size(); ++j) {
if (i == 0) {
dist[i][j] = j;
} else if (j == 0) {
dist[i][j] = i;
}... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int dist[1001][1001];
for (int i = 0; i <= s1.size(); ++i) {
for (int j = 0; j <= s2.size(); ++j) {
if (i == 0) {
dist[i][j] = j;
} else if (j == 0) {
dist[i][j] = i;
}... | replace | 8 | 9 | 8 | 9 | 0 | |
p02318 | C++ | Time Limit Exceeded | #include <fstream>
#include <iostream>
#include <list>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
const int M = 1003;
const int INIT = (M * M + 1);
int C[M][M]; // = { 0 };
int countmatchstring(const char *p1, const char *p2, int length1, int length2,
... | #include <fstream>
#include <iostream>
#include <list>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
using namespace std;
const int M = 1003;
const int INIT = (M * M + 1);
int C[M][M]; // = { 0 };
int countmatchstring(const char *p1, const char *p2, int length1, int length2,
... | replace | 30 | 32 | 30 | 31 | TLE | |
p02318 | C++ | Runtime Error | /*
* Contents : AOJ DPL 1 E
* Author : KitauraHiromi
* LastUpdate : 20180614
* Since : 20180614
*/
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::f... | /*
* Contents : AOJ DPL 1 E
* Author : KitauraHiromi
* LastUpdate : 20180614
* Since : 20180614
*/
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::f... | replace | 18 | 19 | 18 | 19 | 0 | |
p02318 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
int main() {
std::string str1;
std::string str2;
std::cin >> str1;
std::cin >> str2;
int A[1000][1000] = {0};
for (int i = 0; i <= str1.size(); i++) {
A[i][0] = i;
}
for (int j = 0; j <= str2.size(); j++) {
A[0][j] = ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
int main() {
std::string str1;
std::string str2;
std::cin >> str1;
std::cin >> str2;
int A[1001][1001] = {0};
for (int i = 0; i <= str1.size(); i++) {
A[i][0] = i;
}
for (int j = 0; j <= str2.size(); j++) {
A[0][j] = ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02318 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int min(int a, int b, int c) {
int t = a < b ? a : b;
return t < c ? t : c;
}
int main() {
string s1, s2;
int d[1000][1000];
cin >> s1 >> s2;
int n = s1.length();
int m = s2.length();
if (n == 0) {
return n;
}
if (m ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int min(int a, int b, int c) {
int t = a < b ? a : b;
return t < c ? t : c;
}
int main() {
string s1, s2;
int d[1010][1010];
cin >> s1 >> s2;
int n = s1.length();
int m = s2.length();
if (n == 0) {
return n;
}
if (m ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02319 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
int n, w = 0;
std::cin >> n >> w;
std::vector<std::vector<long>> dp(n + 1, std::vector<long>(n * 100 + 1, 0));
dp[0][0] = 0;
for (int i = 1; i < dp[0].size(); ++i) {
dp[0][i] = LONG_MAX;
}
std::vector<int> iv;
std::vector<long> iw;
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
int main() {
int n, w = 0;
std::cin >> n >> w;
std::vector<std::vector<long>> dp(n + 1, std::vector<long>(n * 100 + 1, 0));
dp[0][0] = 0;
for (int i = 1; i < dp[0].size(); ++i) {
dp[0][i] = 1000000001;
}
std::vector<int> iv;
std::vector<long> iw;
for (int i = 0; i < n; ++... | replace | 8 | 9 | 8 | 9 | -6 | malloc(): corrupted top size
|
p02319 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v/w 高い順
bool comp1(P a, P b) { return a.v * b.w > b.v * a.w; }
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) a.begin(), a.end()
typedef long long ll;
using P = pair<ll, ll>;
#define v first
#define w second
// v/w 高い順
bool comp1(P a, P b) { return a.v * b.w > b.v * a.w; }
// v高い順（vが同じならw軽い方優先）
bool comp(P a, P b)... | replace | 44 | 45 | 44 | 45 | 0 | |
p02320 | C++ | Runtime Error | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, W, v_, w, m, x = 0;
scanf("%d%d", &N, &W);
vector<pair<int, int>> v;
for (; N--;) {
scanf("%d%d%d", &v_, &w, &m);
for (int i = 1; i < m; m -= i, i *= 2)
v.emplace_back(v_ * i, w * i);
if (m)
v.emplace_back(v_ *... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, W, v_, w, m, x = 0;
scanf("%d%d", &N, &W);
vector<pair<int, int>> v;
for (; N--;) {
scanf("%d%d%d", &v_, &w, &m);
for (int i = 1; i < m; m -= i, i *= 2)
v.emplace_back(v_ * i, w * i);
if (m)
v.emplace_back(v_ *... | insert | 19 | 19 | 19 | 21 | -6 | double free or corruption (out)
|
p02320 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = INT_MAX / 3;
void slidingMinimum(vector<int> &inputList, vector<int> &outputList,
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int INF = INT_MAX / 3;
void slidingMinimum(vector<int> &inputList, vector<int> &outputList,
... | replace | 46 | 47 | 46 | 47 | 0 | |
p02320 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; ... | replace | 43 | 45 | 43 | 44 | 0 | v 0 4 4 2 1 2 1 3 3
w 0 3 3 1 2 4 2 2 2
|
p02323 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <string.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define max3(A, B, C) max((A), max((B), (C)))
#define lb lower_bound
#define ub upper_bound
using namespace std;
const int N = 16;
const int INF = 0x3f3f3f3f;
int pd[1 << N][N][N];... | #include <bits/stdc++.h>
#include <cmath>
#include <string.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define max3(A, B, C) max((A), max((B), (C)))
#define lb lower_bound
#define ub upper_bound
using namespace std;
const int N = 15;
const int INF = 0x3f3f3f3f;
int pd[1 << N][N][N];... | replace | 13 | 14 | 13 | 14 | MLE | |
p02323 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int v, n, dis[15][15];
int dp[(1 << 15)][15];
const int INF = 100000000;
int main() {
cin >> v >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
dis[i][j] = INF;
for (int i = 0; i < (1 << v); i++)
for (int j = 0; j < v; j++... | #include <algorithm>
#include <iostream>
using namespace std;
int v, n, dis[15][15];
int dp[(1 << 15)][15];
const int INF = 100000000;
int main() {
cin >> v >> n;
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
dis[i][j] = INF;
for (int i = 0; i < (1 << v); i++)
for (int j = 0; j < v; j++... | replace | 11 | 13 | 11 | 13 | 0 | |
p02323 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
const int V_MAX = 15;
const int INF = 10000000;
int n, e;
int g[V_MAX][V_MAX];
int dp[1 << V_MAX][V_MAX];
int tsp(int visited, int v) {
if (dp[visited][v] != -1)
return dp[visited][v];
if (visited == (1 << n) - 1 && v == 0)
return 0;
int re... | #include <algorithm>
#include <cstdio>
using namespace std;
const int V_MAX = 15;
const int INF = 10000000;
int n, e;
int g[V_MAX][V_MAX];
int dp[1 << V_MAX][V_MAX];
int tsp(int visited, int v) {
if (dp[visited][v] != -1)
return dp[visited][v];
if (visited == (1 << n) - 1 && v == 0)
return 0;
int re... | replace | 25 | 26 | 25 | 26 | TLE | |
p02323 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 200005
#define MAX_N 15
#define INF 10000005
using namespace std;
typedef long long int ll;
typedef pair<in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 200005
#define MAX_N 16
#define INF 10000005
using namespace std;
typedef long long int ll;
typedef pair<in... | replace | 12 | 13 | 12 | 13 | 0 | |
p02323 | C++ | Time Limit Exceeded | // suhan lee,saitama university
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <q... | // suhan lee,saitama university
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <q... | replace | 83 | 84 | 83 | 84 | TLE | |
p02323 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 987654321;
int n, m;
vector<vector<int>> G;
vector<vector<int>> dp;
int rec(int visited, int now) {
if (dp[visited][now] != -1)
return dp[visited][now];
if (visited == (1 << n) - 1 && now == 0)
return dp[visite... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 987654321;
int n, m;
vector<vector<int>> G;
vector<vector<int>> dp;
int rec(int visited, int now) {
if (dp[visited][now] != -1)
return dp[visited][now];
if (visited == (1 << n) - 1 && now == 0)
return dp[visite... | replace | 26 | 27 | 26 | 27 | 0 | |
p02323 | C++ | Time Limit Exceeded | /*
f(v, v', k):- min f(v, v',k - 1) + e(v, v'),
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const int mxv = 16;
int V, E;
int adj[mxv][mxv], dp[(1 << mxv)][mxv], a, b, c;
int tsp(int v, int bitmask) {
if (bitmask == (1 << V) - 1)
return adj[v][0];
if (dp[bitmask... | /*
f(v, v', k):- min f(v, v',k - 1) + e(v, v'),
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) - 1;
const int mxv = 16;
int V, E;
int adj[mxv][mxv], dp[(1 << mxv)][mxv], a, b, c;
int tsp(int v, int bitmask) {
if (bitmask == (1 << V) - 1)
return adj[v][0];
if (dp[bitmask... | replace | 44 | 46 | 44 | 61 | TLE | |
p02323 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 99999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = a; i >= n; i--)
#define INF 99999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef vector<pii> VP;
int dy[] = {0, 0, 1, ... | replace | 15 | 17 | 15 | 17 | MLE | |
p02323 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------... | replace | 49 | 50 | 49 | 50 | MLE | |
p02323 | C++ | Memory Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include... | #define _CRT_SECURE_NO_WARNINGS 1
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include... | replace | 62 | 63 | 62 | 63 | MLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.