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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03077 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
int main() {
long long A, B, C, D, E, N;
std::cin >> N >> A >> B >> C >> D >> E;
long long M[6] = {A, B, C, D, E, 0};
long long T[6] = {N, 0, 0, 0, 0, 0};
long long time = 0;
while (true) {
if (T[5] == N)
break;
time++;
for (int i = 4; i >= 0; i-... | #include <algorithm>
#include <iostream>
int main() {
long long A, B, C, D, E, N;
std::cin >> N >> A >> B >> C >> D >> E;
long long ans = std::max({(N + A - 1) / A, (N + B - 1) / B, (N + C - 1) / C,
(N + D - 1) / D, (N + E - 1) / E});
std::cout << (ans + 4) << std::endl;
return 0... | replace | 6 | 25 | 6 | 9 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// n回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) /... | replace | 64 | 73 | 64 | 68 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E, F;
cin >> N >> A >> B >> C >> E >> F;
long long shrt = min({A, B, C, D, E, F});
long long ans = (N + shrt - 1) / shrt + 4;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long long shrt = min({A, B, C, D, E});
long long ans = (N + shrt - 1) / shrt + 4;
cout << ans << endl;
} | replace | 5 | 8 | 5 | 8 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int64_t F = min(A, min(B, min(C, min(D, min(E, F)))));
if (N % F == 0) {
cout << N / F + 4 << endl;
} else {
cout << N / F + 5 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
int64_t F = min(A, min(B, min(C, min(D, E))));
if (N % F == 0) {
cout << N / F + 4 << endl;
} else {
cout << N / F + 5 << endl;
}
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
using namespace std;
int main(void) {
vector<int> a(6, 0);
long long n, ans = 0, rem = 0;
cin >> n;
for (int i = 0; i < 5; i++) {... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD (long long)1000000007
using namespace std;
int main(void) {
vector<long long> a(5);
long long n, ans = 0;
cin >> n;
for (int i = 0; i < 5; i++) {
c... | replace | 12 | 14 | 12 | 14 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | replace | 30 | 65 | 30 | 31 | TLE | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n;
cin >> n;
vector<ll> a(5), b(6, 0);
for (int i = 0; i < 5; i++)
cin >> a.at(i);
b.at(0) = n;
ll t = 0;
while (b.at(5) != n) {
for (int i = 4; i >= 0; i--) {
b.at(i + 1) += min(b.at... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
ll ans = ceil((double)n / min({a, b, c, d, e})) + 4;
cout << ans << endl;
} | replace | 6 | 21 | 6 | 10 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long N, A, B, C, D, E;
int main() {
cin >> N >> A >> B >> C >> D >> E;
long long m = min({A, B, C, D, E});
long long ans = (N / (m - 1)) + 4;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long N, A, B, C, D, E;
int main() {
cin >> N >> A >> B >> C >> D >> E;
long long m = min({A, B, C, D, E});
long long ans;
if (N % m == 0) {
ans = N / m + 4;
} else {
ans = N / m + 5;
}
cout << ans << endl;
} | replace | 7 | 8 | 7 | 13 | 0 | |
p03077 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> a(5);
long long min;
long long time;
long long n;
cin >> n;
for (int i = 0; i < a.size(); i++) {
cin >> a[i];
if (i == 0) {
min = a[i];
} else {
if (min > a[i]) {
min = a[i];
}
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> a(5);
long long min;
long long time;
long long n;
cin >> n;
for (int i = 0; i < a.size(); i++) {
cin >> a[i];
if (i == 0) {
min = a[i];
} else {
if (min > a[i]) {
min = a[i];
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int MIN = min({a, b, c, d, e});
cout << 5 + (n - 1) / MIN;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int MIN = min({a, b, c, d, e});
cout << 5 + (n - 1) / MIN;
}
| insert | 1 | 1 | 1 | 2 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> moves = {-1, A, B, C, D, E};
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
vector<ll> v = {A, B, C, D, E};
sort(v... | replace | 16 | 41 | 16 | 20 | TLE | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> t(5);
for (long long int i = 0; i < 5; i++) {
cin >> t[i];
}
vector<long long int> p(6, 0);
p[0] = n;
long long int ans = 0;
while (p[5] < n) {
for (long long int i = 5; i > 0; i--) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> t(5);
for (long long int i = 0; i < 5; i++) {
cin >> t[i];
}
sort(t.begin(), t.end());
cout << (n + t[0] - 1) / t[0] + 4 << endl;
} | replace | 10 | 21 | 10 | 12 | TLE | |
p03077 | C++ | Runtime Error | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, sizeof(board));
uns... | #include <iostream>
using namespace std;
int MinIndex(const unsigned long long int *const array, const int size);
int main() {
unsigned long long int N;
unsigned long long int board[5];
cin >> N;
for (int i = 0; i < 5; i++)
cin >> board[i];
int bottleNeckIndex = MinIndex(board, 5);
unsigned long l... | replace | 14 | 15 | 14 | 15 | -8 | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef map<int, int> mi;
typedef set<int> si;
#d... | replace | 64 | 65 | 64 | 65 | TLE | |
p03077 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
int main(void) {
int a[5];
long long n, fa[10], fd[10], la[10], ld[10];
cin >> n;
fa[0] = la[0] = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
fd[i] = fa[i];
ld[i] = MAX(la[i], fa[i] + (n - 1) / a[i]);
// ... | #include <iostream>
using namespace std;
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
int main(void) {
long long a[5];
long long n, fa[10], fd[10], la[10], ld[10];
cin >> n;
fa[0] = la[0] = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
fd[i] = fa[i];
ld[i] = MAX(la[i], fa[i] + (n - 1) / a[i]);
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(obj) (v.begin(obj), v... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#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 ALL(obj) (v.begin(obj), v... | insert | 17 | 17 | 17 | 18 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return
// true; } return false; } template<class T> inline bool chmin(T& a, T b) { if
// (a > b) { a = b; return true; } return false; }
/* attention
long longのシフト演算には気をつけよう
... | replace | 15 | 16 | 15 | 16 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = pow(10, 18) + 1;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
templa... | replace | 24 | 89 | 24 | 27 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, A, B, C, D, E;
cin >> N, A, B, C, D, E;
int MIN = min({A, B, C, D, E});
cout << 5 + (N - 1) / MIN << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
long MIN = min({A, B, C, D, E});
cout << 5 + (N - 1) / MIN << endl;
return 0;
}
| replace | 5 | 8 | 5 | 8 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
#define INF 100000000
using namespace std;
int main(void) {
long N;
long trans1[5], trans2[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans1[i];
if (N % trans1[i] != 0) {
trans2[i] = N / trans1[i] + 1;
} els... | #include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
#define INF 100000000
using namespace std;
int main(void) {
long N;
long trans1[5], trans2[5];
cin >> N;
for (int i = 0; i < 5; i++) {
cin >> trans1[i];
if (N % trans1[i] != 0) {
trans2[i] = N / trans1[i] + 1;
} els... | replace | 17 | 19 | 17 | 19 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<int> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove)... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
vector<ll> a(5);
cin >> n;
rep(i, 5) cin >> a[i];
ll minmove = *std::min_element(a.begin(), a.end());
ll ans = ((n + minmove - 1) / minmove) ... | replace | 8 | 9 | 8 | 9 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b) {
if (a < b) {
return a;
} else {
return b;
}
}
long long int fivemin(long long int a, long long int b, long long int c,
long long int d, long long int e) {
return min(min(min(a, b),... | #include <bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b) {
if (a < b) {
return a;
} else {
return b;
}
}
long long int fivemin(long long int a, long long int b, long long int c,
long long int d, long long int e) {
return min(min(min(a, b),... | replace | 23 | 72 | 23 | 26 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[5];
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
sort(a, a + 5);
cout << (n - 1) / a[0] + 5 << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[5]; // cout<<"unko"<<endl;
for (int i = 0; i < 5; i++) {
cin >> a[i]; // cout<<a[i]<<endl;
}
sort(a, a + 5);
if (n % a[0] != 0)
cout << n / a[0] + 5 << endl;
else
cout << n / a[0] + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[5]; // cout<<"unko"<<endl;
for (int i = 0; i < 5; i++) {
cin >> a[i]; // cout<<a[i]<<endl;
}
sort(a, a + 5);
if (n % a[0] != 0)
cout << n / a[0] + 5 << endl;
else
cout << n / a[0] + 4 << e... | replace | 6 | 7 | 6 | 7 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d;
cout << (n / min({a, b, c, d, e})) + 4 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (n + min({a, b, c, d, e}) - 1) / min({a, b, c, d, e}) + 4 << endl;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll a, b, c, d, e;
cin >> a, b, c, d, e;
ll m = min(a, min(b, min(c, min(d, e))));
ll ans = 4 + (n + m - 1) / m;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
ll m = min(a, min(b, min(c, min(d, e))));
ll ans = 4 + (n + m - 1) / m;
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | replace | 41 | 69 | 41 | 47 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;
... | delete | 61 | 62 | 61 | 61 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
const ll MOD = 1e9 + 7;
const ll INF = 1 << 29;
int main() {
ll N;
std::cin >> N;
std::vector<int> capacities(5);
auto min = 1000000000000000... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define ll long long
const ll MOD = 1e9 + 7;
const ll INF = 1 << 29;
int main() {
ll N;
std::cin >> N;
std::vector<ll> capacities(5);
auto min = 10000000000000000;... | replace | 17 | 19 | 17 | 18 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint, vector<llint>, greater<llint>> que;
priority_queue<llint> Que;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
re... | replace | 27 | 34 | 27 | 34 | TLE | |
p03077 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
int main() {
ll n;
cin >> n;
vector<int> a(5);
rep(i, 5) cin >> a[i];
ll mina = *min_element(ALL(a));
cout << ((n + mina - 1) / mina) + 4 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
int main() {
ll n;
cin >> n;
vector<ll> a(5);
rep(i, 5) cin >> a[i];
ll mina = *min_element(ALL(a));
cout << ((n + mina - 1) / mina) + 4 << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | replace | 18 | 19 | 18 | 19 | 0 | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
int64_t cntn = n, cnta = 0, cntb = 0, cntc = 0, cntd = 0, cnte = 0, ans = 0;
while (cnte < n) {
cnte += min(cntd, e);
cntd -= min(cntd, e);
cntd += min(cntc, d);
cntc -= min(c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, a, b, c, d, e;
cin >> n >> a >> b >> c >> d >> e;
cout << (int64_t)ceil((double)n / min(a, min(b, min(c, min(d, e))))) + 4;
} | replace | 6 | 21 | 6 | 7 | TLE | |
p03077 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int main() {
long long a[10];
long long b[10];
long long count = 0;
memset(b, 0, sizeof(b));
long long n;
scanf("%lld", &n);
for (int i = 0; i < 5; i++) {
scanf("%lld", &a[i]);
}
b[0] = n;
while (b[0] + b[1] + b[2] + b[3] + b[4] !... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
int main() {
long long N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >> E;
cout << max({(N - 1) / A, (N - 1) / B, (N - 1) / C, (N - 1) / D,
(N - 1) / E}) +
5
<< endl;
return 0;
}
| replace | 5 | 30 | 5 | 13 | TLE | |
p03077 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | replace | 68 | 70 | 68 | 70 | 0 | |
p03077 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
int n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
rtn... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<long long> city(5, 0);
long long n;
cin >> n;
for (int i = 0; i < 5; i++)
cin >> city[i];
sort(city.begin(), city.end());
long long rtn = 0;
if (n % city[0] == 0) {
rtn += n / city[0];
} else {
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
ll a[1001], b[1001], c[1001];
int x, y, z, k;
ll st1[1000001], st2[1000001];
int main() {
cin >> x >> y >> z >> ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
ll a[1001], b[1001], c[1001];
int x, y, z, k;
ll st1[3000001], st2[3000001];
int main() {
cin >> x >> y >> z >> ... | replace | 10 | 11 | 10 | 11 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long lo... | insert | 443 | 443 | 443 | 447 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i ... | replace | 58 | 59 | 58 | 59 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w){};
};
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, containe... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to; // 辺の行き先
int weight; // 辺の重み
edge(int t, int w) : to(t), weight(w){};
};
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define erep(i, containe... | replace | 51 | 53 | 51 | 53 | TLE | |
p03078 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | replace | 42 | 43 | 42 | 43 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
inline char tc() {
static char fl[100], *A = fl, *B = fl;
return A == B && (B = (A = fl) + fread(fl, 1, 100, stdin), A == B) ? EOF
... | #include <algorithm>
#include <bitset>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
inline char tc() {
static char fl[100], *A = fl, *B = fl;
return A == B && (B = (A = fl) + fread(fl, 1, 100, stdin), A == B) ? EOF
... | replace | 55 | 56 | 55 | 56 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sta... | replace | 70 | 71 | 70 | 71 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long f(vector<vector<long long>> cake, vector<int> pos) {
long long sum = 0;
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long f(vector<vector<long long>> cake, vector<int> pos) {
long long sum = 0;
... | replace | 68 | 70 | 68 | 69 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL a[1005], b[1005], c[1005];
vector<LL> ans;
int main() {
LL x, y, z, k;
while (cin >> x >> y >> z >> k) {
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
LL a[1005], b[1005], c[1005];
vector<LL> ans;
int main() {
LL x, y, z, k;
while (cin >> x >> y >> z >> k) {
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
... | replace | 23 | 24 | 23 | 27 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) (x).begin(), (x).end()
// ** Solution Number 1
// int main()
// {
// int x,y,z,k;
// cin >> x >> y >> z >> k;
// ll a[x],b[y],c[z];
// for(int i=0;i<x;i++)cin >> a[i];
// for(int i=0;i<y;i++)cin >> b[i];
// for(in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define all(x) (x).begin(), (x).end()
// ** Solution Number 1
// int main()
// {
// int x,y,z,k;
// cin >> x >> y >> z >> k;
// ll a[x],b[y],c[z];
// for(int i=0;i<x;i++)cin >> a[i];
// for(int i=0;i<y;i++)cin >> b[i];
// for(in... | replace | 58 | 60 | 58 | 62 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define al... | replace | 232 | 233 | 232 | 234 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long X, Y, Z, K;
cin >> X >> Y >> Z >> K;
long long A[X], B[Y], C[Z];
for (int i = 0; i < X; i++)
cin >> A[i];
for (int i = 0; i < Y; i++)
cin >> B[i];
for (int i = 0; i < Z; i++)
... | replace | 28 | 29 | 28 | 30 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 99999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end())... | replace | 35 | 40 | 35 | 44 | -11 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll x, y, z, k, a[1005], b[1005], c[1005];
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
ll ab[1000005];
for (i... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll x, y, z, k, a[1005], b[1005], c[1005];
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
ll ab[1000005];
for (i... | replace | 21 | 22 | 21 | 22 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | replace | 53 | 56 | 53 | 58 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
constexpr ll inf = static_cast<ll>(1e17);
constexpr ll mod = static_cast<ll>(1e9 + 7);
int x, y, z, k;
ll a[1005], b[1005], c[1005];
ll sum1[1000005], sum2[1000005];
int num1, num2;
int main() {
std::cin >> x >> y >> z >> k;
for (int i = 0; i < x; ++i)
std::cin >... | #include <bits/stdc++.h>
using ll = long long;
constexpr ll inf = static_cast<ll>(1e17);
constexpr ll mod = static_cast<ll>(1e9 + 7);
int x, y, z, k;
ll a[1005], b[1005], c[1005];
ll sum1[10000005], sum2[10000005];
int num1, num2;
int main() {
std::cin >> x >> y >> z >> k;
for (int i = 0; i < x; ++i)
std::cin... | replace | 8 | 9 | 8 | 9 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi acos(-1.0)
#define INF 0x3f3f3f3f
#define SIZE 200005
#define read(a, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define pi acos(-1.0)
#define INF 0x3f3f3f3f
#define SIZE 200005
#define read(a, n)... | replace | 50 | 51 | 50 | 52 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a =... | replace | 34 | 36 | 34 | 36 | TLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
long long t[100000];
int ti = 0;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
f... | #include <algorithm>
#include <assert.h>
#include <iostream>
using namespace std;
long long t[100000000];
int ti = 0;
int main() {
long long x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for (long long i = 0; i < x; ++i)
cin >> a[i];
for (long long i = 0; i < y; ++i)
cin >> b[i];
... | replace | 5 | 6 | 5 | 6 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n)... | insert | 59 | 59 | 59 | 62 | TLE | |
p03078 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
struct __INIT {
__INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __init;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define MOD 1000000007
#define IN... | replace | 43 | 58 | 43 | 47 | TLE | |
p03078 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
ld EPS = 1e-12;
int INF = numeric_limits<int>::max() / 2;
ll LINF = numeric_limits<ll>::max() / 2;
int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
ld EPS = 1e-12;
int INF = numeric_limits<int>::max() / 2;
ll LINF = numeric_limits<ll>::max() / 2;
int MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i ... | replace | 16 | 17 | 16 | 17 | -11 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
#define INF (1 << 21);
typedef long long ll;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
ll A[1000], B[1000], C[1000];
vector<ll> x;
vector<ll> y;
... | replace | 33 | 34 | 33 | 34 | TLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
vector<long long> A, B, C, AB, ABC;
int X, Y, Z, K;
int main() {
cin >> X >> Y >> Z >> K;
A.resize(X);
B.resize(Y);
C.re... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
vector<long long> A, B, C, AB, ABC;
int X, Y, Z, K;
int main() {
cin >> X >> Y >> Z >> K;
A.resize(X);
B.resize(Y);
C.re... | replace | 35 | 36 | 35 | 37 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int X, Y, Z, K;
vector<long long int> A, B, C, ansList;
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++) {
long long int x;
cin >> x;
A.push_back(x);
}
for (int i = 0; i < Y; i++) {
long long int... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int X, Y, Z, K;
vector<long long int> A, B, C, ansList;
cin >> X >> Y >> Z >> K;
for (int i = 0; i < X; i++) {
long long int x;
cin >> x;
A.push_back(x);
}
for (int i = 0; i < Y; i++) {
long long int... | replace | 37 | 38 | 37 | 41 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long llong;
int main(int argc, const char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<llong> A(X);
vector<llong> B(Y);
vector<llong> C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long llong;
int main(int argc, const char *argv[]) {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<llong> A(X);
vector<llong> B(Y);
vector<llong> C(Z);
for (int i = 0; i < X; i++) {
cin >> A[i];
}
for... | replace | 35 | 36 | 35 | 36 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(a) cout << #a << ": " << a << endl;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
rep(i, X) { cin >> A[i]; }
sort(A.begin(), A.end(), greater<ll>(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define debug(a) cout << #a << ": " << a << endl;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X);
rep(i, X) { cin >> A[i]; }
sort(A.begin(), A.end(), greater<ll>(... | replace | 26 | 27 | 26 | 27 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<long long> as(x), bs(y), cs(z);
for (int i = 0; i < x; i++)
cin >> as[i];
for (int i = 0; i < y; i++)
cin >> bs[i];
for (int i = 0; i < z; i++)
cin >> cs[i];
vector<long long> yz;
yz.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<long long> as(x), bs(y), cs(z);
for (int i = 0; i < x; i++)
cin >> as[i];
for (int i = 0; i < y; i++)
cin >> bs[i];
for (int i = 0; i < z; i++)
cin >> cs[i];
vector<long long> yz;
yz.... | replace | 45 | 46 | 45 | 46 | 0 | nax: 8
|
p03078 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main(int, char **) {
int x, y, z, K;
std::cin >> x >> y >> z >> K;
std::vector<long long> as(x), bs(y), cs(z);
for (int i{}; i < x; ++i) {
std::cin >> as[i];
}
for (int i{}; i < y; ++i) {
std::cin >> bs[i];
}
for (int i{}; i < z; +... | #include <algorithm>
#include <iostream>
#include <vector>
int main(int, char **) {
int x, y, z, K;
std::cin >> x >> y >> z >> K;
std::vector<long long> as(x), bs(y), cs(z);
for (int i{}; i < x; ++i) {
std::cin >> as[i];
}
for (int i{}; i < y; ++i) {
std::cin >> bs[i];
}
for (int i{}; i < z; +... | replace | 27 | 28 | 27 | 28 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | replace | 43 | 45 | 43 | 50 | TLE | |
p03078 | C++ | Runtime Error | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int x, y, z, K;
cin >> x >... | #include <cmath>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main(void) {
int x, y, z, K;
cin >> x >... | replace | 34 | 35 | 34 | 35 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typede... | replace | 117 | 118 | 117 | 118 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int cmp(ll a, ll b) { return a > b; }
ll bc[1000001], ans[1000001];
int main() {
int x, y, z, k, n = 0;
ll a[1001], b[1001], c[1001];
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < y... | #include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
int cmp(ll a, ll b) { return a > b; }
ll bc[1000001], ans[3000001];
int main() {
int x, y, z, k, n = 0;
ll a[1001], b[1001], c[1001];
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < y... | replace | 4 | 5 | 4 | 5 | 0 | |
p03078 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<Int> a(x), b(y), c(z);
for (int i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<Int> a(x), b(y), c(z);
for (int i... | replace | 36 | 37 | 36 | 38 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#inclu... | replace | 86 | 87 | 86 | 87 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
// abc123d cak... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <map> // sort
#include <vector>
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
using namespace std;
// abc123d cak... | replace | 44 | 45 | 44 | 47 | TLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
/... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 1000000000
/... | replace | 49 | 50 | 49 | 50 | -11 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | replace | 91 | 93 | 91 | 94 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, k;
long long cnt, cnt2;
long long a[1005], b[1005], c[1005], w[1000005], p[1000005];
bool cmp(long long x, long long y) { return x > y; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
cin >> x >> y >> z >> k;
for (long lo... | #include <bits/stdc++.h>
using namespace std;
long long x, y, z, k;
long long cnt, cnt2;
long long a[10005], b[10005], c[10005], w[10000005], p[10000005];
bool cmp(long long x, long long y) { return x > y; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();
cin >> x >> y >> z >> k;
for (lo... | replace | 4 | 5 | 4 | 5 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStrin... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toStrin... | replace | 48 | 49 | 48 | 49 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long a[3333], d[1111111];
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++) {
long b;
cin >> b;
for (int j = 0; j < x; j++)
d[i * x + j] = a[j] + b;
}
int l = min(k,... | #include <bits/stdc++.h>
using namespace std;
long a[3333], d[3333333];
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++) {
long b;
cin >> b;
for (int j = 0; j < x; j++)
d[i * x + j] = a[j] + b;
}
int l = min(k,... | replace | 4 | 5 | 4 | 5 | 0 | |
p03078 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
int x, y, z, k;
ll a[2000], b[2000], c[2000];
priority_queue<pair<ll, ll>> temp;
priority_queue<ll> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 1; i <= x; i++)
cin >> a[i];
for (int i = 1; i <= y; i++)
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
int x, y, z, k;
ll a[2000], b[2000], c[2000];
priority_queue<pair<ll, ll>> temp;
priority_queue<ll> q;
int main() {
cin >> x >> y >> z >> k;
for (int i = 1; i <= x; i++)
cin >> a[i];
for (int i = 1; i <= y; i++)
cin >>... | replace | 25 | 26 | 25 | 26 | MLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll X, Y, Z, K;
ll A[1005];
ll B[1005];
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll X, Y, Z, K;
ll A[1005];
ll B[1005];
ll ... | replace | 30 | 41 | 30 | 37 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define P pair<int, int>
#define LL long long
#define LD long double... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define P pair<int, int>
#define LL long long
#define LD long double... | replace | 28 | 29 | 28 | 29 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 29 | 30 | 29 | 33 | TLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, co... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
typedef long long i64;
typedef pair<i64, i64> P;
template <class T> bool chmax(T &a, co... | replace | 35 | 36 | 35 | 36 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define dame ... | replace | 179 | 183 | 179 | 186 | -11 | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int X, Y, Z;
long K;
long A[1000];
long B[1000];
long C[1000];
multiset<long> ansSet;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int X, Y, Z;
long K;
long A[1000];
long B[1000];
long C[1000];
multiset<long> ansSet;
... | replace | 31 | 32 | 31 | 40 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
static ull tenq = 1000000000;
sta... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
static ull tenq = 1000000000;
sta... | replace | 34 | 61 | 34 | 48 | TLE | |
p03078 | Python | Runtime Error | X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ans = []
for x in range(X):
for y in range(Y):
for z in range(Z):
if (x + 1) * (y + 1... | X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
ans = []
for x in range(X):
for y in range(Y):
for z in range(Z):
if (x + 1) * (y + 1... | replace | 17 | 18 | 17 | 18 | TypeError: 'revere' is an invalid keyword argument for sort() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03078/Python/s322698667.py", line 18, in <module>
ans.sort(revere=True)
TypeError: 'revere' is an invalid keyword argument for sort()
|
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
c... | replace | 53 | 56 | 53 | 56 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rg register
#define ll long long
using namespace std;
const int N = 1e3 + 5, mod = 1e9 + 7;
int n, m, T, k, ans, len;
ll a[N], b[N], c[N], d[N], t[N];
bool cmp(ll x, ll y) { return x > y; }
int main() {
ll ans = 0;
priority_queue<pair<ll, ll>> q;
int x, y, z, k, temp = 0;
cin >>... | #include <bits/stdc++.h>
#define rg register
#define ll long long
using namespace std;
const int N = 1e3 + 5, mod = 1e9 + 7;
int n, m, T, k, ans, len;
ll a[N], b[N], d[N], t[N];
ll c[1000005];
bool cmp(ll x, ll y) { return x > y; }
int main() {
ll ans = 0;
priority_queue<pair<ll, ll>> q;
int x, y, z, k, temp = 0;... | replace | 6 | 7 | 6 | 8 | 0 | |
p03078 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[1000], b[1000], c[1000];
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
sort... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[1000], b[1000], c[1000];
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
sort... | replace | 30 | 31 | 30 | 31 | TLE | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
r... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a[1005], b[1005], c[1005];
int x, y, z, k;
cin >> x >> y >> z >> k;
for (int i = 0; i < x; i++)
cin >> a[i];
for (int i = 0; i < y; i++)
cin >> b[i];
for (int i = 0; i < z; i++)
cin >> c[i];
sort(a, a + x);
r... | replace | 28 | 29 | 28 | 29 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for (... | replace | 48 | 51 | 48 | 53 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sor... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<long long> xx(X), yy(Y), zz(Z);
for (int i = 0; i < X; ++i)
cin >> xx[i];
sort(all(xx), greater<long long>());
for (int i = 0; i < Y; ++i)
cin >> yy[i];
sor... | replace | 22 | 23 | 22 | 23 | 0 | |
p03078 | C++ | Time Limit Exceeded | #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 repi(i, a, b) for (int i = (a); i < int(b); i++)
#define all(a) (a).beg... | #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 repi(i, a, b) for (int i = (a); i < int(b); i++)
#define all(a) (a).beg... | insert | 73 | 73 | 73 | 74 | TLE | |
p03078 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using ... | replace | 328 | 331 | 328 | 331 | TLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define... | replace | 46 | 47 | 46 | 47 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) ... | replace | 267 | 268 | 267 | 268 | 0 | |
p03078 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (... | replace | 36 | 40 | 36 | 45 | MLE | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> vecx(x, 0), vecy(y, 0), vecz(z, 0), vectemp(x * y, 0),
ans(max(x * y, 3000) * z, 0);
for (int i = 0; i < x; i++) {
cin >> ve... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
// Your code here!
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<long long> vecx(x, 0), vecy(y, 0), vecz(z, 0), vectemp(x * y, 0),
ans(min(x * y, 3000) * z, 0);
for (int i = 0; i < x; i++) {
cin >> ve... | replace | 10 | 11 | 10 | 11 | 0 | |
p03078 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long x[1005], y[1005], z[1005], xyz[3010], X, Y, Z, K;
bool cmp(const long long &x, const long long &y) { return x > y; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> X >> Y >> Z >> K;
for (int i = 1; i <= X; i++)
cin >> x[i];
... | #include <bits/stdc++.h>
using namespace std;
long long x[1005], y[1005], z[1005], xyz[3000010], X, Y, Z, K;
bool cmp(const long long &x, const long long &y) { return x > y; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> X >> Y >> Z >> K;
for (int i = 1; i <= X; i++)
cin >> x[i... | replace | 3 | 4 | 3 | 4 | 0 | |
p03078 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
typedef long long ll;
int X, Y, Z, K;
std::vector<ll> A, B, C;
bool judge(ll P) {
ll rtn = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (A[i] + B[j] + C... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
typedef long long ll;
int X, Y, Z, K;
std::vector<ll> A, B, C;
bool judge(ll P) {
ll rtn = 0;
for (int i = 0; i < X; i++) {
for (int j = 0; j < Y; j++) {
for (int k = 0; k < Z; k++) {
if (A[i] + B[j] + C... | replace | 44 | 45 | 44 | 45 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.