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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
int64_t N, M, K;
cin >> N >> M >> K;
vector<int64_t> A(N), B(M);
for (int64_t i = 0; i < N; i++) {
cin >> A[i];
}
for (int64_t i = 0; i < M; i++) {
cin >> B[i];
}
// calculation
vector<int64_t> sum_A(N + 1), sum_B(M + 1);... | #include <bits/stdc++.h>
using namespace std;
int main() {
// input
int64_t N, M, K;
cin >> N >> M >> K;
vector<int64_t> A(N), B(M);
for (int64_t i = 0; i < N; i++) {
cin >> A[i];
}
for (int64_t i = 0; i < M; i++) {
cin >> B[i];
}
// calculation
vector<int64_t> sum_A(N + 1), sum_B(M + 1);... | replace | 33 | 34 | 33 | 38 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | replace | 36 | 39 | 36 | 42 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
int main(int argc, char const *argv[]) {
int n, m, k;
cin >> n >> m >> k;
long long int a, b, c[20010], d[20010];
c[0] = 0;
rep(i, n) {
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
int main(int argc, char const *argv[]) {
int n, m, k;
cin >> n >> m >> k;
long long int a, b, c[200010], d[200010];
c[0] = 0;
rep(i, n) {
cin ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int, int> pii;
typedef pair<long long, int> pli;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int, int> pii;
typedef pair<long long, int> pli;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define... | replace | 42 | 43 | 42 | 43 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ull = unsigned long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define For(i, s, n) for (int i = s; i < (int)(n); ++i)
int main() {
ull N, M, K;
cin >> N >> M >> K;
vector<ull> As(N + 1);
vector<ull> Bs(M +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ull = unsigned long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define For(i, s, n) for (int i = s; i < (int)(n); ++i)
int main() {
ull N, M, K;
cin >> N >> M >> K;
vector<ull> As(N + 1);
vector<ull> Bs(M +... | replace | 38 | 42 | 38 | 45 | TLE | |
p02623 | C++ | Runtime Error |
// Problem : C - Tsundoku
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define max3(a, b, c)... |
// Problem : C - Tsundoku
// Contest : AtCoder - AtCoder Beginner Contest 172
// URL : https://atcoder.jp/contests/abc172/tasks/abc172_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define max3(a, b, c)... | replace | 163 | 164 | 163 | 164 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define ubo upper_bound
#define lbo lower_bound
#define VI vector<int>
#define VL vector<ll>
#define VP vector<pii>
#define a... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define ubo upper_bound
#define lbo lower_bound
#define VI vector<int>
#define VL vector<ll>
#define VP vector<pii>
#define a... | replace | 39 | 40 | 39 | 40 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100123
#define ll long long
#define endl '\n'
using namespace std;
int n, m, ans, curr;
ll k, a[N], b[N];
void print_vetor(ll v[], int size) {
for (int i = 0; i < size; ++i) {
cout << v[i] << ' ';
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n ... | #include <bits/stdc++.h>
#define N 200123
#define ll long long
#define endl '\n'
using namespace std;
int n, m, ans, curr;
ll k, a[N], b[N];
void print_vetor(ll v[], int size) {
for (int i = 0; i < size; ++i) {
cout << v[i] << ' ';
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n ... | replace | 1 | 2 | 1 | 2 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define eb em... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define eb em... | replace | 93 | 94 | 93 | 94 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | replace | 48 | 49 | 48 | 49 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define re register
#define int long long
using namespace std;
inline int read() {
re int ans = 0;
re bool f = 1;
re char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ans = (ans << 3) + (an... | #include <bits/stdc++.h>
#define re register
#define int long long
using namespace std;
inline int read() {
re int ans = 0;
re bool f = 1;
re char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
ans = (ans << 3) + (an... | replace | 29 | 50 | 29 | 34 | TLE | |
p02623 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int... | replace | 0 | 1 | 0 | 1 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class S, class T> using P = pair<S, T>;
using ll = long long;
using ull = unsigned long long;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
usi... | replace | 293 | 294 | 293 | 294 | 0 | |
p02623 | Python | Time Limit Exceeded | def main():
n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [A[0]]
sum_B = [B[0]]
for i in range(n - 1):
sum_A.append(sum_A[i] + A[i + 1])
for i in range(m - 1):
sum_B.append(sum_B[i] + B[i + 1])
R = ... | def main():
n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_A = [A[0]]
sum_B = [B[0]]
for i in range(n - 1):
sum_A.append(sum_A[i] + A[i + 1])
for i in range(m - 1):
sum_B.append(sum_B[i] + B[i + 1])
R = ... | delete | 32 | 33 | 32 | 32 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fsp(x) fixed << setprecision(x)
#define xout cerr
const ll inf = LLONG_MAX;
const long double pi = acosl(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fsp(x) fixed << setprecision(x)
#define xout cerr
const ll inf = LLONG_MAX;
const long double pi = acosl(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout ... | replace | 60 | 61 | 60 | 61 | 0 | |
p02623 | Python | Runtime Error | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
a.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i]... | def main():
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i]... | replace | 9 | 10 | 9 | 10 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02623/Python/s656972231.py", line 26, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02623/Python/s656972231.py", line 10, in main
a.append(b[i] + B[i])
IndexError... |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
usin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
usin... | replace | 129 | 130 | 129 | 130 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
// const int INF = 0x3f3f3f3f;
// const int mod=1e9+7;
// const double pi=3.14159265359;
// ########################################... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
// const int INF = 0x3f3f3f3f;
// const int mod=1e9+7;
// const double pi=3.14159265359;
// ########################################... | replace | 41 | 46 | 41 | 43 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | replace | 43 | 44 | 43 | 44 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fl(i, n) for (i = 0; i < n; i++)
#define fld(i, a, b) for (i = a; i > b; i--)
#define fli(i, a, n) for (i = a; i < n; i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 998244353
#define all(x) x.begin(), x.end()
#define spee... | #include <bits/stdc++.h>
#define ll long long
#define fl(i, n) for (i = 0; i < n; i++)
#define fld(i, a, b) for (i = a; i > b; i--)
#define fli(i, a, n) for (i = a; i < n; i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define mod 998244353
#define all(x) x.begin(), x.end()
#define spee... | replace | 24 | 26 | 24 | 26 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO \
ios_base::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
#define pb emplace_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define FIO \
ios_base::sync_with_s... | replace | 33 | 34 | 33 | 34 | 0 | |
p02623 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT++)... | // #define _GLIBCXX_DEBUG
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define rep0(TMS) for (int CNT = 0; CNT < (int)(TMS); CNT++)
#define rep(CNT, GOAL) for (int CNT = 0; CNT < (int)(GOAL); CNT... | replace | 0 | 1 | 0 | 1 | TLE | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
int m, n;
ll k;
vector<ll> a, b;
int main() {
int bkmax = 0;
int amax, bmax;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD 1000000007LL
int m, n;
ll k;
vector<ll> a, b;
int main() {
int bkmax = 0;
int amax, bmax;
... | replace | 60 | 62 | 60 | 62 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, m, k, a[200001], b[200001], A, ans, L;
vector<ll> v, u;
int main(void) {
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
v.push_back(0);
u.push_back(0);
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, m, k, a[200001], b[200001], A, ans, L;
vector<ll> v, u;
int main(void) {
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
v.push_back(0);
u.push_back(0);
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int read() {
int x = 0, f = 1;
char ch = ' ';
while (!isdigit(ch)) {
ch = getchar();
if (ch == '-')
f = -1;
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x * f;
}
ll a[100005], b[100005],... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int read() {
int x = 0, f = 1;
char ch = ' ';
while (!isdigit(ch)) {
ch = getchar();
if (ch == '-')
f = -1;
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x * f;
}
ll a[200005], b[200005],... | replace | 15 | 16 | 15 | 16 | 0 | |
p02623 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, M, K;
cin >> N >> M >> K;
vector<long long> A(N), AS(N + 1, 0), B(M), BS(M + 1, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
AS[i + 1] = AS[i] + A[i];
}
for (int i = 0; i < M; ++i) {
cin >> B[i];
BS[i ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, M, K;
cin >> N >> M >> K;
vector<long long> A(N), AS(N + 1, 0), B(M), BS(M + 1, 0);
for (int i = 0; i < N; ++i) {
cin >> A[i];
AS[i + 1] = AS[i] + A[i];
}
for (int i = 0; i < M; ++i) {
cin >> B[i];
BS[i ... | replace | 22 | 23 | 22 | 23 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll
using namespace std;
long long A[100002], B[100002];
int main() {
long long n, m, ms;
cin >> n >> m >> ms;
for (int A_i = 0; A_i < n; A_i++) {
cin >> A[A_i];
}
for (int B_i = 0; B_i < m; B_i++) {
cin >> B[B_i];
}
long long sum = 0;
long long x = 0, y = 0;... | #include <bits/stdc++.h>
#define ll
using namespace std;
long long A[200000], B[200000];
int main() {
long long n, m, ms;
cin >> n >> m >> ms;
for (int A_i = 0; A_i < n; A_i++) {
cin >> A[A_i];
}
for (int B_i = 0; B_i < m; B_i++) {
cin >> B[B_i];
}
long long sum = 0;
long long x = 0, y = 0;... | replace | 4 | 5 | 4 | 5 | 0 | |
p02623 | Python | Runtime Error | # f = open('test.txt')
f = open("b11.txt")
n, m, k = map(int, f.readline().split())
a = list(map(int, f.readline().split()))
b = list(map(int, f.readline().split()))
a_sum = [0]
b_sum = [0]
cnt = 0
best_b = m
confirm = ()
for i in a:
a_sum.append(i + a_sum[-1])
for i in b:
b_sum.append(i + b_sum[-1])
for a_... | n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_sum = [0]
b_sum = [0]
cnt = 0
best_b = m
confirm = ()
for i in a:
a_sum.append(i + a_sum[-1])
for i in b:
b_sum.append(i + b_sum[-1])
for a_idx in range(n + 1):
if a_sum[a_idx] > k:
brea... | replace | 0 | 5 | 0 | 3 | FileNotFoundError: [Errno 2] No such file or directory: 'b11.txt' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02623/Python/s627350326.py", line 2, in <module>
f = open('b11.txt')
FileNotFoundError: [Errno 2] No such file or directory: 'b11.txt'
|
p02623 | Python | Runtime Error | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
j = m
for i in range(n + 1):
if a[0] > k:
break
while b[j] > k - a[i]:
j -... | n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]
b = [0]
for i in range(n):
a.append(a[i] + A[i])
for i in range(m):
b.append(b[i] + B[i])
ans = 0
j = m
for i in range(n + 1):
if a[i] > k:
break
while b[j] > k - a[i]:
j -... | replace | 12 | 13 | 12 | 13 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02623/Python/s808740023.py", line 15, in <module>
while b[j] > k - a[i]:
IndexError: list index out of range
|
p02623 | Python | Runtime Error | # -*- coding: utf-8 -*-
# 標準入力を取得
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 求解処理
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for j in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
... | # -*- coding: utf-8 -*-
# 標準入力を取得
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# 求解処理
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for j in range(M):
b.append(b[j] + B[j])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
... | replace | 11 | 12 | 11 | 12 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02623/Python/s326586538.py", line 12, in <module>
b.append(b[i] + B[i])
IndexError: list index out of range
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>... | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>... | replace | 56 | 57 | 56 | 57 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
int main() {
ll N, M, K;
cin >> N >> M >> K;
vector<ll> A(N), B(M);
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> B.at(i);
ll ans = 0, i = 0, j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
int main() {
ll N, M, K;
cin >> N >> M >> K;
vector<ll> A(N), B(M);
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> B.at(i);
ll ans = 0, i = 0, j... | replace | 16 | 17 | 16 | 21 | 0 | |
p02623 | C++ | Runtime Error | #define DEBUG 1
#include <bits/stdc++.h>
using namespace std;
typedef char s8;
typedef unsigned char u8;
typedef short s16;
typedef unsigned short u16;
typedef int s32;
typedef unsigned int u32;
typedef long int s64;
typedef unsigned long int u64;
typedef float f32;
typedef double f64;
#define rep(_i, _n) for (int _i =... | #define DEBUG 1
#include <bits/stdc++.h>
using namespace std;
typedef char s8;
typedef unsigned char u8;
typedef short s16;
typedef unsigned short u16;
typedef int s32;
typedef unsigned int u32;
typedef long int s64;
typedef unsigned long int u64;
typedef float f32;
typedef double f64;
#define rep(_i, _n) for (int _i =... | replace | 45 | 46 | 45 | 46 | 0 | |
p02623 | C++ | Runtime Error | #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 | 40 | 41 | 40 | 41 | 0 | |
p02623 | Python | Runtime Error | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = [0]
for i in range(N):
A_sum.append(A_sum[i] + A[i])
B_sum = [0]
for i in range(N):
B_sum.append(B_sum[i] + B[i])
B_sum.append(10**10)
res = 0
for i in range(len(A_sum)):
low = 0
high = ... | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = [0]
for i in range(N):
A_sum.append(A_sum[i] + A[i])
B_sum = [0]
for i in range(M):
B_sum.append(B_sum[i] + B[i])
B_sum.append(10**10)
res = 0
for i in range(len(A_sum)):
low = 0
high = ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02623 | Python | Runtime Error | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
b_sum = 0
for i in range(M):
b_sum += B[i]
if b_sum > K:
b_sum -= B[i]
j = i - 1
break
result = j + 1
a_sum = 0
for i in range(N):
a_sum += A[i]
if a_sum > K:
bre... | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
b_sum = 0
for i in range(M):
b_sum += B[i]
if b_sum > K:
b_sum -= B[i]
j = i - 1
break
else:
j = M - 1
result = j + 1
a_sum = 0
for i in range(N):
a_sum += A[i]
if a_... | insert | 11 | 11 | 11 | 13 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifdef TarekHasan
freopen("input.txt","r",stdin);
#endif // TarekHasan*/
int n, m, k;
cin >> n >> m >> k;
vector<long long int> first(n);
vector<long long int> second(m);
for (int i = 0; i < n; i++)
cin >> first[i];
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
/*#ifdef TarekHasan
freopen("input.txt","r",stdin);
#endif // TarekHasan*/
int n, m, k;
cin >> n >> m >> k;
vector<long long int> first(n);
vector<long long int> second(m);
for (int i = 0; i < n; i++)
cin >> first[i];
for (int i = 0... | replace | 59 | 60 | 59 | 60 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define l long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define M1 1000000007
#define M2 998244353
#define ww while
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define bfl(i, a, b) for (ll i =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define l long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define M1 1000000007
#define M2 998244353
#define ww while
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define bfl(i, a, b) for (ll i =... | replace | 114 | 115 | 114 | 115 | 0 | |
p02623 | C++ | Runtime Error | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define ... | #ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define ... | replace | 57 | 58 | 57 | 58 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define ll int64_t
... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define ll int64_t
... | replace | 23 | 34 | 23 | 35 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define debug()... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#define dout cout
#define debug() if (true)
#define dvout(v) vout(v)
#else
#define dout \
if (false) \
cout
#define debug()... | replace | 49 | 53 | 49 | 61 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define inlld(x) scanf("%lld", &x)
#define ind(x) scanf("%d", &x)
#define inlld2(x, y) scanf("%lld%lld", &x, &y)
#define inlld3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z)
#define ind2(x, y) scanf("%d%d", &x, &y)
#define ... | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define inlld(x) scanf("%lld", &x)
#define ind(x) scanf("%d", &x)
#define inlld2(x, y) scanf("%lld%lld", &x, &y)
#define inlld3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z)
#define ind2(x, y) scanf("%d%d", &x, &y)
#define ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
namespace IO {
template <typename T> inline void read(T &x) {
int f = 1;
x = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
namespace IO {
template <typename T> inline void read(T &x) {
int f = 1;
x = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); ... | replace | 58 | 60 | 58 | 60 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1);
rep1(i, n) {
if (i == 1)
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1);
rep1(i, n) {
if (i == 1)
cin >> a[i];
... | replace | 30 | 35 | 30 | 40 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define rep(i,... | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define rep(i,... | replace | 44 | 45 | 44 | 45 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
long long int n, m, k;
std::cin >> n >> m >> k;
std::vector<long long int> a(n); // size
std::vector<long long int> b(m); // size
for (int i = 0; i < n; i++)
std::cin >> a[i];
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
long long int n, m, k;
std::cin >> n >> m >> k;
std::vector<long long int> a(n); // size
std::vector<long long int> b(m); // size
for (int i = 0; i < n; i++)
std::cin >> a[i];
for ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, m, a, b, ans = 0, k;
cin >> n >> m >> k;
vector<ll> suma(n + 10), su... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll n, m, a, b, ans = 0, k;
cin >> n >> m >> k;
vector<ll> suma(n + 10), su... | replace | 16 | 17 | 16 | 17 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M, K;
cin >> N >> M >> K;
int m = 1;
while (m < M)
m *= 2;
vector<int> A(N + 1), B(M + 1);
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
}
for (int i = 0; i < M; i++) {
cin >> B[... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N, M, K;
cin >> N >> M >> K;
int m = 1;
while (m < M)
m *= 2;
vector<int> A(N + 1), B(M + 1);
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
}
for (int i = 0; i < M; i++) {
cin >> B[... | replace | 20 | 38 | 20 | 25 | 0 | |
p02623 | 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 rep2(i, m, n) for (int i = m; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, m, n) for (int i = m; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> void chmin(T &a, const T &b) noexcept {
if (b < a)
a = b;
}
template <class T> void chmax... | replace | 58 | 59 | 58 | 59 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | replace | 19 | 20 | 19 | 20 | 0 | |
p02623 | C++ | Runtime Error | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loopinc(i, a, b, inc) for (int i = a; i < (b); i += inc)
#define loop(i, a, b) fo... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loopinc(i, a, b, inc) for (int i = a; i < (b); i += inc)
#define loop(i, a, b) fo... | replace | 73 | 74 | 73 | 74 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1, mod), b... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1, mod), b... | replace | 17 | 19 | 17 | 19 | -6 | malloc(): corrupted top size
|
p02623 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
ll k;
vector<ll> a, b;
cin >> n >> m >> k;
a.resize(n);
b.resize(m);
vector<ll> sum_a(n + 1, 0);
vector<ll> sum_b(n + 1, 0);
for (int i = 0; i < n; i++) {
ci... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
ll k;
vector<ll> a, b;
cin >> n >> m >> k;
a.resize(200006);
b.resize(200006);
vector<ll> sum_a(200006, 0);
vector<ll> sum_b(200006, 0);
for (int i = 0; i < n; i... | replace | 11 | 15 | 11 | 15 | 0 | |
p02623 | C++ | Runtime Error | /*note:- in first sight it seems that it will be solved with greddy techniqe
(but that is wrong as it will give wrong ans).*/
/*4 3 270
100 10 10 10
90 90 90
using greedy approach we will be able to read only three books in the above test
case(and it will consume entire 270 minutes) but actually we can read 4 books
(in... | /*note:- in first sight it seems that it will be solved with greddy techniqe
(but that is wrong as it will give wrong ans).*/
/*4 3 270
100 10 10 10
90 90 90
using greedy approach we will be able to read only three books in the above test
case(and it will consume entire 270 minutes) but actually we can read 4 books
(in... | replace | 20 | 21 | 20 | 21 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long n, m, k;
vector<long> a, b;
vector<long long> sumA, sumB;
long getB(long inA) {
long long passedTime = 0;
if (inA != 0)
passedTime = sumA[inA - 1];
long long remainTime = k - passedTime;
long ret = 0;
for (long i = 0; i < m; i++) {
if (sumB[i] <= rema... | #include <bits/stdc++.h>
using namespace std;
long n, m, k;
vector<long> a, b;
vector<long long> sumA, sumB;
long getB(long inA) {
long long passedTime = 0;
if (inA != 0)
passedTime = sumA[inA - 1];
long long remainTime = k - passedTime;
long ret = 0;
// for(long i = 0; i < m; i++){
// if(sumB[i]<=r... | replace | 11 | 18 | 11 | 22 | TLE | |
p02623 | C++ | Runtime Error | /*
* Author: Arpit Bhayani
* https://arpitbhayani.me
*/
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define MI... | /*
* Author: Arpit Bhayani
* https://arpitbhayani.me
*/
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define MI... | replace | 35 | 37 | 35 | 37 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL);
#define int long long
#define all(c) (c).begin(), (c).end()
#define endl '\n'
using namespace std;
// ... | #include <bits/stdc++.h>
#define fast \
std::ios::sync_with_stdio(false); \
cin.tie(NULL);
#define int long long
#define all(c) (c).begin(), (c).end()
#define endl '\n'
using namespace std;
// ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02623 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int i, ans, ia, ib = 0;
ll n, m, k, A, B;
cin >> n >> m >> k;
vector<ll> a(n + 1);
vector<ll> b(m + 1);
for (i = 1; i < n + 1; ++i) {
cin >> A;
a.at(i) = a.at(i - 1) + A;
}
for (i = 1; i < m + 1; ++i) ... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int i, ans, ia, ib = 0;
ll n, m, k, A, B;
cin >> n >> m >> k;
vector<ll> a(n + 1);
vector<ll> b(m + 1);
for (i = 1; i < n + 1; ++i) {
cin >> A;
a.at(i) = a.at(i - 1) + A;
}
for (i = 1; i < m + 1; ++i) ... | replace | 19 | 20 | 19 | 20 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i, a, b) for (lli i = a; i < b; i++)
#define bfr(i, a, b) for (lli i = a; i >= b; i-... | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define lli long long int
#define fr(i, a, b) for (lli i = a; i < b; i++)
#define bfr(i, a, b) for (lli i = a; i >= b; i-... | replace | 46 | 47 | 46 | 47 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vec a(n + 1), b(m + 1);
for (ll i = 0; i < n; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vec a(n + 1), b(m + 1);
for (ll i = 0; i < n; ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
int main() {
int ... | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
int main() {
int ... | replace | 24 | 26 | 24 | 26 | -6 | free(): invalid size
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M, K;
cin >> N >> M >> K;
vector<int> A(N), B(M);
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < M; ++i)
cin >> B[i];
vector<ll> sumA(N + 1, 0), sumB(M + 1, 0);
for (int i = 0; i < N; ++i)
su... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M, K;
cin >> N >> M >> K;
vector<int> A(N), B(M);
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int i = 0; i < M; ++i)
cin >> B[i];
ll sumA = 0;
int ia = 0;
ll sumB = 0;
int ib = 0;
while (ia < N && sumA... | replace | 12 | 24 | 12 | 26 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n, m, k;
int main() {
scanf("%d%d%d", &n, &m, &k);
vector<ll> a(n + 1, 0);
vector<ll> b(n + 1, 0);
for (int i = 1, x; i <= n; ++i)
scanf("%d", &x), a[i] = a[i - 1] + x;
for (int i = 1, x; i <= m; ++i)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n, m, k;
int main() {
scanf("%d%d%d", &n, &m, &k);
vector<ll> a(n + 1, 0);
vector<ll> b(m + 1, 0);
for (int i = 1, x; i <= n; ++i)
scanf("%d", &x), a[i] = a[i - 1] + x;
for (int i = 1, x; i <= m; ++i)
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 // 1e4
#define base10_5 100000 // 1e5
#define base10_6 1000000 // 1e6
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
using namespace std;
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000 // 1e4
#define base10_5 100000 // 1e5
#define base10_6 1000000 // 1e6
... | insert | 75 | 75 | 75 | 77 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie... | replace | 42 | 43 | 42 | 43 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
typedef long double ld;... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
typedef long double ld;... | replace | 82 | 83 | 82 | 83 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n, m) for (int i = (n); i >= (m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n, m) for (int i = (n); i >= (m); --i)
using namespace std;
using LL = long long;
using LD = long double;
using PLL = pair<long long, long long>;
using PLD = pair<long double, long double>;
using VLL = vector<long long>;
using VLD ... | replace | 40 | 41 | 40 | 41 | TLE | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int N, M, K;
vector<int> A, B;
int main() {
cin >> N >> M >> K;
A.resize(N);
B.resize(N);
for (int i = 0; i < N; i++)
cin >... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int N, M, K;
vector<int> A, B;
int main() {
cin >> N >> M >> K;
A.resize(N);
B.resize(M);
for (int i = 0; i < N; i++)
cin >... | replace | 17 | 18 | 17 | 18 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string... | replace | 79 | 82 | 79 | 84 | 0 | 3
2
2
1
|
p02623 | C++ | Runtime Error | #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 | 27 | 28 | 27 | 28 | 0 | |
p02623 | C++ | Runtime Error | // よるかつ
// 前に解説ACしたから今度は自力で
// 尺取り解法
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
// const ll INF = 1000000000000000000LL;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n)... | // よるかつ
// 前に解説ACしたから今度は自力で
// 尺取り解法
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
// const ll INF = 1000000000000000000LL;
int main() {
ll n, m, k;
cin >> n >> m >> k;
vector<ll> a(n)... | replace | 28 | 29 | 28 | 29 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
#define DEBUG 0
#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;
// 9999... | #include <algorithm> // sort
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#include <queue>
#include <vector>
#define DEBUG 0
#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;
// 9999... | replace | 47 | 54 | 47 | 61 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
typedef long long int ll;
typedef long double ld;
#define MAX 1000005
#define mod 1000000007
ll add(ll a, ll b) { return (mod + ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
typedef long long int ll;
typedef long double ld;
#define MAX 1000005
#define mod 1000000007
ll add(ll a, ll b) { return (mod + ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02623 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1), b(m);
rep(i, n) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
rep(i, m) {
c... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<ll> a(n + 1), b(m);
rep(i, n) {
cin >> a[i + 1];
a[i + 1] += a[i];
}
rep(i, m) {
cin >> b[i];
if (i >... | delete | 0 | 1 | 0 | 0 | TLE | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1}... | replace | 38 | 39 | 38 | 39 | 0 | |
p02623 | C++ | Runtime Error | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
... | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
... | replace | 153 | 154 | 153 | 154 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60; // intじゃ扱えないことに注意！
using P = pair<int, int>;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) // 範囲外参照とループの初期化に注意！
int main() {
ll N, M, K;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60; // intじゃ扱えないことに注意！
using P = pair<int, int>;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) // 範囲外参照とループの初期化に注意！
int main() {
ll N, M, K;
cin >... | replace | 11 | 12 | 11 | 12 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02623 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
fo... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
fo... | replace | 33 | 38 | 33 | 39 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int64_t> a(n + 1, 0), b(m + 1, 0);
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
a.at(i) = a.at(i - 1) + c;
}
for (int i = 1; i <= m; i++) {
int d;
cin >> d;
b.at(i) = b.at(i - 1) + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int64_t> a(n + 1, 0), b(m + 1, 0);
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
a.at(i) = a.at(i - 1) + c;
}
for (int i = 1; i <= m; i++) {
int d;
cin >> d;
b.at(i) = b.at(i - 1) + ... | insert | 42 | 42 | 42 | 43 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
unsigned long long k;
unsigned long long a[200001], b[200001];
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
b[i] += b[i - 1];
}
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
unsigned long long k;
unsigned long long a[200001], b[200001];
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
b[i] += b[i - 1];
}
int... | replace | 24 | 25 | 24 | 25 | TLE | |
p02623 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#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;
#define int long long
#define pb push_back
#define pf pus... | #pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
#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;
#define int long long
#define pb push_back
#define pf pus... | replace | 55 | 56 | 55 | 56 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
long long int x;
long long int a[n + 1], b[n + 1];
a[0] = b[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
a[i] = a[i - 1] + x;
}
for (int i = 1; i <= m; i++) {
cin >> x;
b[i] = b[i - 1] + x;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
long long int x;
long long int a[n + 1], b[m + 1];
a[0] = b[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
a[i] = a[i - 1] + x;
}
for (int i = 1; i <= m; i++) {
cin >> x;
b[i] = b[i - 1] + x;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
vi psa(n + 1), psb(m + 1);
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
psa.at(i) = min(k + 1, ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, m, k;
cin >> n >> m >> k;
vi psa(n + 1), psb(m + 1);
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
psa.at(i) = min(k + 1, ... | replace | 29 | 30 | 29 | 30 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool is_digit(char c) { return c >= '0' && c <= '9'; }
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<long long> sa(n + 1), sb(... | #include <bits/stdc++.h>
using namespace std;
bool is_digit(char c) { return c >= '0' && c <= '9'; }
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<long long> sa(n + 1), sb(... | replace | 23 | 24 | 23 | 24 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
... | insert | 120 | 120 | 120 | 123 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define mp make_pair
#define pb push_back
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); i+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define mp make_pair
#define pb push_back
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); i+... | replace | 78 | 79 | 78 | 79 | -6 | munmap_chunk(): invalid pointer
|
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1234567890
#define pii pair<LL, LL>
#define LL long long
using namespace std;
int main() {
// clock_t start = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.t... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1234567890
#define pii pair<LL, LL>
#define LL long long
using namespace std;
int main() {
// clock_t start = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.t... | replace | 18 | 19 | 18 | 19 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sst... | replace | 60 | 61 | 60 | 61 | 0 | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
... | replace | 33 | 35 | 33 | 35 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
ll k;
cin >> n >> m >> k;
vector<int> a(n + 1, 0);
vector<int> b(m + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++)
cin >> b[i];
ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
ll k;
cin >> n >> m >> k;
vector<int> a(n + 1, 0);
vector<int> b(m + 1, 0);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++)
cin >> b[i];
ve... | replace | 19 | 20 | 19 | 20 | 0 | |
p02623 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
// smaller names
#define int long long
#define double long double
#define Int signed
#define vi vector<int>
#define vvi vector<vi>
#def... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
// smaller names
#define int long long
#define double long double
#define Int signed
#define vi vector<int>
#define vvi vector<vi>
#def... | replace | 105 | 106 | 105 | 106 | 0 | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | replace | 44 | 56 | 44 | 50 | TLE | |
p02623 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int bs(vector<ll> b, ll tar) {
int start = 0, end = b.size() - 1;
int ans = -1;
while (start <= end) {
int mid = start + (end - start) / 2;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int bs(vector<ll> b, ll tar) {
int start = 0, end = b.size() - 1;
int ans = -1;
while (start <= end) {
int mid = start + (end - start) / 2;... | replace | 54 | 57 | 54 | 63 | TLE | |
p02623 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, m, k;
std::vector<ll> a, b;
// 入力
std::cin >> n >> m >> k;
a.resize(n);
b.... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, m, k;
std::vector<ll> a, b;
// 入力
std::cin >> n >> m >> k;
a.resize(n);
b.... | replace | 39 | 40 | 39 | 40 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cerr << endl << "DEBUG: (" << (#x) << " = " << x << ")" << endl;
#define debugArray(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cerr << endl << "DEBUG: (" << (#x) << " = " << x << ")" << endl;
#define debugArray(v) \
for (auto i : v) ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
#define DEBUG 0
#define LIMIT (LONG_MAX / 10)
#define POSITIVE_LAST_D (LONG_MAX % 10)
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
ll ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array) / sizeof(array[0]))
#define DEBUG 0
#define LIMIT (LONG_MAX / 10)
#define POSITIVE_LAST_D (LONG_MAX % 10)
using ll = long long;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
ll ... | replace | 25 | 26 | 25 | 26 | -11 | |
p02623 | C++ | Runtime Error | /*
vectorの配列を吐き出す関数はvfillと同じ要領で簡潔に書けそう
だけど面倒
vfillの範囲指定をできるようにしたい
*/
#pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <future>
#include <iomanip>
#include <iostream>
#include <l... | /*
vectorの配列を吐き出す関数はvfillと同じ要領で簡潔に書けそう
だけど面倒
vfillの範囲指定をできるようにしたい
*/
#pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <future>
#include <iomanip>
#include <iostream>
#include <l... | insert | 404 | 404 | 404 | 406 | 0 | |
p02623 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull B = 100000007;
int mod = 1000000007;
class Solution {
public:
int c(int n, int m, const vector<int> &t1, const vector<int> &t2, int k) {
int res = 0;
vector<ll> s1(n + 1, 0), s2(m + 1, 0);
for (int i ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ull B = 100000007;
int mod = 1000000007;
class Solution {
public:
int c(int n, int m, const vector<int> &t1, const vector<int> &t2, int k) {
int res = 0;
vector<ll> s1(n + 1, 0), s2(m + 1, 0);
for (int i ... | insert | 26 | 26 | 26 | 29 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
string s, t;
ll a[100500], b[100500], pa[100500], pbb[100500];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, m, x, i;
ll tests = 1;
// cin >> tests;
while (tests--) {
cin >> n >> m >> x;... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
string s, t;
ll a[200005], b[200005], pa[200005], pbb[200005];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n, m, x, i;
ll tests = 1;
// cin >> tests;
while (tests--) {
cin >> n >> m >> x;... | replace | 7 | 8 | 7 | 8 | 0 | |
p02623 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using p = pair<int, int>;
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n);
vector<int> b(m);
rep(i, n) cin >> a.at(i);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using p = pair<int, int>;
using ll = long long;
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n);
vector<int> b(m);
rep(i, n) cin >> a.at(i);
... | replace | 24 | 25 | 24 | 25 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.