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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define swap(a, b) \
do { \
typeof(a) __tmp = (a); \
(a... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define swap(a, b) \
do { \
typeof(a) __tmp = (a); \
(a... | insert | 44 | 44 | 44 | 54 | 0 | |
p03007 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | replace | 76 | 77 | 76 | 81 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std; // Here's a small hint that helped motivate my solution.
typedef long long int ll;
int main() {
// Suppose we have three terms x, y, and z. After subtracting z from y, we get
// y-z, and after subtracting
// that from x, we get x-y+z. As you can see, the z is being ad... | #include <bits/stdc++.h>
using namespace std; // Here's a small hint that helped motivate my solution.
typedef long long int ll;
int main() {
// Suppose we have three terms x, y, and z. After subtracting z from y, we get
// y-z, and after subtracting
// that from x, we get x-y+z. As you can see, the z is being ad... | replace | 16 | 17 | 16 | 17 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define N 100005
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
int sum = 0;
vector<int> pos, neg;
pos.push_back(0);
for (int i = 0; i < n; ++i) {
c... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define N 100005
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n];
int sum = 0;
vector<int> pos, neg;
pos.push_back(0);
for (int i = 0; i < n; ++i) {
c... | replace | 52 | 53 | 52 | 53 | 0 | |
p03007 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace st... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace st... | insert | 32 | 32 | 32 | 41 | TLE | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
co... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); (i)++)
#define all(x) x.begin(), x.end()
struct revran {
const i64 b, e;
struct iter {
i64 i;
constexpr iter(const i64 i) noexcept : i(i) {}
void operator++() noexcept { --i; }
co... | replace | 94 | 96 | 94 | 96 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, count = 0;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
if (n == 2) {
cout << a[1] - a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, count = 0;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
if (n == 2) {
cout << a[1] - a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
v... | insert | 26 | 26 | 26 | 53 | 0 | |
p03007 | 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++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x... |
#include <bits/stdc++.h>
using namespace std;
;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF 1 << 30
#define LINF 1LL << 62
#define all(x... | replace | 42 | 43 | 42 | 43 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inlin... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inlin... | insert | 57 | 57 | 57 | 62 | 0 | |
p03007 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1e5;
int n;
vector<int> a;
vector<P> ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int b;
scanf("%d", &b);
a.emplace_back(b);
}
sort(a.beg... | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1e5;
int n;
vector<int> a;
vector<P> ans;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int b;
scanf("%d", &b);
a.emplace_back(b);
}
sort(a.beg... | insert | 24 | 24 | 24 | 26 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int MOD = 1000000007;
int INF = 100100100100100;
int a[100010];
int neg;... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int MOD = 1000000007;
int INF = 100100100100100;
int a[100010];
int neg;... | replace | 34 | 35 | 34 | 35 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | insert | 38 | 38 | 38 | 44 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int mod = (int)1e9 + 7;
int INF = (int)2e18;
signed main() {
int N;
cin >> N;
deque<int> negative, positive;
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
if (temp <= 0)
negative.push_back(temp);
else
positiv... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int mod = (int)1e9 + 7;
int INF = (int)2e18;
signed main() {
int N;
cin >> N;
deque<int> negative, positive;
for (int i = 0; i < N; i++) {
int temp;
cin >> temp;
if (temp <= 0)
negative.push_back(temp);
else
positiv... | insert | 27 | 27 | 27 | 34 | 0 | |
p03007 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A.begin(), A.end(), greater<long long>());
vector<long long> sum(A);
for (int i = 1; i < N; ++i)
sum[i] += sum[i - 1... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i];
sort(A.begin(), A.end(), greater<long long>());
vector<long long> sum(A);
for (int i = 1; i < N; ++i)
sum[i] += sum[i - 1... | replace | 18 | 19 | 18 | 19 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a;
vector<long long> b;
vector<pair<long long, long long>> anss;
for (int i = 0; i < n; i++) {
long long ab;
cin >> ab;
if (ab >= 0)
a.push_back(ab);
else
b.push_back(ab);
}
sort(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a;
vector<long long> b;
vector<pair<long long, long long>> anss;
if (n == 2) {
long long x, y;
cin >> x >> y;
cout << max(x, y) - min(x, y) << endl;
cout << max(x, y) << " " << min(x, y) << endl;... | insert | 10 | 10 | 10 | 18 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a > 0)
pls.push_back(a);
if (a < 0)
mns.push_back(a);
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
int main() {
int N;
cin >> N;
vector<int> data;
int pl = 0;
int mn = 0;
vector<int> pls, mns;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a > 0)
pls.push_back(a);
else
mns.push_back(a);
}
so... | replace | 18 | 19 | 18 | 19 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | replace | 73 | 74 | 73 | 74 | 0 | |
p03007 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | replace | 79 | 80 | 79 | 80 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define ba 47
#define MAXN 100005
// #define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned in... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define ba 47
#define MAXN 100005
// #define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned in... | replace | 59 | 60 | 59 | 60 | 0 | |
p03007 | C++ | Runtime Error | // #includes {{{
#ifdef MY_DEBUG
#include "header/header.hpp"
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \... | // #includes {{{
#ifdef MY_DEBUG
#include "header/header.hpp"
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define RREP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define FOR(i, c) \... | replace | 58 | 59 | 58 | 59 | 0 | |
p03007 | C++ | Runtime Error | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | replace | 148 | 157 | 148 | 156 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
int c = lower_bound(A.begin(), A.end(), 0) - A.begin();
//
vector<int> vec1(c);
vector<int> vec2(N - c);
vector<pair<int, int>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
int c = lower_bound(A.begin(), A.end(), 0) - A.begin();
//
if (c <= 0) {
// all of components are positive
c = 1;
} else ... | insert | 14 | 14 | 14 | 23 | 0 | |
p03007 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y ... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < (n); i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int, int>
using namespace std;
// Library
// モッドパウ
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y ... | replace | 310 | 311 | 310 | 311 | 0 | |
p03007 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long lo... | #include <bits/stdc++.h>
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forn1(i, n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long lo... | insert | 68 | 68 | 68 | 69 | TLE | |
p03008 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | replace | 16 | 24 | 16 | 20 | MLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
temp... | replace | 10 | 11 | 10 | 11 | -11 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#... | insert | 143 | 143 | 143 | 153 | 0 | |
p03008 | 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;
int main() {
int N, a[2][3], b[3];
cin >> N;
rep(i, 2) rep(j, 3) cin >> a[i][j];
rep(i, 3) b[i] = a[1][i] - a[0][i];
vector<vector<ll>> dp1(4, vector<ll>(N + 1, 0));
rep(i, 3) {
rep(j, N +... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, a[2][3], b[3];
cin >> N;
rep(i, 2) rep(j, 3) cin >> a[i][j];
rep(i, 3) b[i] = a[1][i] - a[0][i];
vector<vector<ll>> dp1(4, vector<ll>(N + 1, 0));
rep(i, 3) {
rep(j, N +... | replace | 28 | 29 | 28 | 29 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, n, m) for (int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long dou... | #include <bits/stdc++.h>
#define FOR(i, n, m) for (int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = std::int_fast64_t;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long dou... | replace | 269 | 276 | 269 | 309 | TLE | |
p03008 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
... | replace | 70 | 71 | 70 | 71 | -11 | |
p03008 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | replace | 85 | 86 | 85 | 86 | -11 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <vector>
std::vector<int64_t> dp;
int main(void) {
int64_t n;
std::vector<int64_t> g(2), s(2), b(2);
std::cin >> n;
for (int i = 0; i < 2; i++) {
... | #include <algorithm>
#include <array>
#include <bitset>
#include <chrono>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <vector>
std::vector<int64_t> dp;
int main(void) {
int64_t n;
std::vector<int64_t> g(2), s(2), b(2);
std::cin >> n;
for (int i = 0; i < 2; i++) {
... | replace | 51 | 52 | 51 | 52 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock() / CLOCKS_PER_SEC
int solve(int n,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock() / CLOCKS_PER_SEC
int solve(int n,... | insert | 14 | 14 | 14 | 29 | TLE | |
p03008 | Python | Time Limit Exceeded | N = int(input())
A = [int(_) for _ in input().split()]
B = [int(_) for _ in input().split()]
def count(n, a, b):
a0, a1, a2 = a
b0, b1, b2 = b
dp = [0] * (n + 1)
for i in range(n + 1):
c0 = dp[i - a0] + b0 if i - a0 >= 0 else 0
c1 = dp[i - a1] + b1 if i - a1 >= 0 else 0
c2 = dp... | N = int(input())
A = [int(_) for _ in input().split()]
B = [int(_) for _ in input().split()]
def count(n, a, b):
a0, a1, a2 = a
b0, b1, b2 = b
dp = [0] * (n + 1)
for i in range(n + 1):
c0 = dp[i - a0] + b0 if i - a0 >= 0 else 0
c1 = dp[i - a1] + b1 if i - a1 >= 0 else 0
c2 = dp... | replace | 13 | 14 | 13 | 14 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, n1 = 0, n2 = 0, g1, s1, b1, g2, s2, b2;
cin >> n >> g1 >> s1 >> b1 >> g2 >> s2 >> b2;
for (long i = 0; i * g1 <= n; i++) {
for (long j = 0; i * g1 + j * s1 <= n; j++) {
n1 = max(n1, i * g2 + j * s2 + (n - i * g1 - j * s1));
n1 = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, n1 = 0, n2 = 0, g1, s1, b1, g2, s2, b2;
cin >> n >> g1 >> s1 >> b1 >> g2 >> s2 >> b2;
for (long i = 0; i * g1 <= n; i++) {
for (long j = 0; i * g1 + j * s1 <= n; j++) {
n1 = max(n1, i * g2 + j * s2 + (n - i * g1 - j * s1));
n1 = ... | replace | 14 | 19 | 14 | 45 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll, ll> P;
typedef pair<double, ll> Pd;
typedef pair<double, double> PD;
typedef priority_queue<P, vector<P>, greater... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll, ll> P;
typedef pair<double, ll> Pd;
typedef pair<double, double> PD;
typedef priority_queue<P, vector<P>, greater... | replace | 31 | 32 | 31 | 32 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | replace | 120 | 123 | 120 | 126 | 0 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) for (int i = (a)-1, i##... | replace | 42 | 48 | 42 | 71 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 51 | 54 | 51 | 54 | -11 | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <time.h>
#define cl_has_dh(x...) \
cl_get_th_100(x, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <time.h>
#define cl_has_dh(x...) \
cl_get_th_100(x, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ... | replace | 269 | 270 | 269 | 270 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | replace | 31 | 32 | 31 | 39 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL... | delete | 93 | 94 | 93 | 93 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se s... | replace | 112 | 119 | 112 | 126 | TLE | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int MAX_N = (1 << 25);
long long N, SA, SB, SC, TA, TB, TC;
long long dp[1 << 25], dp2[1 << 25];
int main() {
cin >> N >> SA >> SB >> SC >> TA >> TB >> TC;
for (int i = 1; i < MAX_N; i++)
dp[i] = -(1 << 30);
dp[0] = N;
for (int i = 0; i < MAX_... | #include <algorithm>
#include <iostream>
using namespace std;
int MAX_N = (1 << 25);
long long N, SA, SB, SC, TA, TB, TC;
long long dp[1 << 25], dp2[1 << 25];
int main() {
cin >> N >> SA >> SB >> SC >> TA >> TB >> TC;
for (int i = 1; i < MAX_N; i++)
dp[i] = -(1 << 30);
dp[0] = N;
for (int i = 0; i < MAX_... | replace | 30 | 31 | 30 | 31 | -11 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | replace | 109 | 110 | 109 | 110 | 46 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long int N, g[3], s[3], b[3];
long long int dp[5555];
long long int dp2[3000000];
int main(void) {
cin >> N;
for (int i = 1; i <= 2; i++) {
cin >> g[i] >> s[i] >> b[i];
}
long long int M = 0;
for (int i = 1; i <= ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long int N, g[3], s[3], b[3];
long long int dp[5555];
long long int dp2[30000000];
int main(void) {
cin >> N;
for (int i = 1; i <= 2; i++) {
cin >> g[i] >> s[i] >> b[i];
}
long long int M = 0;
for (int i = 1; i <=... | replace | 9 | 10 | 9 | 10 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef lon... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef lon... | replace | 776 | 777 | 776 | 784 | TLE | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w... | replace | 60 | 61 | 60 | 61 | 0 | |
p03008 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#incl... | replace | 102 | 103 | 102 | 103 | 0 | |
p03008 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> //... | #pragma GCC optimize("Ofast")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> //... | replace | 152 | 163 | 152 | 220 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | replace | 37 | 38 | 37 | 38 | -11 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); +... | replace | 20 | 21 | 20 | 21 | 0 | |
p03008 | C++ | Runtime Error | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[5007];
int a... | // by xxj
#include <bits/stdc++.h>
using namespace std;
#define fst first
#define snd second
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define lowbit(x) x & -x
const int inf = 1e9 + 7;
const double eps = 1e-10;
const ll linf = 1e18 + 7;
const ll hh = 523;
// const int mod=;
ll dp[25000007];
i... | replace | 14 | 15 | 14 | 15 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#defi... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#defi... | replace | 17 | 18 | 17 | 18 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a[3], b[3];
cin >> n;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
cin >> b[i];
}
ll maxa2b = n;
for (int x = 0; x <= n; x++) {
if (a[0] * x > n)
... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
ll a[3], b[3];
cin >> n;
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
cin >> b[i];
}
ll maxa2b = n;
for (int x = 0; x <= n; x++) {
if (a[0] * x > n)
... | insert | 29 | 29 | 29 | 66 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <iostream>
long long trade(long long n, int g_A, int s_A, int b_A, int g_B, int s_B,
int b_B) {
long long n_Max = n;
for (int g = 0; g * g_A <= n; g++) {
if ((g_B - g_A <= 0) && (g > 0)) {
break;
}
for (int s = 0; g * g_A + s * s_A <= n; s++) {
if ((s_B - s_A <= 0... | #include <iostream>
long long trade(long long n, int g_A, int s_A, int b_A, int g_B, int s_B,
int b_B) {
long long n_Max = n;
for (int g = 0; g * g_A <= n; g++) {
if ((g_B - g_A <= 0) && (g > 0)) {
break;
}
for (int s = 0; g * g_A + s * s_A <= n; s++) {
if ((s_B - s_A <= 0... | insert | 19 | 19 | 19 | 21 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | insert | 45 | 45 | 45 | 77 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
long ga, sa, ba, gb, sb, bb;
cin >> ga >> sa >> ba >> gb >> sb >> bb;
struct Stat {
long f, t;
};
Stat stats[3] = {
Stat{min(ga, gb), max(ga, gb)},
Stat{min(sa,... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
long ga, sa, ba, gb, sb, bb;
cin >> ga >> sa >> ba >> gb >> sb >> bb;
struct Stat {
long f, t;
};
Stat stats[3] = {
Stat{min(ga, gb), max(ga, gb)},
Stat{min(sa,... | insert | 54 | 54 | 54 | 56 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll get(ll n, vector<ll> buy, vector<ll> sell) {
ll ret =... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll get(ll n, vector<ll> buy, vector<ll> sell) {
ll ret =... | replace | 19 | 25 | 19 | 48 | TLE | |
p03008 | C++ | Time Limit Exceeded | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | insert | 117 | 117 | 117 | 139 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | replace | 66 | 68 | 66 | 68 | TLE | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0,... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0,... | replace | 36 | 37 | 36 | 37 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
ll dp[5010];
ll n;
ll a[10][10];
ll ans;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> n... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> pii;
ll dp[5001 * 5001];
ll n;
ll a[10][10];
ll ans;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
c... | replace | 8 | 9 | 8 | 9 | 0 | |
p03008 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pp pair<pair<ll, ll>, pair<ll, ll>>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#defin... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pp pair<pair<ll, ll>, pair<ll, ll>>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#defin... | replace | 65 | 66 | 65 | 66 | 0 | time : 2 ms
|
p03008 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll n, ta[3], tb[3];
vector<ll> a[2], b[2];
ll f(ll p, ll q, ll r) {
ll i, re = 0;
if (r == a[p].size())
return q;
for (i = 0; i * a[p][r] <= q; i++) {
re = max(re, f(p, q - i * a[p][r], r + 1) + i * b[p][r... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll n, ta[3], tb[3];
vector<ll> a[2], b[2];
ll f(ll p, ll q, ll r) {
ll i, re = 0;
if (r == a[p].size())
return q;
if (r == a[p].size() - 1)
return q / a[p][r] * b[p][r] + q % a[p][r];
for (i = 0; i * a[p... | insert | 13 | 13 | 13 | 15 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x... | replace | 55 | 56 | 55 | 56 | 0 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | replace | 36 | 37 | 36 | 37 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_... | replace | 49 | 50 | 49 | 50 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fr(i, j, k) for (i = j; i < (k); i++)
#define all(x) x.begin(), x.end()
#define el '\n'
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
typede... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fr(i, j, k) for (i = j; i < (k); i++)
#define all(x) x.begin(), x.end()
#define el '\n'
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
typede... | replace | 28 | 31 | 28 | 29 | -11 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer
#include <functional>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath> // abs() for float, and fabs()
#include <cstdlib> // abs() for integer
#include <functional>
#include <iomanip>
#include <iostream>
#include <map> // pair
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <stdio.h... | replace | 65 | 66 | 65 | 66 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | #include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int, int>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MINF(a) m... | replace | 84 | 85 | 84 | 85 | -11 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a)... | replace | 75 | 76 | 75 | 76 | -11 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n;
long long a[3], b[3], go[5005], back[5005];
int main() {
scanf("%lld", &n);
for (int i = 0; i < 3; i++) {
scanf("%lld", &a[i]);
}
for (int i = 0; i < 3; i++) {
scanf("%lld", &b[i]);
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3;... | #include <bits/stdc++.h>
using namespace std;
long long n;
long long a[3], b[3], go[5005], back[5005 * 5005];
int main() {
scanf("%lld", &n);
for (int i = 0; i < 3; i++) {
scanf("%lld", &a[i]);
}
for (int i = 0; i < 3; i++) {
scanf("%lld", &b[i]);
}
for (int i = 1; i <= n; i++) {
for (int j = 0;... | replace | 3 | 4 | 3 | 4 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long f[5000005];
int main() {
int n;
cin >> n;
int a[3], b[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cin >> b[i];
for (int i = 0; i < 3; i++)
if (a[i] < b[i]) {
for (int j = a[i]; j <= n; j++)
f[j] ... | #include <bits/stdc++.h>
using namespace std;
long long f[25000005];
int main() {
int n;
cin >> n;
int a[3], b[3];
for (int i = 0; i < 3; i++)
cin >> a[i];
for (int i = 0; i < 3; i++)
cin >> b[i];
for (int i = 0; i < 3; i++)
if (a[i] < b[i]) {
for (int j = a[i]; j <= n; j++)
f[j]... | replace | 3 | 4 | 3 | 4 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | replace | 709 | 710 | 709 | 719 | 0 | |
p03008 | C++ | Runtime Error | #include <iostream>
using namespace std;
const long long MAXN = 5e6 + 5;
long long a[5][5];
long long dp[MAXN];
long long m, ans;
int main() {
long long n;
cin >> n;
for (long long i = 0; i < 2; i++) {
for (long long j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i <= n; i++) {... | #include <iostream>
using namespace std;
const long long MAXN = 5e7 + 5;
long long a[5][5];
long long dp[MAXN];
long long m, ans;
int main() {
long long n;
cin >> n;
for (long long i = 0; i < 2; i++) {
for (long long j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i <= n; i++) {... | replace | 3 | 4 | 3 | 4 | 0 | |
p03008 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < N; ++i)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < N; ++i)
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;... | replace | 31 | 32 | 31 | 32 | MLE | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | replace | 137 | 142 | 137 | 141 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 2e5 + 5;
const ld pi = 3.14159265359;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define pb push_back
#define mp mak... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 5000 * 5000 + 5;
const ld pi = 3.14159265359;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define pb push_back
#defin... | replace | 6 | 7 | 6 | 7 | 0 | |
p03008 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;... | replace | 18 | 19 | 18 | 19 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " <<... | insert | 101 | 101 | 101 | 106 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | replace | 59 | 60 | 59 | 60 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | insert | 29 | 29 | 29 | 43 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 5;
int n, a, b, c, d, e, f, ma, dp[N];
signed main() {
cin >> n;
cin >> a >> b >> c >> d >> e >> f;
memset(dp, -63, sizeof(dp));
dp[0] = 0;
for (int i = a; i <= n; i++)
dp[i] = max(dp[i], dp[i - a] + d);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5000 * 5000 + 5;
int n, a, b, c, d, e, f, ma, dp[N];
signed main() {
cin >> n;
cin >> a >> b >> c >> d >> e >> f;
memset(dp, -63, sizeof(dp));
dp[0] = 0;
for (int i = a; i <= n; i++)
dp[i] = max(dp[i], dp[i - a] + d);
for ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
// printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*... | #include <bits/stdc++.h>
using namespace std;
inline void prep() {
cin.tie(0);
cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
// printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*... | replace | 104 | 105 | 104 | 105 | 0 | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
#define MAX_N 200005
struct data {
double ratio;
int64 cost, profit;
};
void DFS(int depth, vector<data> &vs, int64 value, int64 now, int64 &res) {
if (depth == 3) {
res = max(res, value + now);
return;
}
int64 upper = now / v... | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
#define MAX_N 200005
struct data {
double ratio;
int64 cost, profit;
};
void DFS(int depth, vector<data> &vs, int64 value, int64 now, int64 &res) {
if (depth == 3) {
res = max(res, value + now);
return;
}
if (value + now * max... | insert | 17 | 17 | 17 | 20 | TLE | |
p03008 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// Template Headers {{{
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<long long>;
template <class T> istream &operator>>(istream &, vector<T> &);
template <class T> ostream &op... | #include <bits/stdc++.h>
using namespace std;
// Template Headers {{{
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<long long>;
template <class T> istream &operator>>(istream &, vector<T> &);
template <class T> ostream &op... | replace | 94 | 95 | 94 | 95 | TLE | |
p03008 | C++ | Time Limit Exceeded | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define trav(x, a) for (const auto &x : a)
#define sz(x) (int)(x).size()
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#... | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define trav(x, a) for (const auto &x : a)
#define sz(x) (int)(x).size()
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#... | replace | 76 | 83 | 76 | 83 | TLE | |
p03008 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | replace | 34 | 35 | 34 | 35 | 0 | |
p03008 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> gsb_A(3), gsb_B(3);
cin >> gsb_A[0] >> gsb_A[1] >> gsb_A[2];
cin >> gsb_B[0] >> gsb_B[1] >> gsb_B[2];
// A -> B
// dp[n] := with n acrons, chokudai can gain dp[n] profit
// dp[n] = max(dp[n], dp[n - ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> gsb_A(3), gsb_B(3);
cin >> gsb_A[0] >> gsb_A[1] >> gsb_A[2];
cin >> gsb_B[0] >> gsb_B[1] >> gsb_B[2];
// A -> B
// dp[n] := with n acrons, chokudai can gain dp[n] profit
// dp[n] = max(dp[n], dp[n - ... | replace | 32 | 33 | 32 | 33 | 0 | |
p03009 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
usi... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
usi... | replace | 251 | 262 | 251 | 263 | TLE | |
p03009 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 1e9 + 7;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setpre... | replace | 180 | 181 | 180 | 181 | 0 | |
p03009 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn = 100010;
const ll P = 1000000007;
int n, m, D;
ll ans, n1;
ll f[maxn], s[maxn];
int main() {
scanf("%d%d%d", &n, &m, &D);
int i;
ll tmp = 1;
f[0] = s[0] = 1;
for (i = 1; i <= n; i++)
tmp = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
const int maxn = 1000010;
const ll P = 1000000007;
int n, m, D;
ll ans, n1;
ll f[maxn], s[maxn];
int main() {
scanf("%d%d%d", &n, &m, &D);
int i;
ll tmp = 1;
f[0] = s[0] = 1;
for (i = 1; i <= n; i++)
tmp =... | replace | 5 | 6 | 5 | 6 | 0 | |
p03009 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long fact[1000005];
long long dp[1000005];
const long long MOD = 1e9 + 7;
int main() {
int N, H, D;
scanf("%d%d%d", &N, &H, &D);
long long retainWays = 0;
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i % MOD;
retainWays += f... | #include <bits/stdc++.h>
using namespace std;
long long fact[1000005];
long long dp[1000005];
const long long MOD = 1e9 + 7;
int main() {
int N, H, D;
scanf("%d%d%d", &N, &H, &D);
long long retainWays = 0;
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i % MOD;
retainWays += f... | replace | 39 | 40 | 39 | 40 | 0 | |
p03009 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, x, y) for (register int i = x; i <= y; ++i)
#define repd(i, x, y) for (register int i = x; i >= y; --i)
using namespace std;
typedef long long ll;
template <typename T> inline void read(T &x) {
char c;
int sign = 1;
x = 0;
do {
c = getchar();
if (c == '-')
s... | #include <bits/stdc++.h>
#define rep(i, x, y) for (register int i = x; i <= y; ++i)
#define repd(i, x, y) for (register int i = x; i >= y; --i)
using namespace std;
typedef long long ll;
template <typename T> inline void read(T &x) {
char c;
int sign = 1;
x = 0;
do {
c = getchar();
if (c == '-')
s... | replace | 21 | 22 | 21 | 22 | 0 | |
p03009 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | replace | 32 | 33 | 32 | 33 | 0 | |
p03011 | Python | Runtime Error | s = map(int, input().split())
s.sort()
print(s[0] + s[1])
| s = list(map(int, input().split()))
s.sort()
print(s[0] + s[1])
| replace | 0 | 1 | 0 | 1 | AttributeError: 'map' object has no attribute 'sort' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s230336688.py", line 2, in <module>
s.sort()
AttributeError: 'map' object has no attribute 'sort'
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.