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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03162 | C++ | Time Limit Exceeded | // shan61916
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
... | // shan61916
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
... | insert | 18 | 18 | 18 | 20 | TLE | |
p03162 | C++ | Runtime Error | // 01/06/2020 @ 12:20:00
// *****************************************************************
// *****************************************************************
#include <bits/stdc++.h>
// *****************************************************************
// ***********************************************************... | // 01/06/2020 @ 12:20:00
// *****************************************************************
// *****************************************************************
#include <bits/stdc++.h>
// *****************************************************************
// ***********************************************************... | replace | 40 | 46 | 40 | 46 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
t... | delete | 31 | 35 | 31 | 31 | -11 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[10005], b[10005], c[10005], n;
ll dp[10005][4];
ll solve(ll day, ll activity) {
if (day == n + 1) {
return 0;
}
if (dp[day][activity] != -1) {
return dp[day][activity];
}
if (activity == 1) {
return dp[day][activity] =
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100005], b[100005], c[100005], n;
ll dp[100005][4];
ll solve(ll day, ll activity) {
if (day == n + 1) {
return 0;
}
if (dp[day][activity] != -1) {
return dp[day][activity];
}
if (activity == 1) {
return dp[day][activity] =
... | replace | 4 | 6 | 4 | 6 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | #include <bits/stdc++.h>
#define ll long long
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1... | replace | 28 | 29 | 28 | 29 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dpa[10000], dpb[10000], dpc[10000];
dpa[0] = dpb[0] = dpc[0] = 0;
for (int i = 1; i <= n; i++) {
int a, b, c;
cin >> a >> b >> c;
dpa[i] = a + max(dpb[i - 1], dpc[i - 1]);
dpb[i] = b + max(dpc[i - 1], dpa[i - 1]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dpa[100001], dpb[100001], dpc[100001];
dpa[0] = dpb[0] = dpc[0] = 0;
for (int i = 1; i <= n; i++) {
int a, b, c;
cin >> a >> b >> c;
dpa[i] = a + max(dpb[i - 1], dpc[i - 1]);
dpb[i] = b + max(dpc[i - 1], dpa[i - 1... | replace | 6 | 7 | 6 | 7 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18 + 10;
const ll N = 1e3 + 10;
ll n, x, y, z, pr, mx;
vector<ll> v[N];
ll dp[N][3];
ll func(ll ind, ll pr) {
ll sum = 0;
if (ind == n)
return 0;
if (dp[ind][pr] != -1)
return dp[ind][pr];
if (pr == 0) {
sum += max(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18 + 10;
const ll N = 1e5 + 10;
ll n, x, y, z, pr, mx;
vector<ll> v[N];
ll dp[N][3];
ll func(ll ind, ll pr) {
ll sum = 0;
if (ind == n)
return 0;
if (dp[ind][pr] != -1)
return dp[ind][pr];
if (pr == 0) {
sum += max(... | replace | 4 | 5 | 4 | 5 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
int n, k;
scanf("%d", &n);
vector<int> dp(3, 0);
vector<int> arr(3, 0);
dp[0] = 0;
for (int i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (int j = 0; j < 3; j++)
s... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
const int INF = 1e9 + 5;
#undef int
int main() {
int n, k;
scanf("%d", &n);
vector<int> dp(3, 0);
vector<int> arr(3, 0);
dp[0] = 0;
for (int i = 0; i < n; i++) {
vector<int> new_dp(3, 0);
for (int j = 0; j < 3; j++)
s... | replace | 24 | 25 | 24 | 25 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
map<pair<int, int>, int> m;
int ans;
int solve(vector<vector<int>> &mat, int day, int item) {
if (day >= mat.size()) {
return 0;
}
if (m.find({day, item}) != m.end())
return m[{day, item}];
int temp = 0;
for (int j = 0; j < 3;... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
map<pair<int, int>, int> m;
int ans;
int solve(vector<vector<int>> &mat, int day, int item) {
if (day >= mat.size()) {
return 0;
}
if (m.find({day, item}) != m.end())
return m[{day, item}];
int temp = 0;
for (int j = 0; j < 3;... | delete | 22 | 26 | 22 | 22 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
priority_queue<pll, vector<pll>, greater<pll>> pq;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> a(n + ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pll pair<long long, long long>
#define pdd pair<long double, long double>
#define mp make_pair
#define pb push_back
priority_queue<pll, vector<pll>, greater<pll>> pq;
#define ll long long
int main() {
int n;
cin >> n;
vector<ll> a(n + ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03162 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define loopi(x, y) for (int i = x; i < (y); i++)
#define loopj(x, y) for (int j = x; j < (y); j++)
#define nl cout << "\n";
#define ll long long int
using namespace... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define loopi(x, y) for (int i = x; i < (y); i++)
#define loopj(x, y) for (int j = x; j < (y); j++)
#define nl cout << "\n";
#define ll long long int
using namespace... | replace | 24 | 28 | 24 | 28 | 0 | |
p03162 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <vector>
const long long MOD = 10e9 + 7;
using namespace std;
typedef long long ll;
long long f(long long i) {
long long n = i;
int mul = 1;
while (i / 10 != 0) {
int i1 = i % 10;
int i2 = (i / 10) % 10;
if (i1 == i2) {
n = n - i1 * mul;
}
... | #include <cstdlib>
#include <iostream>
#include <vector>
const long long MOD = 10e9 + 7;
using namespace std;
typedef long long ll;
long long f(long long i) {
long long n = i;
int mul = 1;
while (i / 10 != 0) {
int i1 = i % 10;
int i2 = (i / 10) % 10;
if (i1 == i2) {
n = n - i1 * mul;
}
... | replace | 42 | 45 | 42 | 45 | 0 | |
p03162 | C++ | Runtime Error | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | replace | 78 | 79 | 78 | 79 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | replace | 12 | 13 | 12 | 13 | 0 | |
p03162 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | replace | 32 | 33 | 32 | 33 | TLE | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3], dp[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> arr[i][j];
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = ar... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3], dp[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> arr[i][j];
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = ar... | replace | 5 | 6 | 5 | 6 | 0 | |
p03162 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define... | replace | 53 | 54 | 53 | 54 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPN(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPN(i, n) for (ll i = 0; i < n; i++, cout << "\n")
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi(n) for (int i = 0; i < n; i++)
#define fj(n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = n - 1; i >= 0; i--)
#define chlo(i, a, n) for (int i = a; i < n; i++)
#define vi vector<int>
#define vs vector<string>
#define int long long int
#define all(a) (... | #include <bits/stdc++.h>
using namespace std;
#define fi(n) for (int i = 0; i < n; i++)
#define fj(n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = n - 1; i >= 0; i--)
#define chlo(i, a, n) for (int i = a; i < n; i++)
#define vi vector<int>
#define vs vector<string>
#define int long long int
#define all(a) (... | replace | 44 | 45 | 44 | 45 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T... | replace | 35 | 36 | 35 | 36 | -11 | |
p03162 | C++ | Runtime Error | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
ll int dp[n][n];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++) ... | #include <iostream>
#define ll long long
using namespace std;
int main() {
ll int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++)
cin >> a[i][j];
}
ll int dp[n][3];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++) ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03162 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
int abc[10001][3];
int dp[10001][3];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> abc[i][0] >> abc[i][1] >> abc[i][2];
}
// dp[i][j]:=前日にjを選ぶ時にi日目までに得られる幸福度の最大値
// i日目に...
for (int i = 0; i <= n; i++) {
// 前日にjを選んでいたと... | #include <cmath>
#include <iostream>
using namespace std;
int abc[100001][3];
int dp[100001][3];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> abc[i][0] >> abc[i][1] >> abc[i][2];
}
// dp[i][j]:=前日にjを選ぶ時にi日目までに得られる幸福度の最大値
// i日目に...
for (int i = 0; i <= n; i++) {
// 前日にjを選んでい... | replace | 4 | 6 | 4 | 6 | 0 | |
p03162 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define plxy pair<long long, pll>
#define I... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define plxy pair<long long, pll>
#define I... | replace | 21 | 22 | 21 | 22 | 0 | |
p03162 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define N 100011
using namespace std;
const int INF = -(int)1e17;
int n, arr[N][3], opt[N][3];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
... | #include <bits/stdc++.h>
#define int long long
#define N 100011
using namespace std;
const int INF = -(int)1e17;
int n, arr[N][3], opt[N][3];
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
... | replace | 18 | 19 | 18 | 19 | TLE | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 20000000
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 2000000
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef p... | replace | 3 | 4 | 3 | 4 | -11 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
in... | #include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
in... | replace | 18 | 20 | 18 | 20 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | insert | 27 | 27 | 27 | 30 | -6 | double free or corruption (out)
|
p03162 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | replace | 51 | 52 | 51 | 52 | TLE | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define ll long long
#define N 2 * 10e5
#define precise cout << fixed << setprecision(10)
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma ... | #include <bits/stdc++.h>
#include <iostream>
#define pb push_back
#define mp make_pair
#define ll long long
#define N 2 * 10e5
#define precise cout << fixed << setprecision(10)
#pragma GCC optimize("O0")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma ... | replace | 30 | 31 | 30 | 31 | 0 | |
p03162 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ne(ll ar[], ll br[], ll cr[], ll n, int x, ll p) {
if (p < n - 1) {
if (x == 1)
return max(br[p + 1] + ne(ar, br, cr, n, 2, p + 1),
cr[p + 1] + ne(ar, br, cr, n, 3, p + 1));
else if (x == 2)
return max(ar[p + 1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ne(ll ar[], ll br[], ll cr[], ll n, int x, ll p) {
if (p < n - 1) {
if (x == 1)
return max(br[p + 1] + ne(ar, br, cr, n, 2, p + 1),
cr[p + 1] + ne(ar, br, cr, n, 3, p + 1));
else if (x == 2)
return max(ar[p + 1]... | replace | 28 | 31 | 28 | 38 | TLE | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#define lli long long int
using namespace std;
lli getmax(vector<vector<int>> &h, int i, int prev, int n,
vector<vector<int>> &cache) {
if (i >= n) {
return 0;
}
if (i != 0 && cache[i][prev] != -1) {
return cache[i][prev];
}
... | #include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
#define lli long long int
using namespace std;
lli getmax(vector<vector<int>> &h, int i, int prev, int n,
vector<vector<int>> &cache) {
if (i >= n) {
return 0;
}
if (i != 0 && cache[i][prev] != -1) {
return cache[i][prev];
}
... | replace | 23 | 25 | 23 | 29 | -6 | double free or corruption (out)
|
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PB push_back
#define PPB pop_back
#define MP make_pair
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PB push_back
#define PPB pop_back
#define MP make_pair
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | delete | 19 | 23 | 19 | 19 | -11 | |
p03162 | C++ | Runtime Error | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *
// *
// https://www.geeksforgeeks.org/find-the-point-where-maximum-in... | // *
// *
// * Created By :hozaifa wahid
// * "mai maut ko takia aur kafan ko chadar banakar sota hu"
// *------------------------------------
// * OS : Ubuntu 16.04
// * Language : CPP14
// * Editor : Sublime Text 3
// * C++ compiler : g++
// *
// *
// https://www.geeksforgeeks.org/find-the-point-where-maximum-in... | replace | 72 | 73 | 72 | 73 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define pii pair<int64_t, int64_t>
#define mp make_pair
#define whole(v) begin(v), end(v)
#define print64_t(c, n) \
for (int64_t i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define pii pair<int64_t, int64_t>
#define mp make_pair
#define whole(v) begin(v), end(v)
#define print64_t(c, n) \
for (int64_t i = 0; i < n; i++) ... | replace | 15 | 19 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03162 | C++ | Runtime Error |
// Author Name - Mohammad Shehar Yaar Tausif
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
int main() {
long arr[1000][3], n, i, j, DP[1000][3];
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
DP[0][0] = arr[0][0];
DP[0][1] = arr[0][1];
D... |
// Author Name - Mohammad Shehar Yaar Tausif
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
int main() {
long arr[100000][3], n, i, j, DP[100000][3];
cin >> n;
for (i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
DP[0][0] = arr[0][0];
DP[0][1] = arr[0][1];... | replace | 8 | 9 | 8 | 9 | 0 | |
p03162 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vii vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define S second
#define F first
#define pb push_back
#define inf 1000000
#define Test \
int t, i = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vii vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define S second
#define F first
#define pb push_back
#define inf 1000000
#define Test \
int t, i = 0; ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03162 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define err() cout << "==================================" << endl;
#define errA(A) ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define err() cout << "==================================" << endl;
#define errA(A) ... | replace | 54 | 55 | 54 | 55 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int w[101], v[101];
long long f[101][10001];
int main() {
int n, w1, i, j;
scanf("%d %d", &n, &w1);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= w1; j++) {
if (j < w[i])
f[i][j] = f[i - 1][j... | #include <bits/stdc++.h>
using namespace std;
int w[101], v[101];
long long f[101][100001];
int main() {
int n, w1, i, j;
scanf("%d %d", &n, &w1);
for (i = 1; i <= n; i++)
scanf("%d %d", &w[i], &v[i]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= w1; j++) {
if (j < w[i])
f[i][j] = f[i - 1][... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Memory Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int W;
cin >> W;
vector<int> w(n);
vector<ll> v(n);
rep(i, n) cin >> w[i] >> v[i];
// solve
vector<vector<ll>> dp(n + 100, ve... | #include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int W;
cin >> W;
vector<int> w(n);
vector<ll> v(n);
rep(i, n) cin >> w[i] >> v[i];
// solve
vector<vector<ll>> dp(1000, vecto... | replace | 16 | 17 | 16 | 17 | MLE | |
p03163 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int MAXN = 105;
typedef long long ll;
ll v[MAXN], w[MAXN];
ll dp[MAXN] = {0};
int main() {
int N, M;
ll maxx = 0;
cin >> N >> M;
for (int i = 0; i < N; ++i) {
cin >> v[i] >> w[i];
}
for (int i = 0; i < N; ++i) {
for (int j = M; j >= v[... | #include <cstdio>
#include <iostream>
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
ll v[MAXN], w[MAXN];
ll dp[MAXN] = {0};
int main() {
int N, M;
ll maxx = 0;
cin >> N >> M;
for (int i = 0; i < N; ++i) {
cin >> v[i] >> w[i];
}
for (int i = 0; i < N; ++i) {
for (int j = M; j >... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 50 | 51 | 50 | 51 | 0 | 1e-06
|
p03163 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <unistd.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int n, W;
// DPtable
void show(vector<vector<ll>> &dp, int i) {
printf("\n");
printf(" |");
rep(i, W + 1) printf("%3d", i);
printf("\n");
pr... | #include <cmath>
#include <iostream>
#include <unistd.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int n, W;
// DPtable
void show(vector<vector<ll>> &dp, int i) {
printf("\n");
printf(" |");
rep(i, W + 1) printf("%3d", i);
printf("\n");
pr... | replace | 42 | 43 | 42 | 43 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, W, dp[201][200001];
pair<long long, long long> v[201];
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> v[i].first >> v[i].second;
sort(v + 1, v + 1 + n);
for (int i = 1; i <= W; i++)
dp[i][0] = dp[0][i] = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
long long n, W, dp[201][200001];
pair<long long, long long> v[201];
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> v[i].first >> v[i].second;
sort(v + 1, v + 1 + n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= W; j++) {
if (j <... | delete | 9 | 11 | 9 | 9 | -11 | |
p03163 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long int N, W;
long long int v[108], w[108];
long long int dp[108][10800];
// 大きいほうを返す関数
long long int mx(long long int a, long long int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int main() {
cin >> N >> W;
for (long long int i = 0; i < N; i++... | #include <iostream>
using namespace std;
long long int N, W;
long long int v[108], w[108];
long long int dp[108][108000];
// 大きいほうを返す関数
long long int mx(long long int a, long long int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int main() {
cin >> N >> W;
for (long long int i = 0; i < N; i+... | replace | 6 | 7 | 6 | 7 | 0 | |
p03163 | C++ | Time Limit Exceeded | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | // ABHISHEK AGRAWAL//
// Newbie......You have to be odd to be no. ONE :)//
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fl float
#define lcm(a, b) (a * (b / __gcd(a, b)))
#define vs vector<string>
#define vc vector<char>
#define vll vector<ll>
#define sll set<ll>... | replace | 230 | 236 | 230 | 234 | TLE | |
p03163 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
#define REP(i, start, n) for (int i = start; i < n; ++i)
#define debug(var) \
do { \
std::cout << #var << " : "; ... | #include <iostream>
#include <string>
#include <vector>
#define REP(i, start, n) for (int i = start; i < n; ++i)
#define debug(var) \
do { \
std::cout << #var << " : "; ... | replace | 35 | 36 | 35 | 36 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
// Sol 3A
// forward dp
// enumerating items from beginning (z = 0..N)
// inner loop is looping
// "weights >= the current item weight"
// in descending order
long long dp[10005][105];
long long solve(int N, int W, int *v, int *w) {
//... | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
// Sol 3A
// forward dp
// enumerating items from beginning (z = 0..N)
// inner loop is looping
// "weights >= the current item weight"
// in descending order
long long dp[100005][105];
long long solve(int N, int W, int *v, int *w) {
/... | replace | 11 | 12 | 11 | 12 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int n, W;
vector<ll> w, v;
ll dp[100][(int)1e5 + 1];
int main() {
int t = 1;
// cin >> t ;
while (t--) {
for (int i = 0; i < 100; i++)
for (int j = 0; j <= 1e5; j... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int n, W;
vector<ll> w, v;
ll dp[100][(int)1e5 + 1];
int main() {
int t = 1;
// cin >> t ;
while (t--) {
for (int i = 0; i < 100; i++)
for (int j = 0; j <= 1e5; j... | replace | 38 | 39 | 38 | 42 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long dp[100][100005], vi;
int main() {
int n, w, wi;
cin >> n >> w;
;
for (int i = 0; i < w; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
cin >> wi >> vi;
for (int p = 0; p <= w; p++) {
if (wi <= p)
dp[i][p] = max(dp[i - 1][p]... | #include <bits/stdc++.h>
using namespace std;
long long dp[105][100005], vi;
int main() {
int n, w, wi;
cin >> n >> w;
;
for (int i = 0; i < w; i++)
dp[0][i] = 0;
for (int i = 1; i <= n; i++) {
cin >> wi >> vi;
for (int p = 0; p <= w; p++) {
if (wi <= p)
dp[i][p] = max(dp[i - 1][p]... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n;
cin >> n;
long long w;
cin >> w;
long long *val = new long long[n];
long long *we = new long long[n];
for (int i = 0; i < n; i++) {
cin >> we[i];
cin >> val[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n;
cin >> n;
long long w;
cin >> w;
long long *val = new long long[n];
long long *we = new long long[n];
for (int i = 0; i < n; i++) {
cin >> we[i];
cin >> val[i];
}
... | replace | 18 | 19 | 18 | 19 | -11 | |
p03163 | C++ | Runtime Error | // atcoder knapsack 1
#include <bits/stdc++.h>
#define N_ 101000
using namespace std;
long long D[N_];
int main() {
int a, b, n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
for (int j = W; j >= 0; j--)
D[j + a] = max(D[j + a], D[j] + b);
}
long long r = 0;
for (int i = 0; ... | // atcoder knapsack 1
#include <bits/stdc++.h>
#define N_ 101000000
using namespace std;
long long D[N_];
int main() {
int a, b, n, W;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> a >> b;
for (int j = W; j >= 0; j--)
D[j + a] = max(D[j + a], D[j] + b);
}
long long r = 0;
for (int i = ... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define... | replace | 75 | 76 | 75 | 76 | 0 | |
p03163 | C++ | Runtime Error | // #Sazaの1日1AC
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
const long long INF = 1e16;
// マクロ
// 型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vP = vector<pair<long long, long long>>;... | // #Sazaの1日1AC
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
const long long INF = 1e16;
// マクロ
// 型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vP = vector<pair<long long, long long>>;... | replace | 156 | 157 | 156 | 157 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> ii;
int n, w, v[105], we[105];
long long dp[100005][105];
long long recur(int cap, int i) {
if (i > n)
return 0;
if (cap < we[i])
return recur(cap, i + 1);
else
return max(v[i] + recur(cap - we... | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> ii;
int n, w, v[105], we[105];
long long dp[100005][105];
long long recur(int cap, int i) {
if (i > n)
return 0;
if (cap < we[i])
return recur(cap, i + 1);
else
return max(v[i] + recur(cap - we... | replace | 24 | 25 | 24 | 37 | TLE | |
p03163 | C++ | Runtime Error | #include <iostream>
using namespace std;
pair<long long int, long long int> p[105];
long long int dp[100005];
int main() {
long long int n, w;
cin >> n >> w;
for (long long int i = 0; i < n; i++) {
long long int w1, v1;
cin >> w1 >> v1;
p[i] = make_pair(w1, v1);
}
for (long long int i = 0; i < n; ... | #include <iostream>
using namespace std;
pair<long long int, long long int> p[105];
long long int dp[100005];
int main() {
long long int n, w;
cin >> n >> w;
for (long long int i = 0; i < n; i++) {
long long int w1, v1;
cin >> w1 >> v1;
p[i] = make_pair(w1, v1);
}
for (long long int i = 0; i < n; ... | replace | 14 | 16 | 14 | 16 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#defin... | #include <bits/stdc++.h>
using namespace std;
// #define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#defin... | replace | 16 | 17 | 16 | 17 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define pq... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define pq... | replace | 39 | 41 | 39 | 41 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#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, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#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, n) for (int i = m; i < n... | replace | 43 | 44 | 43 | 44 | 0 | |
p03163 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define endl '\n'
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define vii vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#... |
#include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define endl '\n'
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define vii vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#... | replace | 71 | 75 | 71 | 75 | -11 | |
p03163 | C++ | Time Limit Exceeded | /**
* author: Shubham Srivastava
* created: 26 January 2020 00:24:22
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007
#define INF 0x7fffffff
#define sorti(v) sort(v.begin(), v.end())
#define sortd(v) sort(v.rbegin(), v.rend())
typedef pair<ll... | /**
* author: Shubham Srivastava
* created: 26 January 2020 00:24:22
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007
#define INF 0x7fffffff
#define sorti(v) sort(v.begin(), v.end())
#define sortd(v) sort(v.rbegin(), v.rend())
typedef pair<ll... | replace | 18 | 19 | 18 | 19 | TLE | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | replace | 79 | 80 | 79 | 81 | -11 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long dp[101][101];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= w; j++) {
dp[0][j] = 0;
}
for (int i = 1; i <= n; i++) {
int wi;
long lo... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, w;
cin >> n >> w;
long long dp[101][100001];
for (int i = 0; i <= n; i++) {
dp[i][0] = 0;
}
for (int j = 0; j <= w; j++) {
dp[0][j] = 0;
}
for (int i = 1; i <= n; i++) {
int wi;
long... | replace | 10 | 11 | 10 | 11 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define lld long long int
//-4%3=-1
lld n, w;
lld wt[101], val[101], dp[101][101];
lld fun(lld i, lld w) {
if (i <= 0 || w <= 0)
return 0;
if (dp[i][w] == -1) {
... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define lld long long int
//-4%3=-1
lld n, w;
lld wt[101], val[101], dp[101][100001];
lld fun(lld i, lld w) {
if (i <= 0 || w <= 0)
return 0;
if (dp[i][w] == -1) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define maxn 100
#define maxk 10001
using namespace std;
typedef long long LL;
LL ans;
int n, k;
int w[maxn];
int v[maxn];
LL dp[maxk];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++)... | #include <bits/stdc++.h>
#define maxn 100
#define maxk 100001
using namespace std;
typedef long long LL;
LL ans;
int n, k;
int w[maxn];
int v[maxn];
LL dp[maxk];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*
* GUST KEEP GOING
*/
#define endl '\n'
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (in... | #include <bits/stdc++.h>
using namespace std;
/*
* GUST KEEP GOING
*/
#define endl '\n'
#define ll long long
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define rep(i, v) for (int i = 0; i < sz(v); ++i)
#define lp(i, n) for (int i = 0; i < (in... | replace | 67 | 71 | 67 | 71 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define ll long long
#define rep(i, a, b) for (int i = a; i <= b; i++)
void read(int &x) {
x = 0;
int flag = 1;
char ch = ' ';
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = -1;
ch = getchar();
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define ll long long
#define rep(i, a, b) for (int i = a; i <= b; i++)
void read(int &x) {
x = 0;
int flag = 1;
char ch = ' ';
while (ch < '0' || ch > '9') {
if (ch == '-')
flag = -1;
ch = getchar();
... | replace | 36 | 37 | 36 | 37 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) for (auto... | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) for (auto... | replace | 66 | 67 | 66 | 67 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
long long t[100][100000];
using namespace std;
void Knapsack(vector<long long> wt, vector<long long> val, long long w,
long long n) {
if (w == 0 || n == 0) {
return;
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < w + 1; j++) {
if (wt[i - 1] <= j) {... | #include <bits/stdc++.h>
long long t[101][1000001];
using namespace std;
void Knapsack(vector<long long> wt, vector<long long> val, long long w,
long long n) {
if (w == 0 || n == 0) {
return;
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < w + 1; j++) {
if (wt[i - 1] <= j) ... | replace | 2 | 3 | 2 | 3 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
const int N = 3e5 + 5, MOD = 1e9 + 7;
int n, s;
int main() {
#ifndef ONLINE_JUDGE
freopen("tst.txt", "r", stdin);
#endif
scanf("%d %d", &n, &s);
std::vect... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)(x).size()
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ll long long
const int N = 3e5 + 5, MOD = 1e9 + 7;
int n, s;
int main() {
scanf("%d %d", &n, &s);
std::vector<vector<ll>> dp(n, vector<ll>(s + 1));
for (int i = 0; i <... | delete | 11 | 14 | 11 | 11 | -11 | |
p03163 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define clr(v, d) memset(v, d, sizeof(v))
#define fi first
#define se second
#define pp push_back
... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define clr(v, d) memset(v, d, sizeof(v))
#define fi first
#define se second
#define pp push_back
... | replace | 22 | 31 | 22 | 31 | TLE | |
p03163 | C++ | Time Limit Exceeded | // You either die a hero, or you live long enough to see yourself become the
// villain.
/**
* author: Blind_is_love
* created: 12.10.2019, 15:49
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typede... | // You either die a hero, or you live long enough to see yourself become the
// villain.
/**
* author: Blind_is_love
* created: 12.10.2019, 15:49
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typede... | insert | 111 | 111 | 111 | 112 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
ifstream fin("jocul.in");
ofstream fout("jocul.out");
long long n, g;
long long v[105], w[105];
long long dp[100005];
int main() {
long long i, sum = 0, answer = -1;
cin >> n >> g;
for (i = 1; i <= n; i++)
cin >> w[i] >> v[i];
dp[0] = 0;
for (i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
ifstream fin("jocul.in");
ofstream fout("jocul.out");
long long n, g;
long long v[105], w[105];
long long dp[10000005];
int main() {
long long i, sum = 0, answer = -1;
cin >> n >> g;
for (i = 1; i <= n; i++)
cin >> w[i] >> v[i];
dp[0] = 0;
for (i = 1; ... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100;
const int CAP = 1e5 + 10;
int n, cap;
int v[N], w[N];
ll dp[N][CAP];
ll run(int idx, int cur) {
if (dp[idx][cur] != -1)
return dp[idx][cur];
ll res = 0;
if (idx == n or cur == 0)
res = 0;
else if (w[idx] > cur)
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 100 + 10;
const int CAP = 1e5 + 10;
int n, cap;
int v[N], w[N];
ll dp[N][CAP];
ll run(int idx, int cur) {
if (dp[idx][cur] != -1)
return dp[idx][cur];
ll res = 0;
if (idx == n or cur == 0)
res = 0;
else if (w[idx] > cur)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long wt[110], val[110], v[110][110];
int n;
long long w;
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> wt[i] >> val[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++)
v[i][j] = 0;
for (int i = 1; i <= n; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long wt[110], val[110], v[110][110000];
int n;
long long w;
cin >> n >> w;
for (int i = 1; i <= n; i++)
cin >> wt[i] >> val[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= w; j++)
v[i][j] = 0;
for (int i = 1; i <= n; i++... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eps 1e-9
#define PI acos(-1.0)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
const int INF = 1e9 + 5;
bool prime(ll x) {
if (x == 2)
r... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eps 1e-9
#define PI acos(-1.0)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
const int INF = 1e9 + 5;
bool prime(ll x) {
if (x == 2)
r... | delete | 27 | 29 | 27 | 27 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long a[10 + 100][2], b[10 + 100][110] = {0};
long long sol(int n, int i, int j) {
if (i == n - 1) {
long long m = -8;
for (int t = 0; t < 3; t++) {
if (t != j)
m = max(m, a[i][t]);
}
return m;
}
long... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long a[1000 + 100][2], b[10 + 100][100000 + 100] = {0};
long long sol(int n, int i, int j) {
if (i == n - 1) {
long long m = -8;
for (int t = 0; t < 3; t++) {
if (t != j)
m = max(m, a[i][t]);
}
return m;... | replace | 4 | 5 | 4 | 5 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define rep0(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep(i, x, y) for (int i = x; i <= y; i++)
#define reprev1(i, n) for (int i = n; i > 0; i--)
#define reprev0(i, n) for (int i = n - 1; i >= 0; i--)
... | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define rep0(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep(i, x, y) for (int i = x; i <= y; i++)
#define reprev1(i, n) for (int i = n; i > 0; i--)
#define reprev0(i, n) for (int i = n - 1; i >= 0; i--)
... | replace | 43 | 44 | 43 | 45 | TLE | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int n, w;
ll dp[105][105];
ll V[105], W[105];
ll solve(int i, ll p) {
if (i == n || p == 0)
return 0;
if (dp[i][p] != -1)
return dp[i][p];
if (W[i] > p)
return dp[i][p] = solve(i + 1, p);
retur... | #include <algorithm>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
int n, w;
ll dp[105][1000000];
ll V[105], W[105];
ll solve(int i, ll p) {
if (i == n || p == 0)
return 0;
if (dp[i][p] != -1)
return dp[i][p];
if (W[i] > p)
return dp[i][p] = solve(i + 1, p);
r... | replace | 7 | 8 | 7 | 8 | 0 | |
p03163 | C++ | Runtime Error | /******************************************
* AUTHOR : SHUBHAM KUMAR *
* NICK : { "CODECHEF" : "SCHELEON",
"CODEFORCES" : "SCH3130N" } *
* INSTITUTION : BIT MESRA *
******************************************/
#include <bits/stdc++.h>
#define fastio ... | /******************************************
* AUTHOR : SHUBHAM KUMAR *
* NICK : { "CODECHEF" : "SCHELEON",
"CODEFORCES" : "SCH3130N" } *
* INSTITUTION : BIT MESRA *
******************************************/
#include <bits/stdc++.h>
#define fastio ... | replace | 68 | 69 | 68 | 69 | 0 | |
p03163 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define vv vector
#define pp pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define fastio ... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define vv vector
#define pp pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define fastio ... | replace | 91 | 92 | 91 | 92 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
ll n, W, val[105], wt[105], dp[105][105];
int main() {
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
}
for (int i = 0; i <= n; ++i) {
for (int j = 0; ... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define ll long long
#define s second
#define f first
ll n, W, val[105], wt[105], dp[105][100005];
int main() {
cin >> n >> W;
for (int i = 0; i < n; ++i) {
cin >> wt[i] >> val[i];
}
for (int i = 0; i <= n; ++i) {
for (int j = ... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int m... | replace | 23 | 24 | 23 | 24 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03163 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordere... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordere... | replace | 88 | 89 | 88 | 89 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
using LL = long long;
int N, W, w, v;
LL dp[105];
int main() {
scanf("%d%d", &N, &W);
for (int i = 1; i <= N; i++) {
scanf("%d%d", &w, &v);
for (int j = W; j >= w; j--)
dp[j] = max(dp[j], dp[j - w] + v);
}
printf("%lld", dp[W]);
retur... | #include <algorithm>
#include <cstdio>
using namespace std;
using LL = long long;
int N, W, w, v;
LL dp[100005];
int main() {
scanf("%d%d", &N, &W);
for (int i = 1; i <= N; i++) {
scanf("%d%d", &w, &v);
for (int j = W; j >= w; j--)
dp[j] = max(dp[j], dp[j - w] + v);
}
printf("%lld", dp[W]);
re... | replace | 6 | 7 | 6 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 10;
struct node {
int w;
int v;
} in[105];
long long dp[105] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d%d", &in[i].w, &in[i].v);
}
for (int j = 0; j < n; j++) {
for (int i = m; i ... | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 10;
struct node {
int w;
int v;
} in[105];
long long dp[maxx] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d%d", &in[i].w, &in[i].v);
}
for (int j = 0; j < n; j++) {
for (int i = m; i... | replace | 7 | 8 | 7 | 8 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | replace | 20 | 24 | 20 | 22 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, W;
int w[110], v[110];
long long dp[10100];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + 1ll * v[i]);
}
}
... | #include <bits/stdc++.h>
using namespace std;
int n, W;
int w[110], v[110];
long long dp[110000];
int main() {
cin >> n >> W;
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
for (int i = 0; i < n; i++) {
for (int j = W; j >= w[i]; j--) {
dp[j] = max(dp[j], dp[j - w[i]] + 1ll * v[i]);
}
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define frr(i, a, b) for (ll i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define pf ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define frr(i, a, b) for (ll i = (a - 1); i >= (b); i--)
#define vi vector<int>
#define de deque<int>
#define del deque<ll>
#define vl vector<ll>
#define pb push_back
#define ppb pop_back()
#define pf ... | replace | 21 | 22 | 21 | 22 | 0 | |
p03163 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
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;
}
con... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
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;
}
con... | replace | 42 | 43 | 42 | 45 | 0 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iterator>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (long long i = (s); i(n); i++)
#define ll long long
int main() {
int N, W;
cin >> N >> W;
ll dp[101][100001] = {0};
... | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <iterator>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (long long i = (s); i(n); i++)
#define ll long long
int main() {
int N, W;
cin >> N >> W;
ll dp[101][100001] = {0};
... | replace | 16 | 17 | 16 | 17 | -11 | |
p03163 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
long long n, val[100005], w, v, k, mxw, ans;
bool dp[100005];
int main() {
dp[0] = true;
scanf("%lld%lld", &n, &mxw);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &w, &v);
for (int j = mxw; j >= 0; j--) {
if (dp[j]) {... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
long long n, val[100005], w, v, k, mxw, ans;
bool dp[100005];
int main() {
dp[0] = true;
scanf("%lld%lld", &n, &mxw);
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &w, &v);
for (int j = mxw; j >= 0; j--) {
if (dp[j] ==... | replace | 13 | 14 | 13 | 14 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | replace | 116 | 117 | 116 | 119 | 0 | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll i, j, n, m, w, c, ans, p[109], wt[109], dp[100009][109];
map<ll, ll> mp;
ll func(ll w, ll i) {
if (mp[w] == 0)
mp[w] = ++c;
ll x = mp[w];
if (dp[x][i] != -1)
return dp[x][i];
if (i == n)
return 0;
if (w >= wt[i])
dp[x][i] = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll i, j, n, m, w, c, ans, p[109], wt[109], dp[100009][109], mp[100009];
ll func(ll w, ll i) {
if (mp[w] == 0)
mp[w] = ++c;
ll x = mp[w];
if (dp[x][i] != -1)
return dp[x][i];
if (i == n)
return 0;
if (w >= wt[i])
dp[x][i] = max(... | replace | 3 | 5 | 3 | 4 | TLE | |
p03163 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.ti... | replace | 21 | 27 | 21 | 25 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
typedef vector<ll> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pai... | replace | 27 | 28 | 27 | 28 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
typedef long long ll;
typedef vector<long long> vl;
const ll INF = 100000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (long long i = 0; i < (n); i++)
typedef long long ll;
typedef vector<long long> vl;
const ll INF = 100000... | replace | 9 | 10 | 9 | 10 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[101][10001];
int n;
int weight[200001];
int value[200001];
int rec(int idx, int knap) {
if (dp[idx][knap] != -1)
return dp[idx][knap];
if (idx == n)
return 0;
if (knap < 0)
return 0;
// if(knap==0) return 0;
// cout<<max... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[101][100001];
int n;
int weight[200001];
int value[200001];
int rec(int idx, int knap) {
if (dp[idx][knap] != -1)
return dp[idx][knap];
if (idx == n)
return 0;
if (knap < 0)
return 0;
// if(knap==0) return 0;
// cout<<ma... | replace | 3 | 4 | 3 | 4 | 0 | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int wt[105];
int val[105];
int ans[100][100005];
int N, w;
int ks(int n, int c) {
if (ans[n][c] != -1)
return ans[n][c];
if (n == 0 or c == 0)
return 0;
if (wt[n - 1] > c)
return ks(n - 1, c);
int a = ks(n - 1, c);
int b = val[n -... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int wt[105];
int val[105];
int ans[105][100005];
int N, w;
int ks(int n, int c) {
if (ans[n][c] != -1)
return ans[n][c];
if (n == 0 or c == 0)
return 0;
if (wt[n - 1] > c)
return ks(n - 1, c);
int a = ks(n - 1, c);
int b = val[n -... | replace | 5 | 6 | 5 | 6 | 0 | |
p03163 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
vector<int> wei;
vector<int> val;
lli dp[101][100001];
lli knapsack(lli n, lli w) {
if (n == 0 || w == 0)
dp[n][w] = 0;
if (dp[n][w] != -1)
return dp[n][w];
if (wei[n - 1] > w)
return knapsack(n - 1, w);
lli x1 = val[n -... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
vector<int> wei;
vector<int> val;
lli dp[101][100001];
lli knapsack(lli n, lli w) {
if (n == 0 || w == 0)
dp[n][w] = 0;
if (dp[n][w] != -1)
return dp[n][w];
if (wei[n - 1] > w)
return knapsack(n - 1, w);
lli x1 = val[n -... | replace | 23 | 24 | 23 | 25 | TLE | |
p03163 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long dp[105][1000005];
int N, W, w[105], v[105];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 1; i <= W; i++) {
for (int j = 1; j <= N; j++) {
dp[j][i] = max(dp[j - 1][i], dp[j][i]);
if (i - w[j] >... | #include <bits/stdc++.h>
using namespace std;
long long dp[105][1000005];
int N, W, w[105], v[105];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++)
cin >> w[i] >> v[i];
for (int i = 1; i <= W; i++) {
for (int j = 1; j <= N; j++) {
dp[j][i] = max(dp[j - 1][i], dp[j][i]);
if (i - w[j] >... | replace | 17 | 18 | 17 | 18 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.