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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define... | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define... | replace | 39 | 40 | 39 | 40 | 0 | |
p03163 | C++ | Runtime Error | //
// Created by Hideaki Imamura on 2020-03-15.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-15.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | replace | 39 | 40 | 39 | 40 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long W;
cin >> N >> W;
long long v[110], w[110];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
long long dp[110][110];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j - w[i] >= 0)
dp[i + 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long W;
cin >> N >> W;
long long v[110], w[110];
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
long long dp[110][100010];
for (int i = 0; i < N; i++) {
for (int j = 0; j <= W; j++) {
if (j - w[i] >= 0)
dp[i ... | replace | 11 | 12 | 11 | 12 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long int
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define MOD 1000000007
#define pb push_back
#define S s... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long int
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define MOD 1000000007
#define pb push_back
#define S s... | replace | 137 | 142 | 137 | 143 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(ii, ss, ee) for (ll ii = (ss); ii <= (ll)(ee); ++ii)
#define DEC(ii, ss, ee) for (ll ii = (ss); ii >= (ll)(ee); --ii)
#define VALS(args...) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(ii, ss, ee) for (ll ii = (ss); ii <= (ll)(ee); ++ii)
#define DEC(ii, ss, ee) for (ll ii = (ss); ii >= (ll)(ee); --ii)
#define VALS(args...) \
{ ... | replace | 46 | 47 | 46 | 47 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> dp(101, vector<long long>(1e5 + 1, -1));
long long sol(vector<vector<long long>> a, int i, int k) {
int n = a.size();
if (i >= n)
return 0;
if (dp[i][k] != -1)
return dp[i][k];
long long ans = sol(a, i + 1, k);
if (a[i][0] <= k... | #include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> dp(101, vector<long long>(1e5 + 1, -1));
long long sol(vector<vector<long long>> &a, int i, int k) {
int n = a.size();
if (i >= n)
return 0;
if (dp[i][k] != -1)
return dp[i][k];
long long ans = sol(a, i + 1, k);
if (a[i][0] <= ... | replace | 4 | 5 | 4 | 5 | TLE | |
p03163 | C++ | Time Limit Exceeded | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typename A, typename B> string... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
// tourist set
template <typename A, typename B> string... | insert | 142 | 142 | 142 | 144 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long dp[100][100005];
int main() {
int n, w;
long long m[105], v[105];
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> m[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= w; j++) {
if (m[i] <= j) {
dp[i + 1][j] = m... | #include <bits/stdc++.h>
using namespace std;
long long dp[105][100005];
int main() {
int n, w;
long long m[105], v[105];
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> m[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= w; j++) {
if (m[i] <= j) {
dp[i + 1][j] = m... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n, w;
cin >> n >> w;
long long int weight[n + 1], value[n + 1];
for (long long int i = 1; i <= n; i++)
cin >> weight[i] >> value[i];
long long int ans[n + 1][w + 1];
for (long long int i = 0; i <= n; i++)
ans[i][0] = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n, w;
cin >> n >> w;
long long int weight[n + 1], value[n + 1];
for (long long int i = 1; i <= n; i++)
cin >> weight[i] >> value[i];
long long int ans[n + 1][w + 1];
for (long long int i = 0; i <= n; i++)
ans[i][0] = 0;
f... | replace | 23 | 24 | 23 | 24 | 1 | |
p03163 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#define Re register int
int N, W, w[105], v[105];
long long f[10005];
template <typename T> inline void read(T &var) {
T x = 0;
int w = 0;
char ch = 0;
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48),... | #include <iostream>
#include <stdio.h>
#define Re register int
int N, W, w[105], v[105];
long long f[100005];
template <typename T> inline void read(T &var) {
T x = 0;
int w = 0;
char ch = 0;
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48)... | replace | 5 | 6 | 5 | 6 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1000000000
#define MAXN 110
#define MAXW 110
using namespace std;
int N, W;
long long dp[MAXW];
long long v[MAXN];
int w[MAXN];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= N; i++) {
for (int j = W; j >= w[i... | #include <bits/stdc++.h>
#define INF 1000000000
#define MAXN 110
#define MAXW 110000
using namespace std;
int N, W;
long long dp[MAXW];
long long v[MAXN];
int w[MAXN];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> w[i] >> v[i];
}
for (int i = 1; i <= N; i++) {
for (int j = W; j >= ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define peso first
#define beneficio second
int n, m;
vector<pair<int, int>> num(100001);
long long dp[10005];
int main() {
cin >> n >> m;
for (int qq = 1; qq <= n; qq++) {
cin >> num[qq].peso >> num[qq].beneficio;
}
dp[0] = 0;
for (int qq = 1; qq <= n; qq++) ... | #include <bits/stdc++.h>
using namespace std;
#define peso first
#define beneficio second
int n, m;
vector<pair<int, int>> num(100001);
long long dp[100005];
int main() {
cin >> n >> m;
for (int qq = 1; qq <= n; qq++) {
cin >> num[qq].peso >> num[qq].beneficio;
}
dp[0] = 0;
for (int qq = 1; qq <= n; qq++)... | replace | 6 | 7 | 6 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod... | replace | 26 | 27 | 26 | 27 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n, vector<int>(wt + 1));
for (int i = 1; i <= n; i++)
for (int j = 0; j < wt + 1; j+... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, wt;
cin >> n >> wt;
vector<int> w(n + 1), v(n + 1);
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1, vector<int>(wt + 1));
for (int i = 1; i <= n; i++)
for (int j = 0; j < wt + 1... | replace | 9 | 10 | 9 | 10 | -11 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
int n, w;
long long greutate[105] = {0}, cost[105] = {0};
long long matrice[105][105] = {0};
void read() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
greutate[i] = x;
cost[i] = y;
}
}
void... | #include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
int n, w;
long long greutate[1000005] = {0}, cost[1000005] = {0};
long long matrice[105][1000005] = {0};
void read() {
cin >> n >> w;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
greutate[i] = x;
cost[i] = y... | replace | 5 | 7 | 5 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 103;
long long weight[N], value[N], n, w;
long long dp[N][N];
long long solve(long long taille, long long w) {
if (taille < 0)
return 0;
if (dp[taille][w] != -1)
return dp[taille][w];
if (weight[taille - 1] > w)
return dp[taille][w] = solve(... | #include <bits/stdc++.h>
using namespace std;
const int N = 103;
long long weight[N], value[N], n, w;
long long dp[N][100003];
long long solve(long long taille, long long w) {
if (taille < 0)
return 0;
if (dp[taille][w] != -1)
return dp[taille][w];
if (weight[taille - 1] > w)
return dp[taille][w] = s... | replace | 4 | 5 | 4 | 5 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
#define nmax 101
using namespace std;
ifstream fin("p.in");
ofstream fout("p.out");
struct object {
long long val, g;
} obj[nmax];
int n, g_max;
long long sol;
long long val_curr[nmax][nmax * nmax];
int main() {
cin >> n >> g_max;
f... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
#define nmax 101
using namespace std;
ifstream fin("p.in");
ofstream fout("p.out");
struct object {
long long val, g;
} obj[nmax];
int n, g_max;
long long sol;
long long val_curr[nmax][nmax * nmax * 10];
int main() {
cin >> n >> g_max... | replace | 16 | 17 | 16 | 17 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vecto... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vecto... | replace | 35 | 36 | 35 | 36 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define ones(n) __builtin_popcount(n)
#define ONES(n) __builtin_popcountll(n)... | #include <bits/stdc++.h>
// #include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define oo 0x3f3f3f3f
#define OO 0x3f3f3f3f3f3f3f3f
#define ones(n) __builtin_popcount(n)
#define ONES(n) __builtin_popcountll(n)... | replace | 40 | 41 | 40 | 41 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxi = 105;
long long M[maxi][2], dp[maxi][maxi];
long long f(int n, int s) {
if (n < 0 || s <= 0)
return 0;
if (dp[n][s] != -1)
return dp[n][s];
if (s - M[n][0] < 0)
return dp[n][s] = f(n - 1, s);
return dp[n][s] = max(M[n][1] + f(n - 1, s - M... | #include <bits/stdc++.h>
using namespace std;
const int maxi = 1e5 + 10;
long long M[105][2], dp[105][maxi];
long long f(int n, int s) {
if (n < 0 || s <= 0)
return 0;
if (dp[n][s] != -1)
return dp[n][s];
if (s - M[n][0] < 0)
return dp[n][s] = f(n - 1, s);
return dp[n][s] = max(M[n][1] + f(n - 1, s ... | replace | 2 | 4 | 2 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int a[111], wi[111];
long long dp[111111];
bool d[111111];
int main() {
int n, w;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wi[i] >> a[i];
}
d[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = w; j >= 0; j--) {
if (d[j]... | #include <algorithm>
#include <iostream>
using namespace std;
int a[111], wi[111];
long long dp[111111];
bool d[111111];
int main() {
int n, w;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> wi[i] >> a[i];
}
d[0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = w; j >= 0; j--) {
if (d[j]... | replace | 15 | 16 | 15 | 16 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m;
int Wt;
int wt[101];
long long val[101];
long long dp[100][N];
long long maxCost(int n, int W) {
if (n - 1 < 0)
return 0;
if (W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
... | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m;
int Wt;
int wt[101];
long long val[101];
long long dp[101][N];
long long maxCost(int n, int W) {
if (n - 1 < 0)
return 0;
if (W == 0)
return 0;
if (dp[n][W] != -1)
return dp[n][W];
... | replace | 14 | 15 | 14 | 15 | 0 | |
p03163 | C++ | Runtime Error | // In the name of God:)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
long long dp[MAXN], w[MAXN], v[MAXN];
int main() {
long long n, mw;
long long ans = 0;
scanf("%lld%lld", &n, &mw);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", w + i, v + i);
for (int j = mw; j >= w[i]; j--)... | // In the name of God:)
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
long long dp[MAXN], w[MAXN], v[MAXN];
int main() {
long long n, mw;
long long ans = 0;
scanf("%lld%lld", &n, &mw);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", w + i, v + i);
for (int j = mw; j >= w[i];... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <typename T> inline int Chkmin(T &a, T b) {
return a > b ? a... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <typename T> inline int Chkmin(T &a, T b) {
return a > b ? a... | replace | 28 | 29 | 28 | 29 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define y0 y12345
#define y1 y54321
typedef unsigned long ul;
typedef long long ll;
// typedef pair<int, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define y0 y12345
#define y1 y54321
typedef unsigned long ul;
typedef long long ll;
// typedef pair<int, ... | replace | 30 | 31 | 30 | 31 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#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, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll n, W;
ll weight[110], value[110];
ll dp[110][100010];
... | #include <bits/stdc++.h>
#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, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll n, W;
ll weight[110], value[110];
ll dp[110][100010];
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 105, W = 1e5 + 10;
inline char get() {
static char buf[10000], *S = buf, *T = buf;
if (S == T) {
T = (S = b... | #include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int N = 105, W = 1e5 + 10;
inline char get() {
static char buf[10000], *S = buf, *T = buf;
if (S == T) {
T = (S = b... | replace | 12 | 13 | 12 | 13 | 0 | |
p03163 | C++ | Time Limit Exceeded | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make... | replace | 37 | 44 | 37 | 49 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W;
cin >> n >> W;
long long w[n + 1], v[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
long long mat[n + 1][W + 1];
memset(mat, 0, sizeof(mat));
for (long long i = 1; i <= n; i++) {
for (long long j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, W;
cin >> n >> W;
long long w[n + 1], v[n + 1];
for (long long i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
long long mat[n + 1][W + 1];
memset(mat, 0, sizeof(mat));
for (long long i = 1; i <= n; i++) {
for (long long j = ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | replace | 52 | 53 | 52 | 53 | 0 | |
p03163 | C++ | Time Limit Exceeded |
// Problem : E - Knapsack 2
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/... |
// Problem : E - Knapsack 2
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/... | replace | 38 | 40 | 38 | 40 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#defin... | #include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#defin... | replace | 29 | 30 | 29 | 30 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, w;
long a[101][2];
long dp[101][100001];
long solve(int n, int w) { // cout<<n<<" "<<w<<endl;
if (w < 0)
return (-a[n + 1][1] - 1);
if (n == 1) {
if (a[1][0] <= w) {
dp[1][w] = a[1][1];
} else
dp[1][w] = 0; //-a[n+1][1]-1;
return dp[1... | #include <bits/stdc++.h>
using namespace std;
int n, w;
long a[101][2];
long dp[101][100001];
long solve(int n, int w) { // cout<<n<<" "<<w<<endl;
if (w < 0)
return (-a[n + 1][1] - 1);
if (n == 1) {
if (a[1][0] <= w) {
dp[1][w] = a[1][1];
} else
dp[1][w] = 0; //-a[n+1][1]-1;
return dp[1... | insert | 16 | 16 | 16 | 18 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> p;
const int maxn = 100000 + 10;
ll dp[110][maxn];
int n;
vector<p> snacks;
ll dfs(int step, int restSize) {
if (step == n or restSize == 0)
return 0;
if (dp[step][restSize] != -1)
return dp[step][restSize];
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> p;
const int maxn = 100000 + 10;
ll dp[110][maxn];
int n;
vector<p> snacks;
ll dfs(int step, int restSize) {
if (step == n or restSize == 0)
return 0;
if (dp[step][restSize] != -1)
return dp[step][restSize];
l... | replace | 41 | 42 | 41 | 42 | -11 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
int N, G, p[5005], w[5005], a[10005], b[10005], i, j;
int main() {
// ifstream cin("rucsac.in");
cin >> N >> G;
for (i = 1; i <= N; i++) {
cin >> w[i] >> p[i];
}
for (i = 1; i <= N; ++i) {
for (j = 1; j <= G; ++j) {
... | #include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
int N, G, i, j;
long long p[105], w[105], a[100005], b[100005];
int main() {
// ifstream cin("rucsac.in");
cin >> N >> G;
for (i = 1; i <= N; i++) {
cin >> w[i] >> p[i];
}
for (i = 1; i <= N; ++i) {
for (j = 1; j <= G; +... | replace | 5 | 7 | 5 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int num, w;
int wat[100000 + 5];
int val[100000 + 5];
long long dp[1000][1000];
long long knapsack(long long wt, long long n) {
long long &ret = dp[wt][n];
if (wt == 0 || n == 0)
return 0;
if (ret != -1)
return ret;
ret = 0;
if (wat[n - 1] >... | #include <bits/stdc++.h>
using namespace std;
long long int num, w;
int wat[100000 + 5];
int val[100000 + 5];
long long dp[100010][105];
long long knapsack(long long wt, long long n) {
long long &ret = dp[wt][n];
if (wt == 0 || n == 0)
return 0;
if (ret != -1)
return ret;
ret = 0;
if (wat[n - 1] ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 解説AC
int main() {
ll n, w;
cin >> n >> w;
vector<vector<ll>> item(n + 1, vector<ll>(2, 0));
vector<vector<ll>> dp(n + 1, vector<ll>(w, 0));
f... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// 解説AC
int main() {
ll n, w;
cin >> n >> w;
vector<vector<ll>> item(n + 1, vector<ll>(2, 0));
vector<vector<ll>> dp(n + 1, vector<ll>(w + 1, 0));
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long dp[10002], w[102], v[102];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j - w[i] >= 0; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
}
}
l... | #include <bits/stdc++.h>
using namespace std;
long long dp[100002], w[102], v[102];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
for (int i = 0; i < n; i++) {
for (int j = m; j - w[i] >= 0; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
}
}
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int w[105], val[105];
long long dp[10005];
int main() {
int t, m, res = -1;
scanf("%d%d", &m, &t);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &w[i], &val[i]);
}
for (int i = 1; i <= m; i++) {
for (int j = t; j >= 0; j--) {
if (j >= w[i]) {
... | #include <bits/stdc++.h>
using namespace std;
int w[105], val[105];
long long dp[100005];
int main() {
int t, m, res = -1;
scanf("%d%d", &m, &t);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &w[i], &val[i]);
}
for (int i = 1; i <= m; i++) {
for (int j = t; j >= 0; j--) {
if (j >= w[i]) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define ll long long
long long int dp[10005][10005];
// int val[100005];
// int wt[100005];
long long int fun(long long int w, long long int n, long long int val[],
long long int wt[]) {
if (w == 0 || n == 0)
return 0;
if (wt[n - 1] > w)
re... | #include <bits/stdc++.h>
using namespace std;
// #define ll long long
long long int dp[100005][105];
// int val[100005];
// int wt[100005];
long long int fun(long long int w, long long int n, long long int val[],
long long int wt[]) {
if (w == 0 || n == 0)
return 0;
if (wt[n - 1] > w)
ret... | replace | 3 | 4 | 3 | 4 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, w, dp[107];
int main() {
cin >> n >> w;
for (ll i = 0; i < n; ++i) {
ll weight, value;
cin >> weight >> value;
for (ll j = w - weight; j >= 0; --j) {
dp[j + weight] = max(dp[j + weight], dp[j] + value);
}
}
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, w, dp[100007];
int main() {
cin >> n >> w;
for (ll i = 0; i < n; ++i) {
ll weight, value;
cin >> weight >> value;
for (ll j = w - weight; j >= 0; --j) {
dp[j + weight] = max(dp[j + weight], dp[j] + value);
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD int(1e9 + 9)
#define PI 3.1415926535898
using namespace std;
int main(int argc, char const *argv[]) {
ll dp[1001][100001], val[101], w[101], n, W;
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
for (int... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD int(1e9 + 9)
#define PI 3.1415926535898
using namespace std;
int main(int argc, char const *argv[]) {
ll dp[101][100001], val[101], w[101], n, W;
cin >> n >> W;
for (int i = 0; i < n; i++) {
cin >> w[i] >> val[i];
}
for (int ... | replace | 7 | 8 | 7 | 8 | -11 | |
p03163 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <iostream>
#include <memory>
#include <numeric>
#include <array>
#include <deque>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <ostream>
#include <type_traits>
#include <ut... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <memory>
#include <numeric>
#include <array>
#include <deque>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <ostream>
#include <type_traits>
#include <ut... | replace | 49 | 50 | 49 | 50 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5, maxw = 100;
int n, W;
int w[maxn];
int v[maxn];
int dp[maxw][maxn];
int32_t main() {
scanf("%lld%lld", &n, &W);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
}
for (int i = 0; i <= W; i++) {
i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 100 + 10, maxw = 1e5 + 10;
int n, W;
int w[maxn];
int v[maxn];
int dp[maxw][maxn];
int32_t main() {
scanf("%lld%lld", &n, &W);
for (int i = 0; i < n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
}
for (int i = 0; i <= W; i+... | replace | 5 | 6 | 5 | 6 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#i... | replace | 62 | 64 | 62 | 64 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 105, mxW = 1e5 + 5;
int n, W, w[N], v[N];
int dp[N][mxW];
int solve(int wr, int m) {
if (m == 0... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 105, mxW = 1e5 + 5;
int n, W, w[N], v[N];
int dp[N][mxW];
int solve(int wr, int m) {
if (m == 0... | replace | 37 | 38 | 37 | 38 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | replace | 92 | 93 | 92 | 93 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const int nmax = 8;
bool graph[nmax][nmax];
const int INF = 1e9;
vector<vector<ll>> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const int nmax = 8;
bool graph[nmax][nmax];
const int INF = 1e9;
vector<vector<ll>> ... | replace | 49 | 50 | 49 | 50 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Reverse(x) reverse((x).begin(), (x).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i... | replace | 40 | 41 | 40 | 41 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define MOD 1000000007
#define endl "\n"
#define sz(a) (int)((a).size())
#define all(x) (x).begin()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define mp make_pair
#define pu push
#define pp pop_back
#define in insert
#define MOD 1000000007
#define endl "\n"
#define sz(a) (int)((a).size())
#define all(x) (x).begin()... | replace | 50 | 51 | 50 | 51 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, m, n) for (int i = m; i >= n; i--)
#define print(x) cout << (x) << endl;
#define print2(x, y) cout << (x) << " " << (y) << endl;
#define printa(x, n) \
for (int i = 0; ... | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < (n); i++)
#define rrep(i, m, n) for (int i = m; i >= n; i--)
#define print(x) cout << (x) << endl;
#define print2(x, y) cout << (x) << " " << (y) << endl;
#define printa(x, n) \
for (int i = 0; ... | replace | 40 | 41 | 40 | 41 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n;
int peso[1000];
long long int valor[1000];
long long int dp[100][100001];
int calculado[100][100001];
long long int solve(int ind, int aguenta) {
if (ind == n && aguenta >= 0) {
return 0LL;
}
/*if(calculado[ind][aguenta] == true){
return dp[ind][... | #include <bits/stdc++.h>
using namespace std;
int n;
int peso[1000];
long long int valor[1000];
long long int dp[100][100001];
int calculado[100][100001];
long long int solve(int ind, int aguenta) {
if (ind == n && aguenta >= 0) {
return 0LL;
}
if (calculado[ind][aguenta] == true) {
return dp[ind][aguent... | replace | 12 | 15 | 12 | 15 | TLE | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
const long long INF = 1LL << 60;
template <class T = long long> T input() {
T x;
cin >> x;
return x;
}
temp... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define LOCAL 1
#define UPLOAD 2
#define ll long long
const long long INF = 1LL << 60;
template <class T = long long> T input() {
T x;
cin >> x;
return x;
}
temp... | replace | 55 | 56 | 55 | 56 | 0 | |
p03163 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
struct Item {
long long val;
int wgt;
};
long long dp[100][100002];
Item *obj;
long long knapsck(int n, int w) {
if (n == 0 || w < 0)
return 0ll;
if (dp[n][w] != -1)
return dp[n][w];
long long a = -1;
if (w - obj[n - 1].wgt >= 0)
a = ... | #include <cstring>
#include <iostream>
using namespace std;
struct Item {
long long val;
int wgt;
};
long long dp[101][100002];
Item *obj;
long long knapsck(int n, int w) {
if (n == 0 || w < 0)
return 0ll;
if (dp[n][w] != -1)
return dp[n][w];
long long a = -1;
if (w - obj[n - 1].wgt >= 0)
a = ... | replace | 8 | 9 | 8 | 9 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 10005
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, k, w[MAXN], v[MAXN];
LL ans, f[MAXN];
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 100005
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, k, w[MAXN], v[MAXN];
LL ans, f[MAXN];
... | replace | 8 | 9 | 8 | 9 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
for (int i = 1; i <= N; ++i)
cin >> weights[i] >> values[i]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = a; i < b; ++i)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, W;
cin >> N >> W;
vector<ll> weights(N + 1), values(N + 1);
for (int i = 1; i <= N; ++i)
cin >> weights[i] >> values[i]... | replace | 16 | 17 | 16 | 17 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | replace | 33 | 34 | 33 | 35 | 0 | |
p03163 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <limits>
using namespace std;
int imax = std::numeric_limits<int>::max();
long long dp[100][100002], i, j, n, k, w, vi[100], wi[100];
int main() {
// cout<<"P:";
cin >> n >> w;
for (i = 1; i <= n; i++)
cin >> wi[i] >> vi[i];
for (i = 1; i <= n; i++) {
for... | #include <cstdlib>
#include <iostream>
#include <limits>
using namespace std;
int imax = std::numeric_limits<int>::max();
long long dp[101][100002], i, j, n, k, w, vi[101], wi[101];
int main() {
// cout<<"P:";
cin >> n >> w;
for (i = 1; i <= n; i++)
cin >> wi[i] >> vi[i];
for (i = 1; i <= n; i++) {
for... | replace | 5 | 6 | 5 | 6 | 0 | |
p03163 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
// using Matrix = vector< vector<int> >;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 10;
// const ll INF = 1e18 + 10LL;
int dx[5] = {0, 0, 1, -1, 0}, dy[5] = {1, -1, 0, 0, 0};
const double EPS = 1e-10;
bool cmp(P a, P b) {
return a.second < b.s... | #include "bits/stdc++.h"
using namespace std;
// using Matrix = vector< vector<int> >;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9 + 10;
// const ll INF = 1e18 + 10LL;
int dx[5] = {0, 0, 1, -1, 0}, dy[5] = {1, -1, 0, 0, 0};
const double EPS = 1e-10;
bool cmp(P a, P b) {
return a.second < b.s... | replace | 20 | 21 | 20 | 21 | 0 | |
p03163 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// using Matrix = vector< vector<int> >;
typedef long lo... | #include "bits/stdc++.h"
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// using Matrix = vector< vector<int> >;
typedef long lo... | replace | 30 | 31 | 30 | 31 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | replace | 41 | 45 | 41 | 45 | 0 | |
p03163 | C++ | Runtime Error | #include <iostream>
#define ll long long
using namespace std;
int main() {
int n, c;
cin >> n >> c;
ll wt[103], v[103];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> v[i];
}
ll dp[103][103];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= c; j++) {
if (i == 0 || j == 0) {
dp[i][j... | #include <iostream>
#define ll long long
using namespace std;
int main() {
int n, c;
cin >> n >> c;
ll wt[103], v[103];
for (int i = 0; i < n; i++) {
cin >> wt[i] >> v[i];
}
ll dp[103][c + 1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= c; j++) {
if (i == 0 || j == 0) {
dp[i]... | replace | 10 | 11 | 10 | 11 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int w[100], v[100];
int n, W;
long long dp[100][100001];
long long solve(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
long long res;
if (i == n)
res = 0;
else if (j < w[i])
r... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int w[100], v[100];
int n, W;
long long dp[101][100001];
long long solve(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
long long res;
if (i == n)
res = 0;
else if (j < w[i])
r... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define EPS 1e-7
#define LLMAX 9223372036854775807
#... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define EPS 1e-7
#define LLMAX 9223372036854775807
#... | replace | 81 | 85 | 81 | 82 | 0 | |
p03163 | C++ | Runtime Error | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | // R<3S
#include <bits/stdc++.h>
#define hell 1000000007
#define PI 3.14159265358979323844
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define endl "\n"
#define vecmax(v) max_element(all(v)... | replace | 56 | 57 | 56 | 57 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int dp[100][100001];
int v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i + 1] >> v[i + 1];
for (int i = 0; i <= W; i++)
for (int j = 0; j <= n; j++) {
dp[j][i] = -1;
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
long long int dp[101][100001];
int v[101], w[101];
int main() {
int n, W;
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i + 1] >> v[i + 1];
for (int i = 0; i <= W; i++)
for (int j = 0; j <= n; j++) {
dp[j][i] = -1;
if (i == 0 || j == 0)
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e2 + 5;
const int MAXW = 1e5 + 5;
int n, capacidade;
int p[MAXW], v[MAXW];
int memo[MAXN][MAXW];
int solve(int i, int peso) {
if (memo[peso][i] != -1)
return memo[peso][i];
if (i > n || peso ==... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e2 + 5;
const int MAXW = 1e5 + 5;
int n, capacidade;
int p[MAXW], v[MAXW];
int memo[MAXW][MAXN];
int solve(int i, int peso) {
if (memo[peso][i] != -1)
return memo[peso][i];
if (i > n || peso ==... | replace | 11 | 12 | 11 | 12 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int dp[105][10010];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++sum... | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll dp[105][100100];
int main() {
int n, W;
int v[105];
int w[105];
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
rep(i, n) {
for (int sum_w = 0; sum_w <= W; ++sum... | replace | 6 | 7 | 6 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long tab[1008];
pair<long long, long long> p[101];
#define f first
#define s second
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long a, b, n, w;
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> p[i].f >> p[i].s;
}
... | #include <bits/stdc++.h>
using namespace std;
long long tab[100008];
pair<long long, long long> p[101];
#define f first
#define s second
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long a, b, n, w;
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> p[i].f >> p[i].s;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<long long> f(w + 1);
for (int i = 0; i < n; i++) {
int wi, vi;
cin >> wi >> vi;
for (int i = w - wi; i >= 0; i--)
f[i + w] = max(f[i + w], f[i] + vi);
}
cout << f[w] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
vector<long long> f(w + 1);
for (int i = 0; i < n; i++) {
int wi, vi;
cin >> wi >> vi;
for (int j = w - wi; j >= 0; j--)
f[j + wi] = max(f[j + wi], f[j] + vi);
}
cout << f[w] << endl;
return 0;
}
| replace | 9 | 11 | 9 | 11 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double lld;
#define mod 1000000007
#define mod2 998244353
#define fori(n) for (int i = 0; i < n; i++)
#define forj(n) for (int j = 0; j < n; j++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fast ios:... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double lld;
#define mod 1000000007
#define mod2 998244353
#define fori(n) for (int i = 0; i < n; i++)
#define forj(n) for (int j = 0; j < n; j++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fast ios:... | replace | 61 | 65 | 61 | 64 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 50;
using namespace std;
int main()
// int found; found=chaine.find(cara); if (found!=std::string::npos) how to
// verify if a caracter exists in a chaine
// toupper(caractere) ==> return the majuscule of a caractere
// fl... | #include <bits/stdc++.h>
#define ll long long int
const ll mod = 1e9 + 7;
const int maxn = 2e5 + 50;
using namespace std;
int main()
// int found; found=chaine.find(cara); if (found!=std::string::npos) how to
// verify if a caracter exists in a chaine
// toupper(caractere) ==> return the majuscule of a caractere
// fl... | delete | 12 | 16 | 12 | 12 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = 0; i > (int)(n); i--)
#define ALL(v) v.begin(), v.end()
#define INF 2e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = 0; i > (int)(n); i--)
#define ALL(v) v.begin(), v.end()
#define INF 2e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template... | replace | 32 | 33 | 32 | 33 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N, W;
cin >> N >> W;
vector<int> weight(N);
vector<int> value(N);
for (int i = 0; i < N; ++i) {
cin >> weight[i] >> value[i];
}
vector<int64_t> dp(W + 1, 0);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N, W;
cin >> N >> W;
vector<int> weight(N);
vector<int> value(N);
for (int i = 0; i < N; ++i) {
cin >> weight[i] >> value[i];
}
vector<int64_t> dp(W + 1, 0);
for (int i = 0; i ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 1e3 + 5;
void wynik(ll &a, ll b) { a = max(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
ll dp[MAXN];
for (int i = 0; i < n; i++) {
int waga, koszt;
ci... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 200005;
void wynik(ll &a, ll b) { a = max(a, b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, w;
cin >> n >> w;
ll dp[MAXN];
for (int i = 0; i < n; i++) {
int waga, koszt;
cin... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const ll INF = (ll)(1e18);
ll wei[105];
ll val[105];
ll dp[105][105] = {0};
ll knapsack1(ll w, ll i) {
if (i < 0)
return 0;
if (w - wei[i] < 0)
return knapsack1(w, i - 1);
if (dp[w][i] != 0)
return dp[w][i];
dp[w][i] = max(kn... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const ll INF = (ll)(1e18);
ll wei[105];
ll val[105];
ll dp[100005][105] = {0};
ll knapsack1(ll w, ll i) {
if (i < 0)
return 0;
if (w - wei[i] < 0)
return knapsack1(w, i - 1);
if (dp[w][i] != 0)
return dp[w][i];
dp[w][i] = max... | replace | 7 | 8 | 7 | 8 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rloop(i, a, b) for (int i = a; i > b; i--)
#define loopll(i, a, b) for (long long int i = a; i < b; i++)
#define rloopll(i, a, b) for (long long int i = a; i > b; i--)
#define e... | #include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rloop(i, a, b) for (int i = a; i > b; i--)
#define loopll(i, a, b) for (long long int i = a; i < b; i++)
#define rloopll(i, a, b) for (long long int i = a; i > b; i--)
#define e... | replace | 151 | 153 | 151 | 155 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | delete | 315 | 316 | 315 | 315 | TLE | |
p03163 | C++ | Runtime Error | #include <stdio.h>
const int W = 1e5 + 10;
long long int max(long long int a, long long int b) { return a > b ? a : b; }
int main() {
int n, w, p, v;
long long int a[W], ans = 0;
scanf("%d%d", &n, &w);
for (int i = 0; i <= w; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &p, &v);
for ... | #include <stdio.h>
const int W = 1e5 + 10;
long long int max(long long int a, long long int b) { return a > b ? a : b; }
int main() {
int n, w, p, v;
long long int a[W], ans = 0;
scanf("%d%d", &n, &w);
for (int i = 0; i <= w; i++)
a[i] = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d", &p, &v);
for ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03163 | C++ | Runtime Error | // srinivas
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
using namespace std;
#define all(c... | // srinivas
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;
using namespace std;
#define all(c... | replace | 36 | 37 | 36 | 37 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<vector<ll>> dp(100010, vector<ll>(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, W;
cin >> n >> W;
vector<ll> w(n), v(n);
rep(i, n) cin >> w[i] >> v[i];
vector<vector<ll>> dp(110, vector<ll>(100... | replace | 14 | 15 | 14 | 15 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
long long w[N], v[N];
int n, W;
long long f[N];
int main() {
scanf("%d%d", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
f[i] = 0;
}
for (int i = 1; i <= n; i++) {
for (int j = W; j >= w[i]; j--) {
f[j... | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
long long w[N], v[N];
int n, W;
long long f[100010];
int main() {
scanf("%d%d", &n, &W);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
f[i] = 0;
}
for (int i = 1; i <= n; i++) {
for (int j = W; j >= w[i]; j--) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long N;
long long W;
std::vector<long long> w;
std::vector<long long> v;
long long SUM_W;
long long dfs(long long n, long long used_w) {
if (n == N) {
return 0;
}
long long no_used = dfs(n + 1, used_w);
if (used_w + w[n] <= W) {
long long used = dfs(n... | #include <bits/stdc++.h>
using namespace std;
long long N;
long long W;
std::vector<long long> w;
std::vector<long long> v;
long long SUM_W;
long long dfs(long long n, long long used_w) {
if (n == N) {
return 0;
}
long long no_used = dfs(n + 1, used_w);
if (used_w + w[n] <= W) {
long long used = dfs(n... | replace | 23 | 24 | 23 | 24 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
long long f[10010];
int main() {
int n, w;
scanf("%d%d", &n, &w);
// f[i][j]= f[i-1][j] / f[i-1][j-w[i]]+v[i];
for (int i = 0; i < n; ++i) {
int ww, vv;
scanf("%d%d", &ww, ... | #include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
long long f[100010];
int main() {
int n, w;
scanf("%d%d", &n, &w);
// f[i][j]= f[i-1][j] / f[i-1][j-w[i]]+v[i];
for (int i = 0; i < n; ++i) {
int ww, vv;
scanf("%d%d", &ww,... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<long> v(N);
vector<long> w(N);
// dp[i][j] : 商品iまで、重さjまでの価値最大値
vector<vector<long>> dp(N, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
cin >> w.at(i) >> v.at(i);
}
for (int j = 0; j < W + 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, W;
cin >> N >> W;
vector<long> v(N);
vector<long> w(N);
// dp[i][j] : 商品iまで、重さjまでの価値最大値
vector<vector<long>> dp(N, vector<long>(W + 1, 0));
for (int i = 0; i < N; i++) {
cin >> w.at(i) >> v.at(i);
}
for (int j = 0; j < W + 1; ... | delete | 28 | 30 | 28 | 28 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); // cin.tie(NULL); cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
/* BIEN CUC BO BEGIN*/
ll t, n, A[3][102], w;
ll DD[100002], ans;
/* ... | #include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); // cin.tie(NULL); cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
/* BIEN CUC BO BEGIN*/
ll t, n, A[3][102], w;
ll DD[200012], ans;
/* ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define MOD (long long int)1e9 + 7
using namespace std;
typedef long long int ll;
// bool cmp(const pair<int, set<int>> a, const pair<int, set<int>> b) {
// return a.second.size() > b.second.size();
// }
bool cmp(int a, int b) { return a > b; }
// void ... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define MOD (long long int)1e9 + 7
using namespace std;
typedef long long int ll;
// bool cmp(const pair<int, set<int>> a, const pair<int, set<int>> b) {
// return a.second.size() > b.second.size();
// }
bool cmp(int a, int b) { return a > b; }
// void ... | replace | 38 | 39 | 38 | 40 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#if 1
#define int long long
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define stoi stoll
#else
#define MAX INT_MAX
#define MIN INT_MIN
#endif
#define INF MAX / 2
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
const int NIL = -1;
const int MOD = 1000000007;
#def... | #include <bits/stdc++.h>
#if 1
#define int long long
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define stoi stoll
#else
#define MAX INT_MAX
#define MIN INT_MIN
#endif
#define INF MAX / 2
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
const int NIL = -1;
const int MOD = 1000000007;
#def... | replace | 69 | 70 | 69 | 70 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 1e3 + 5;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define fr(i, l, m) for (int i = l; i < m; i++)
#define vii vector<int>
#define vpr vector<pair<ll, ll>>
ll pwr(ll x, ... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 1e5 + 5;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define fr(i, l, m) for (int i = l; i < m; i++)
#define vii vector<int>
#define vpr vector<pair<ll, ll>>
ll pwr(ll x, ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<pair<int, int>> v;
int dp[10000][10000];
v.push_back({0, 0});
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
for (int i = 0; i <= n; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, w;
cin >> n >> w;
vector<pair<int, int>> v;
int dp[103][100003];
v.push_back({0, 0});
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
for (int i = 0; i <= n; i+... | replace | 8 | 9 | 8 | 9 | -11 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100005
#define s second
#define f first
#define ll long long
using namespace std;
pair<int, ll> a[101];
ll dp[101][N];
int main() {
int n, w, j, i;
cin >> n >> w;
for (i = 1; i <= n; ++i)
cin >> a[i].f >> a[i].s;
for (i = 1; i <= n + 1; ++i) {
for (j = 1; j <= w + 1; +... | #include <bits/stdc++.h>
#define N 100005
#define s second
#define f first
#define ll long long
using namespace std;
pair<int, ll> a[105];
ll dp[105][N];
int main() {
int n, w, j, i;
cin >> n >> w;
for (i = 1; i <= n; ++i)
cin >> a[i].f >> a[i].s;
for (i = 1; i <= n + 1; ++i) {
for (j = 1; j <= w + 1; +... | replace | 6 | 8 | 6 | 8 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
int dp[101][100001];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, capacity;
cin >> n >> capacity;
vector<int> wt(n);
vector<int> val(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
... | #include <bits/stdc++.h>
#define int int64_t
using namespace std;
int dp[100001][101];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, capacity;
cin >> n >> capacity;
vector<int> wt(n);
vector<int> val(n);
for (int i = 0; i < n; i++) {
cin >> wt[i] >> val[i];
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
const int MaxW =... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int MOD = 1e9 + 7;
#ifndef HOME
#define cerr \
if (0) \
cerr
#endif
const int MaxW =... | replace | 29 | 30 | 29 | 30 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define maxx 100100
long long dp[100][maxx], peso[maxx], valor[maxx];
int main() {
int n, w;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> valor[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
if (peso[i] <= j... | #include <bits/stdc++.h>
using namespace std;
#define maxx 100100
long long dp[200][maxx], peso[200], valor[200];
int main() {
int n, w;
cin >> n >> w;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> valor[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= w; j++) {
if (peso[i] <= j) ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, W;
vector<long long> w(101), v(101);
vector<vector<long long>> dp(101, vector<long long>(10001, 0));
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> w[i];
cin >> v[i];
}
for (int i = 1; i <= N; i++) {
fo... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, W;
vector<long long> w(101), v(101);
vector<vector<long long>> dp(101, vector<long long>(100001, 0));
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> w[i];
cin >> v[i];
}
for (int i = 1; i <= N; i++) {
f... | replace | 7 | 8 | 7 | 8 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define sanyes \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e5 + 7;
const llong mod... | #include <bits/stdc++.h>
#define sanyes \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e5 + 7;
const llong mod... | replace | 14 | 15 | 14 | 15 | 0 | |
p03163 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int wt[n], val[n];
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
}
long long dp[1009][100009];
for (int i = 0; i < n + 1; ++i) {
for (int j = 0; j < W + 1; ++j) {
if (i == 0 || j == 0) {
dp[i][j... | #include <iostream>
using namespace std;
int main() {
int n, W;
cin >> n >> W;
int wt[n], val[n];
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
}
long long dp[109][100009];
for (int i = 0; i < n + 1; ++i) {
for (int j = 0; j < W + 1; ++j) {
if (i == 0 || j == 0) {
dp[i][j]... | replace | 12 | 13 | 12 | 13 | -11 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> v;
vector<ll> w;
ll knapsack(ll x, ll n, vector<vector<ll>> dp) {
if (x == 0 || n < 0)
return 0;
if (dp[n][x] > 0) {
return dp[n][x];
}
if (w[n] > x) {
dp[n][x] = knapsack(x, n - 1, dp);
} else {
dp[n][x] =
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> v;
vector<ll> w;
ll knapsack(ll x, ll n, vector<vector<ll>> &dp) {
if (x == 0 || n < 0)
return 0;
if (dp[n][x] > 0) {
return dp[n][x];
}
if (w[n] > x) {
dp[n][x] = knapsack(x, n - 1, dp);
} else {
dp[n][x] =
... | replace | 9 | 10 | 9 | 10 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 200;
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
ll n, cap, item, maxis = 0, dp[N], i, j, weight;
cin >> n >> cap;
for (i = 0; i <= cap; ++i)
dp[i] = 0;
for (i = 0; i < n; ++i) {
cin >> weight... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 150000;
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
ll n, cap, item, maxis = 0, dp[N], i, j, weight;
cin >> n >> cap;
for (i = 0; i <= cap; ++i)
dp[i] = 0;
for (i = 0; i < n; ++i) {
cin >> wei... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long int dp[101][12345];
long int A[101][2];
int main() {
int n, w;
scanf("%d %d", &n, &w);
for (int i = 0; i < n; i++)
scanf("%ld %ld", &A[i][0], &A[i][1]);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | #include <bits/stdc++.h>
using namespace std;
long int dp[1000][123456];
long int A[1000][2];
int main() {
int n, w;
scanf("%d %d", &n, &w);
for (int i = 0; i < n; i++)
scanf("%ld %ld", &A[i][0], &A[i][1]);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= w; j++) {
if (i == 0 || j == 0)
... | replace | 4 | 6 | 4 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.