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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N, W;
cin >> N >> W;
vector<long long> weight(N), value(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
sum += value.at(i);
}
long long dp[110][1100];
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N, W;
cin >> N >> W;
vector<long long> weight(N), value(N);
long long sum = 0;
for (int i = 0; i < N; i++) {
cin >> weight.at(i) >> value.at(i);
sum += value.at(i);
}
long long dp[110][sum + 1];
for (int i... | replace | 16 | 17 | 16 | 17 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end();
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... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define s(x) (x).begin(), (x).end();
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... | replace | 31 | 32 | 31 | 32 | -11 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
const long long kInf = (long long)1e13;
int main() {
int n, W;
cin >> n >> W;
vector<long long> w(n), v(n);
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> w... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
const long long kInf = (long long)1e13;
int main() {
int n, W;
cin >> n >> W;
vector<long long> w(n), v(n);
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> w... | replace | 28 | 29 | 28 | 32 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int N, W;
long long int A[MAXN], P[MAXN];
map<long long int, long long int> dp;
deque<pair<long long int, long long int>> buffer;
long long int calcDP() {
for (int i = 0; i < N; i++) {
map<long long int, long long int>::reverse_iterator it = dp... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int N, W;
long long int A[MAXN], P[MAXN];
map<long long int, long long int> dp;
deque<pair<long long int, long long int>> buffer;
long long int calcDP() {
for (int i = 0; i < N; i++) {
map<long long int, long long int>::reverse_iterator it = dp... | insert | 23 | 23 | 23 | 34 | TLE | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n;
long long int w[200], v[200];
long long int dp[200][100006];
long long int sum = 0, W;
long long int knapsack(int i, int v1) {
if (v1 <= 0)
return 0;
if (i == n) {
return INT_MAX;
}
// long long int res1=0,res2=0;
//
// if(dp[i][v1]!=-1)
... | #include <bits/stdc++.h>
using namespace std;
int n;
long long int w[200], v[200];
long long int dp[200][100006];
long long int sum = 0, W;
long long int knapsack(int i, int v1) {
if (v1 <= 0)
return 0;
if (i == n) {
return INT_MAX;
}
// long long int res1=0,res2=0;
//
if (dp[i][v1] != -1)
... | replace | 17 | 19 | 17 | 19 | TLE | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() {... | replace | 42 | 45 | 42 | 43 | TLE | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18L
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(int *arr, int n, int value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
void knapsa... | #include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18L
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(int *arr, int n, int value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
void knapsa... | replace | 17 | 19 | 17 | 22 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[102][1002];
ll n, w;
ll weight[100002], val[100002];
ll solve(ll r, ll idx) {
if (idx == n)
return r == 0 ? 0 : INT_MAX;
if (dp[idx][r] != -1)
return dp[idx][r];
ll ans = solve(r, idx +... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[102][100002];
ll n, w;
ll weight[100002], val[100002];
ll solve(ll r, ll idx) {
if (idx == n)
return r == 0 ? 0 : INT_MAX;
if (dp[idx][r] != -1)
return dp[idx][r];
ll ans = solve(r, idx... | replace | 4 | 5 | 4 | 5 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | delete | 29 | 33 | 29 | 29 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, W;
cin >> n >> W;
vector<int> weight(n), value(n);
for (int i = 0; i < n; cin >> weight[i] >> value[i++])
;
int sum_val = 0;
for (int i : value)
sum_val += i;
vector<int> dp(sum_val + 1, 1e9);
dp[0] =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, W;
cin >> n >> W;
vector<int> weight(n), value(n);
for (int i = 0; i < n; ++i)
cin >> weight[i] >> value[i];
int sum_val = 0;
for (int i : value)
sum_val += i;
vector<int> dp(sum_val + 1, 1e9);
dp[0] ... | replace | 9 | 11 | 9 | 11 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define maxx 100100
long long dp[100][maxx], peso[maxx], valor[maxx];
int main() {
long long w;
int n;
cin >> n >> w;
long long v = 0;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> valor[i];
v += valor[i];
}
for (int i = 0; i <= n; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
#define maxx 100100
long long dp[200][maxx], peso[200], valor[200];
int main() {
long long w;
int n;
cin >> n >> w;
long long v = 0;
for (int i = 1; i <= n; i++) {
cin >> peso[i] >> valor[i];
v += valor[i];
}
for (int i = 0; i <= n; i++) {
for (i... | replace | 3 | 4 | 3 | 4 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
// #pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
// #pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | replace | 42 | 43 | 42 | 43 | 0 | |
p03164 | C++ | Runtime Error | /*author* Priyanshu Shrivastav (from IIT Palakkad) *
* *_ __ ___ _ ______ ___ _ ____ ___ ___| |_ *
* | '_ ` _ \| '__/ __/ _ \| '_ \ \ / / |/ __| __| *
* | | | | | | | | (_| (_) | | | \ V /| | (__| |_ *
* |_| |_| |_|_|(_)___\___/|_| |_|\_/ |_|\___|\__| *
When I wrote this, only God and I understood what I was... | /*author* Priyanshu Shrivastav (from IIT Palakkad) *
* *_ __ ___ _ ______ ___ _ ____ ___ ___| |_ *
* | '_ ` _ \| '__/ __/ _ \| '_ \ \ / / |/ __| __| *
* | | | | | | | | (_| (_) | | | \ V /| | (__| |_ *
* |_| |_| |_|_|(_)___\___/|_| |_|\_/ |_|\___|\__| *
When I wrote this, only God and I understood what I was... | replace | 50 | 51 | 50 | 51 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define _69e27 \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace ... | #include <bits/stdc++.h>
#define ll long long
#define _69e27 \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace ... | insert | 16 | 16 | 16 | 18 | TLE | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long INF = 1000000001, n, k, w[200], c[200], dp[101][100001], ans, sum,
minn = 1000000001;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> c[i];
minn = min(minn, c[i]);
sum += c[i];
}
dp[0][0] = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1000000001, n, k, w[200], c[200], dp[101][100001], ans, sum,
minn = 1000000001;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> c[i];
minn = min(minn, c[i]);
sum += c[i];
}
dp[0][0] = 0;
for (int i = ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03164 | C++ | Runtime Error | // fahadmd16(IIEST Shibpur)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
#... | // fahadmd16(IIEST Shibpur)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define db double
#define pll pair<ll, ll>
#define ALL(a) (a).begin(), (a).end()
#define endl "\n"
#... | replace | 119 | 123 | 119 | 120 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vi vecto... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define vi vecto... | replace | 39 | 43 | 39 | 43 | -11 | |
p03164 | C++ | Time Limit Exceeded | /**Bismillahir Rahmanir Raheem
Author:Refatul Fahad**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define pii pair<int, int>
#define pil pair<int, ll>
#define IOS ... | /**Bismillahir Rahmanir Raheem
Author:Refatul Fahad**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define pii pair<int, int>
#define pil pair<int, ll>
#define IOS ... | replace | 50 | 52 | 50 | 52 | TLE | |
p03164 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const ll MOD = 1000000007;
const long long INF = 1LL << 60;
const double pi = acos(-1.0);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return tru... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const ll MOD = 1000000007;
const long long INF = 1LL << 60;
const double pi = acos(-1.0);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return tru... | insert | 38 | 38 | 38 | 39 | TLE | |
p03164 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define flash \
ios_base::sync_with_stdio(false); ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define flash \
ios_base::sync_with_stdio(false); ... | replace | 47 | 48 | 47 | 48 | 0 | |
p03164 | C++ | Runtime Error | // Author : ZERO_IQ
// Practice is the only shortcut to improve
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x, y) \
cerr << (#x) << " " << (#y) << " is "... | // Author : ZERO_IQ
// Practice is the only shortcut to improve
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x, y) \
cerr << (#x) << " " << (#y) << " is "... | replace | 24 | 28 | 24 | 28 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
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... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
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... | replace | 28 | 29 | 28 | 29 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
const long long inf = 2000000000;
int n, w;
cin >> n >> w;
int cost[n];
int value[n];
const int max_n = 100;
const int max_v ... | #include <algorithm>
#include <array>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
const long long inf = 2000000000;
int n, w;
cin >> n >> w;
long long cost[n];
long long value[n];
const int max_n = 100;
cons... | replace | 15 | 17 | 15 | 17 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
lli v[105], w[105];
lli dp[105][100005] = {};
// i まででjを達成するのに必要なWの最小値
int main() {
lli n, W;
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
lli v[105], w[105];
lli dp[105][100005] = {};
// i まででjを達成するのに必要なWの最小値
int main() {
lli n, W;
cin >> n >> W;
rep(i, n) cin >> w[i] >> v[i];
... | replace | 21 | 22 | 21 | 22 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, W, ans, INF = 1e9 + 1, sum, dp[101][10001];
pair<long long, long long> v[101];
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> v[i].first >> v[i].second, sum += v[i].second;
sort(v + 1, v + 1 + n);
for (int i = 0; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
long long n, W, ans, INF = 1e9 + 1, sum, dp[101][100001];
pair<long long, long long> v[101];
int main() {
cin >> n >> W;
for (int i = 1; i <= n; i++)
cin >> v[i].first >> v[i].second, sum += v[i].second;
sort(v + 1, v + 1 + n);
for (int i = 0; i <= n; i++) {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
typedef long long int ll;
typedef vector<ll> vi;
int main() {
ll n, wt;
cin >> n >> wt;
ll w[n + 5], v[n + 5];
rep(i, 0, n) cin >> w[i] >> v[i];
ll tot = 0;
for (l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
typedef long long int ll;
typedef vector<ll> vi;
int main() {
ll n, wt;
cin >> n >> wt;
ll w[n], v[n];
rep(i, 0, n) cin >> w[i] >> v[i];
ll tot = 0;
for (ll &i : v... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
// #define int long long
#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 mii map<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
// #define int long long
#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 mii map<in... | replace | 37 | 38 | 37 | 38 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | replace | 145 | 146 | 145 | 146 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef PRAGMA
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#define fst first
#define snd second
#define fore(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define mp make_pair
... | #include <bits/stdc++.h>
#ifdef PRAGMA
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#define fst first
#define snd second
#define fore(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define mp make_pair
... | replace | 28 | 29 | 28 | 29 | -11 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long lo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long lo... | replace | 19 | 20 | 19 | 20 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#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)
using namespace std;
using P = pair<int, int>;
using ll = long long;
ll INF = 100100100100100100;
int main() {
// input
int n;
int w;
cin >> n >> w;
vec... | #include <bits/stdc++.h>
#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)
using namespace std;
using P = pair<int, int>;
using ll = long long;
ll INF = 100100100100100100;
int main() {
// input
int n;
int w;
cin >> n >> w;
vec... | replace | 34 | 35 | 34 | 35 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i... | replace | 39 | 40 | 39 | 40 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100
#define V 1000
int v[N + 1], w[N + 1], dp[2][N * V + 1], Sum[N + 1];
signed main() {
int n, m, i;
scanf("%lld%lld", &n, &m);
for (i = 1; i <= n; i++)
scanf("%lld%lld", w + i, v + i), Sum[i] = Sum[i - 1] + v[i];
memset(dp, 0x3f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100
#define V 1000
int v[N + 1], w[N + 1], dp[2][N * V + 1], Sum[N + 1];
signed main() {
int n, m, i;
scanf("%lld%lld", &n, &m);
for (i = 1; i <= n; i++)
scanf("%lld%lld", w + i, v + i), Sum[i] = Sum[i - 1] + v[i];
memset(dp, 0x3f... | replace | 15 | 16 | 15 | 18 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define smax(a, b) ((a) < (b) ? ((a) = (b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a) = (b), true) : false)
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
typedef long long ll;
const ll MAX = 1e18;
ll n, w;
ll item[100][2];
ll dp[100][100001... | #include <bits/stdc++.h>
#define smax(a, b) ((a) < (b) ? ((a) = (b), true) : false)
#define smin(a, b) ((a) > (b) ? ((a) = (b), true) : false)
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using namespace std;
typedef long long ll;
const ll MAX = 1e18;
ll n, w;
ll item[101][2];
ll dp[101][100001... | replace | 9 | 11 | 9 | 11 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lp(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define ff first
#define ss second
const int maxn = 10;
const int maxv = 100;
const int inf = 1e9 + 10;
using namespace std;
ll dp[maxn * maxv];
pair<ll, ll> v[maxn];
int ans;
int main() {
lp(i, 1, maxn * maxv) dp[i] = ... | #include <bits/stdc++.h>
#define lp(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define ff first
#define ss second
const int maxn = 105;
const int maxv = 1005;
const int inf = 1e9 + 10;
using namespace std;
ll dp[maxn * maxv];
pair<ll, ll> v[maxn];
int ans;
int main() {
lp(i, 1, maxn * maxv) dp[i] ... | replace | 7 | 9 | 7 | 9 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | replace | 31 | 37 | 31 | 32 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e10 + 1
#define d(x) cerr <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e10 + 1
#define d(x) cerr <... | replace | 20 | 21 | 20 | 21 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
const ll INFLL = 1e18l + 5;
int main() {
int n, W;
cin >> n >> W;
vector<ll> dp(100001, INFLL); // dp[i] min weight at value = i
dp[0] = 0;
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
const ll INFLL = 1e18l + 5;
int main() {
int n, W;
cin >> n >> W;
vector<ll> dp(100001, INFLL); // dp[i] min weight at value = i
dp[0] = 0;
for (int i = 0; i < n; i++) {
int w, v;
cin >> w >> v;
for (int... | replace | 15 | 16 | 15 | 16 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | replace | 35 | 41 | 35 | 37 | TLE | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ppi pair<int, int>... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ppi pair<int, int>... | replace | 30 | 31 | 30 | 31 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int d[101][100001];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, w;
cin >> n >> w;
for (int i = 0; i <= n; i++)
for (i... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int d[101][100001];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, w;
cin >> n >> w;
for (int i = 0; i <= n; i++)
for (i... | replace | 27 | 28 | 27 | 28 | 0 | |
p03164 | C++ | Runtime Error |
// Target Expert
/*
* Author : raj1307 - Raj Singh
* Institute : Jalpaiguri Government Engineering College
* Date : 3.08.19
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#i... |
// Target Expert
/*
* Author : raj1307 - Raj Singh
* Institute : Jalpaiguri Government Engineering College
* Date : 3.08.19
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#i... | replace | 109 | 110 | 109 | 110 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX = 10005;
vector<long long int> S(MAX, 10000000000), A(MAX), B(MAX);
int N, W;
void DP(int u) {
for (int j = 1; j <= u; j++) {
for (int i = N * 1000; i >= 0; i--) {
if (i == 0 || (S[i] != 10000000000 && S[i] + A[j] <= W))
S[B[j] + i] = min... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
vector<long long int> S(MAX, 10000000000), A(MAX), B(MAX);
int N, W;
void DP(int u) {
for (int j = 1; j <= u; j++) {
for (int i = N * 1000; i >= 0; i--) {
if (i == 0 || (S[i] != 10000000000 && S[i] + A[j] <= W))
S[B[j] + i] = mi... | replace | 3 | 4 | 3 | 4 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs ... | replace | 24 | 25 | 24 | 26 | -6 | corrupted size vs. prev_size
|
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<int, int>> A;
ll relaxed(int i, ll cap) {
ll result = 0;
while (i < A.size()) {
if (A[i].first <= cap) {
cap -= A[i].first;
result += A[i].second;
i++;
} else {
// result += (A[i].second * cap + A[i].f... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<int, int>> A;
ll relaxed(int i, ll cap) {
ll result = 0;
while (i < A.size()) {
if (A[i].first <= cap) {
cap -= A[i].first;
result += A[i].second;
i++;
} else {
result += (A[i].second * cap + A[i].firs... | replace | 16 | 18 | 16 | 18 | TLE | |
p03164 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
inline void chmin(int &a, int b) {
if (a > b)
a = b;
}
const int MAX_V = 1e7 + 10;
const int INF = 1e9 + 10;
int main() {
int n, w;
cin >> n >> w;
vector<int> we(n), va(n);
rep(i, n) cin >> we[i] >>... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
inline void chmin(int &a, int b) {
if (a > b)
a = b;
}
const int MAX_V = 1e5 + 10;
const int INF = 1e9 + 10;
int main() {
int n, w;
cin >> n >> w;
vector<int> we(n), va(n);
rep(i, n) cin >> we[i] >>... | replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define double long double
#define mod 1000000007
#define w(t) \
int t; \
cin >> t; ... | #include <bits/stdc++.h>
#define int long long int
#define double long double
#define mod 1000000007
#define w(t) \
int t = 1; \
while (t--)
#define f(i, a, n) for (int i = a; i < n; i... | replace | 5 | 7 | 5 | 6 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[4][1000000];
ll n, w;
ll dpdp[101][1000000];
ll inf = 1000000000000000;
ll dp(ll x, ll m) {
// cout << x << m<<" ";
if (m <= 0) {
dpdp[x][m] = 0;
return 0;
}
if (x >= n) {
dpdp[x][m] = inf;
return inf;
}
if (dpdp[x]... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a[4][1000000];
ll n, w;
ll dpdp[101][1000000];
ll inf = 1000000000000000;
ll dp(ll x, ll m) {
// cout << x << m<<" ";
if (m <= 0) {
dpdp[x][m] = 0;
return 0;
}
if (x >= n) {
dpdp[x][m] = 2 * inf;
return 2 * inf;
}
if ... | replace | 14 | 16 | 14 | 16 | TLE | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, sum = 0, ans = INT_MIN;
long long int w;
long long int a[105][2];
long long int dp[105][10005];
cin >> n >> w;
for (i = 1; i <= n; i++) {
cin >> a[i][0] >> a[i][1];
sum += a[i][1];
}
for (i = 0; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, sum = 0, ans = INT_MIN;
long long int w;
long long int a[105][2];
long long int dp[105][100005];
cin >> n >> w;
for (i = 1; i <= n; i++) {
cin >> a[i][0] >> a[i][1];
sum += a[i][1];
}
for (i = 0; i <= n; i++) {
... | replace | 6 | 7 | 6 | 7 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i, x) for (ll i = 0; i < x; i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1001001001;
const ll mod = 1000000007;
typedef pair<ll, ll> P;
using graph = vector<vector<ll... | replace | 57 | 58 | 57 | 58 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define z... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define z... | replace | 30 | 31 | 30 | 31 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
int sum_v = accumulate(v.begin(), v.end(), 0);
vector<vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
int main() {
int N, W;
cin >> N >> W;
vector<int> w(N), v(N);
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
int sum_v = accumulate(v.begin(), v.end(), 0);
vector<vector<ll... | replace | 23 | 24 | 23 | 25 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
int we[MAXN], val[MAXN];
ll mem[105][MAXN];
ll n, wmax;
ll ans = 0;
ll solve(int i, ll v) {
if (v < 0)
return 1e18;
if (v == 0)
return 0;
if (i == n)
return 1e18;
ll &ret = mem[i][v];
ret = min(solve(i +... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
typedef long long ll;
int we[MAXN], val[MAXN];
ll mem[105][MAXN];
ll n, wmax;
ll ans = 0;
ll solve(int i, ll v) {
if (v < 0)
return 1e18;
if (v == 0)
return 0;
if (i == n)
return 1e18;
ll &ret = mem[i][v];
if (ret != -1)
... | insert | 17 | 17 | 17 | 19 | TLE | |
p03164 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define N 505
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | #include <bits/stdc++.h>
#define N 505
#define ll long long int
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int, int>
#define lli pair<ll, ll>
#define fast ... | replace | 29 | 30 | 29 | 30 | MLE | |
p03164 | C++ | Runtime Error | // rohitaas_15
#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;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define co(x) cout << x << "\n";
#define ld long double
#define ll long long
#defi... | // rohitaas_15
#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;
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define co(x) cout << x << "\n";
#define ld long double
#define ll long long
#defi... | replace | 182 | 183 | 182 | 183 | 0 | |
p03164 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | #include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int l... | replace | 97 | 100 | 97 | 100 | TLE | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long w[110], v[110];
long long f[1010];
long long value;
int main() {
memset(f, 0x3f, sizeof(f));
scanf("%lld%lld", &n, &m);
for (long long i = 1; i <= n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
value += v[i];
}
f[0] = 0;
for (long l... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
long long w[110], v[110];
long long f[100010];
long long value;
int main() {
memset(f, 0x3f, sizeof(f));
scanf("%lld%lld", &n, &m);
for (long long i = 1; i <= n; i++) {
scanf("%lld%lld", &w[i], &v[i]);
value += v[i];
}
f[0] = 0;
for (long... | replace | 4 | 5 | 4 | 5 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[10000];
long long N = 0, W = 0, V = 0, wi[10000], vi[10000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> wi[i] >> vi[i];
V += vi[i];
}
for (int i = 1; i <= V; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[1000000];
long long N = 0, W = 0, V = 0, wi[1000000], vi[1000000];
int main() {
cin >> N >> W;
for (int i = 1; i <= N; i++) {
cin >> wi[i] >> vi[i];
V += vi[i];
}
for (int i = 1; i <= V; i++) {
dp[i] = INT_MAX;
}
dp[0] ... | replace | 4 | 6 | 4 | 6 | 0 | |
p03164 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
type... | #include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define len(x) ((int)(x).size())
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef pair<int, int> pii;
type... | replace | 30 | 32 | 30 | 32 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i =... | replace | 68 | 69 | 68 | 69 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test() \
ll t; \
cin >> t; \
while (t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test() \
ll t; \
cin >> t; \
while (t... | replace | 25 | 26 | 25 | 26 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll INF = 1e18L + 5;
int main() {
ll n, W, sum = 0;
cin >> n >> W;
vector<ll> wt(n), v(n);
for (ll i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
sum += v[i];
}
vector<ll> dp(sum + 1, INF);
dp[0] = 0;
for (ll i = 1; i <= n... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll INF = 1e18L + 5;
int main() {
ll n, W, sum = 0;
cin >> n >> W;
vector<ll> wt(n + 1), v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> wt[i] >> v[i];
sum += v[i];
}
vector<ll> dp(sum + 1, INF);
dp[0] = 0;
for (ll i = 1... | replace | 8 | 9 | 8 | 9 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03164 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll INF = 1LL << 60;
ll dp[100][100009];
int main() {
int n;
ll w;
cin >> n >> w;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll INF = 1LL << 60;
ll dp[105][100009];
int main() {
int n;
ll w;
cin >> n >> w;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03164 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const int MAX_V = pow(10, 3) * 100 + 1;
int main() {
int N;
long long W;
cin >> N >> W... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
const int MAX_V = pow(10, 3) * 100 + 1;
int main() {
int N;
long long W;
cin >> N >> W... | replace | 22 | 23 | 22 | 23 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define intt long long
const intt INF = 1e18L + 5;
int n, W;
int main() {
cin >> n >> W;
vector<int> v(n + 1), w(n + 1);
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
int V = 0;
for (int i = 1; i <= n; i++) {
V += v[i];
}
vector<intt... | #include <bits/stdc++.h>
using namespace std;
#define intt long long
const intt INF = 1e18L + 5;
int n, W;
int main() {
cin >> n >> W;
vector<int> v(n + 1), w(n + 1);
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
}
int V = 0;
for (int i = 1; i <= n; i++) {
V += v[i];
}
vector<intt... | replace | 29 | 30 | 29 | 32 | 0 | |
p03164 | C++ | Runtime Error | #include <iostream>
using namespace std;
int w[110], v[110];
long long int dp[1100];
int INF = 1000000009;
int N, W;
int main() {
for (int i = 0; i < 100001; i++)
dp[i] = INF;
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int ... | #include <iostream>
using namespace std;
int w[110], v[110];
long long int dp[110000];
int INF = 1000000009;
int N, W;
int main() {
for (int i = 0; i < 100001; i++)
dp[i] = INF;
cin >> N >> W;
for (int i = 0; i < N; i++) {
cin >> w[i] >> v[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (in... | replace | 4 | 5 | 4 | 5 | -11 | |
p03164 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
static ll INF = 1000000000000;
int N, W;
cin >> N >> W;
vector<int> w(N);
vector<int> v(N);
vector<vector<ll>> dp(N + 1, vector<ll>(100009, INF));
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
dp[0][... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
static ll INF = 1000000000000;
int N, W;
cin >> N >> W;
vector<int> w(N);
vector<int> v(N);
vector<vector<ll>> dp(N + 1, vector<ll>(200009, INF));
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
dp[0][... | replace | 12 | 13 | 12 | 13 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
const long long inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
ll n, k;
struct node... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
const long long inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
ll n, k;
struct node... | replace | 35 | 36 | 35 | 36 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | "... | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define trace(x) cerr << #x << ": " << x << " " << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | "... | replace | 25 | 26 | 25 | 26 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 10, OO = 0x3f3f3f3f;
// const int mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
double startTime;
double getCurrentTime() {
return ((double)clock() - startT... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 10, OO = 0x3f3f3f3f;
// const int mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
double startTime;
double getCurrentTime() {
return ((double)clock() - startT... | replace | 29 | 30 | 29 | 30 | 0 | |
p03164 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | replace | 78 | 79 | 78 | 79 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define pi acos(-1)
#define eps 1e-6
#define inf 1e14
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
const int dx[8] = {-1, -1, -1, 0, 0... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define pi acos(-1)
#define eps 1e-6
#define inf 1e14
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
const int dx[8] = {-1, -1, -1, 0, 0... | replace | 20 | 21 | 20 | 21 | 0 | |
p03164 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e9;
signed main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1,... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
int mod2 = 998244353;
const int INF = 1e9;
signed main() {
int n, W;
cin >> n >> W;
vector<int> w(n);
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> w[i] >> v[i];
vector<vector<int>> dp(n + 1,... | replace | 15 | 16 | 15 | 16 | 0 | |
p03164 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int MAX_N = 100;
const int MAX_V = 100100;
long long dp[MAX_N][MAX_V] = {
0}; // N-1番目までで入れた容量の価値を最大にするもの
long long weight[MAX_N], value[MAX_V];
const long long INF = 1LL << 60;
int main() {
long long N, W;
cin >> N >> W;
for (int i = 0; i < N; ++i) {
cin ... | #include <iostream>
using namespace std;
const int MAX_N = 110;
const int MAX_V = 100100;
long long dp[MAX_N][MAX_V] = {
0}; // N-1番目までで入れた容量の価値を最大にするもの
long long weight[MAX_N], value[MAX_V];
const long long INF = 1LL << 60;
int main() {
long long N, W;
cin >> N >> W;
for (int i = 0; i < N; ++i) {
cin ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03164 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
#define MAX_N 100
#define MAX_V 1000
#define INF pow(10, 12)
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long> w(N);
vector<long> v(N);
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
vector<vector<long>> dp(MAX_N + 1, ve... | #include <cmath>
#include <iostream>
#include <vector>
#define MAX_N 200
#define MAX_V 1000
#define INF pow(10, 12)
using namespace std;
int main() {
int N, W;
cin >> N >> W;
vector<long> w(N);
vector<long> v(N);
for (int i = 0; i < N; i++)
cin >> w[i] >> v[i];
vector<vector<long>> dp(MAX_N + 1, ve... | replace | 4 | 5 | 4 | 5 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve() {
int n, w_max;
cin >> n >> w_max;
vector<ll> v(n), w(n);
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
// dp[i][k] -> menor peso possível utilizando até o item i atigindo valor
// maior ou igual a ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void solve() {
int n, w_max;
cin >> n >> w_max;
vector<ll> v(n), w(n);
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
// dp[i][k] -> menor peso possível utilizando até o item i atigindo valor
// maior ou igual a ... | replace | 20 | 21 | 20 | 21 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03164 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define MuhammedAly \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
co... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define MuhammedAly \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
co... | replace | 31 | 32 | 31 | 32 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
LL MOD = 1000000007;
int main() {
int N, W;
cin >> N >> W;
// vector<int> v(N, 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
LL MOD = 1000000007;
int main() {
int N, W;
cin >> N >> W;
// vector<int> v(N, 0... | replace | 28 | 29 | 28 | 29 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e15;
ll n, W, dp[100001], c[101], w[101], ans;
int main() {
cin >> n >> W;
for (int i = 0; i <= 100000; ++i)
dp[i] = INF;
for (int i = 0; i < n; ++i)
cin >> w[i] >> c[i];
dp[0] = 0;
for (int pos = 0; pos < n; ++po... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e15;
ll n, W, dp[100001], c[101], w[101], ans;
int main() {
cin >> n >> W;
for (int i = 0; i <= 100000; ++i)
dp[i] = INF;
for (int i = 0; i < n; ++i)
cin >> w[i] >> c[i];
dp[0] = 0;
for (int pos = 0; pos < n; ++po... | replace | 21 | 22 | 21 | 23 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, wlim;
cin >> n >> wlim;
vector<int64_t> ws(n), vs(n);
for (int i = 0; i < n; i++) {
cin >> ws[i] >> vs[i];
}
vector<vector<int64_t>> dp(n, vector<int64_t>(100001, 1LL << 60));
dp[0][0] = 0;
dp[0][vs[0]] = ws[0];
for (int i = 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, wlim;
cin >> n >> wlim;
vector<int64_t> ws(n), vs(n);
for (int i = 0; i < n; i++) {
cin >> ws[i] >> vs[i];
}
vector<vector<int64_t>> dp(n, vector<int64_t>(100001, 1LL << 60));
dp[0][0] = 0;
dp[0][vs[0]] = ws[0];
for (int i = 1;... | replace | 16 | 17 | 16 | 19 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | insert | 56 | 56 | 56 | 58 | -11 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back()
#define endl '\n'
const int maxn = 1e3 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const ll inF = 0x3f3f3f3f3f3f3f3f;
struct node {
int w, v;
};
node a[... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define POP pop_back()
#define ll long long
#define db double
#define POP pop_back()
#define endl '\n'
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const ll inF = 0x3f3f3f3f3f3f3f3f;
struct node {
int w, v;
};
node a[... | replace | 8 | 9 | 8 | 9 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<LL>;
using VVI = vector<VI>;
using VB = vector<bool>;
using VS = vector<string>;
using PII = pair<LL, LL>;
using VP = vector<PII>;
#define PB push_back
#define MP make_pair
#define SZ(a) LL((a).size())
#define EACH(x, c) for (auto x :... | replace | 45 | 47 | 45 | 49 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, W;
cin >> N >> W;
long long int v[N], w[N];
for (long long int i = 0; i < N; i++)
cin >> w[i] >> v[i];
long long int dp[N + 1][100001];
dp[0][0] = 0;
for (long long int i = 1; i <= 100000; i++)
dp[0][i] = W + 1;
for (lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, W;
cin >> N >> W;
long long int v[N], w[N];
for (long long int i = 0; i < N; i++)
cin >> w[i] >> v[i];
long long int dp[N + 1][100001];
dp[0][0] = 0;
for (long long int i = 1; i <= 100000; i++)
dp[0][i] = W + 1;
for (lon... | replace | 20 | 21 | 20 | 21 | -11 | |
p03164 | C++ | Runtime Error | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
int dp[105][(int)1e3 +... | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
int dp[105][(int)1e5 +... | replace | 11 | 12 | 11 | 12 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define Matrix v... | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define Matrix v... | replace | 41 | 42 | 41 | 45 | 0 | |
p03164 | C++ | Runtime Error | // #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#include <bits/stdc++.h>
using namespace std;
// ¯\_(ツ)_/¯
#define f first
#define s second
#define p push
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define rep(i, begin, end) ... | // #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
#include <bits/stdc++.h>
using namespace std;
// ¯\_(ツ)_/¯
#define f first
#define s second
#define p push
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define rep(i, begin, end) ... | replace | 61 | 63 | 61 | 63 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 2, W = 1e9 + 5, V = 1e3 + 3;
long long dp[2][V];
const long long INF = 1e13 + 13;
int main() {
int n, ww, vv = 0;
cin >> n >> ww;
vector<int> v(n), w(n);
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
vv += v[i];
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 2, W = 1e9 + 5, V = 1e5 + 5;
long long dp[2][V];
const long long INF = 1e13 + 13;
int main() {
int n, ww, vv = 0;
cin >> n >> ww;
vector<int> v(n), w(n);
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
vv += v[i];
}
for (int i =... | replace | 2 | 3 | 2 | 3 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | replace | 43 | 45 | 43 | 46 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
signed main() {
lli n, w;
vector<pair<lli, lli>> p;
cin >> n >> w;
REP(i, 0, n) {
lli a, b;
cin >> a >> b;
p.pu... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, l) for (lli i = s; i < l; i++)
#define DEBUG 0
#define INF (1LL << 50)
#define MOD 1000000007
signed main() {
lli n, w;
vector<pair<lli, lli>> p;
cin >> n >> w;
REP(i, 0, n) {
lli a, b;
cin >> a >> b;
p.pu... | replace | 46 | 47 | 46 | 47 | -11 | |
p03164 | C++ | Time Limit Exceeded | //*****************************believer******************************//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef map<ll, ll> mi;
#define f first
#define ss second
#define ins insert
#define pb push_back
#define... | //*****************************believer******************************//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef map<ll, ll> mi;
#define f first
#define ss second
#define ins insert
#define pb push_back
#define... | insert | 45 | 45 | 45 | 48 | TLE | |
p03164 | C++ | Time Limit Exceeded | /* -----KAUN_MEET--------*/
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int mod = 1000000007;
// int maxi=100;
int maxi = 1e18 + 5;
#define P get<0>
#define D get<1>
#define T get<2>
#define C get<3>
#define PB push_back
#define MP make_pair
#define BS binary_search
#define LB lower_bound
#... | /* -----KAUN_MEET--------*/
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int mod = 1000000007;
// int maxi=100;
int maxi = 1e18 + 5;
#define P get<0>
#define D get<1>
#define T get<2>
#define C get<3>
#define PB push_back
#define MP make_pair
#define BS binary_search
#define LB lower_bound
#... | insert | 79 | 79 | 79 | 81 | TLE | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 10;
const int MAX_V = 1e5 + 10;
int main() {
int n, max_w;
scanf("%d%d", &n, &max_w);
vector<long long> v(n), w(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(M... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 10;
const int MAX_V = 1e5 + 10;
int main() {
int n, max_w;
scanf("%d%d", &n, &max_w);
vector<long long> v(n), w(n);
for (int i = 0; i < n; i++) {
cin >> w[i] >> v[i];
}
vector<vector<long long>> dp(n + 1, vector<long long>(M... | replace | 20 | 21 | 20 | 21 | 0 | |
p03164 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | insert | 35 | 35 | 35 | 37 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, ... | replace | 21 | 22 | 21 | 22 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 300005;
const long long mod = 1e9 + 7;
int n, w;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 300005;
const long long mod = 1e9 + 7;
int n, w;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
i... | delete | 14 | 18 | 14 | 14 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e3 + 10, M = 1e2 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9;
int w[M], v[M];
int dp[M][N];
int main() {
int W, n;
int val = 0;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
val += v[i];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10, M = 1e2 + 10;
const int mod = 1e9 + 7;
const int inf = 1e9;
int w[M], v[M];
int dp[M][N];
int main() {
int W, n;
int val = 0;
cin >> n >> W;
for (int i = 1; i <= n; i++) {
cin >> w[i] >> v[i];
val += v[i];
}
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
#define DIM 100007
#define INF 1000000000000000007LL
using namespace std;
long long n, w[107], v[107], W, d[107][DIM], res;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i < DIM; ++i)
d[0][i] = INF;
for (int i = 1; i <= n; ++i)... | #include <bits/stdc++.h>
#define DIM 100007
#define INF 1000000000000000007LL
using namespace std;
long long n, w[107], v[107], W, d[107][DIM], res;
int main() {
cin >> n >> W;
for (int i = 1; i <= n; ++i)
cin >> w[i] >> v[i];
for (int i = 1; i < DIM; ++i)
d[0][i] = INF;
for (int i = 1; i <= n; ++i)... | replace | 17 | 18 | 17 | 20 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100000;
const ll INF = 1e18 + 7107;
int n, w[100005], v[100005], ans;
ll f[100005], T;
int main() {
scanf("%d%lld", &n, &T);
for (int i = 1; i <= n; i++)
scanf("%d%d", &w[i], &v[i]);
for (int i = 1; i <= MX; i++)
f[i] = INF... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100000;
const ll INF = 1e18 + 7107;
int n, w[100005], v[100005], ans;
ll f[100005], T;
int main() {
scanf("%d%lld", &n, &T);
for (int i = 1; i <= n; i++)
scanf("%d%d", &w[i], &v[i]);
for (int i = 1; i <= MX; i++)
f[i] = INF... | replace | 16 | 17 | 16 | 17 | 0 | |
p03164 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef RED
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
const int N = (int)1e6 + 5;
const ll inf = (ll)1e18;
int n, W;
ll w[N], v[N];
ll dp[N];
int main() {
#ifdef RED
freopen("a.i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef RED
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif
const int N = (int)1e6 + 5;
const ll inf = (ll)1e18;
int n, W;
ll w[N], v[N];
ll dp[N];
int main() {
#ifdef RED
freopen("a.i... | replace | 36 | 37 | 36 | 37 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.