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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02576 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
int count;
if (N == X) {
cout << T << endl;
}
else if ((N / X) % 0) {
cout << (N / X) * T << endl;
}
else if (X != 1) {
count = N / X;
cout << (count + 1) * T << endl;
}
else {
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
int count;
if (N == X) {
cout << T << endl;
}
else if (N % X == 0) {
cout << (N / X) * T << endl;
}
else if (X != 1) {
count = N / X;
cout << (count + 1) * T << endl;
}
else {
cou... | replace | 13 | 14 | 13 | 14 | -8 | |
p02576 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef vector<string> vsi;
typedef map<ll, ll> mape;
#define rep(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define per(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define fas... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
typedef vector<pi> vpi;
typedef vector<string> vsi;
typedef map<ll, ll> mape;
#define rep(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define per(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define fas... | replace | 20 | 21 | 20 | 21 | 0 | |
p02576 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, x, t, c = 0;
cin >> n >> x >> t;
while (n > 0) {
n -= x;
c++;
}
return c * t;
} | #include <iostream>
using namespace std;
int main() {
int n, x, t, c = 0;
cin >> n >> x >> t;
while (n > 0) {
n -= x;
c++;
}
cout << c * t << endl;
return 0;
} | replace | 9 | 10 | 9 | 11 | 12 | |
p02576 | Python | Runtime Error | import math
N, X, T = map(int(input().split()))
print(T * math.ceil(N / X))
| import math
N, X, T = map(int, input().split())
print(T * math.ceil(N / X))
| replace | 2 | 3 | 2 | 3 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02576/Python/s954741282.py", line 2, in <module>
N, X, T = map(int(input().split()))
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
p02576 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, x, t;
cin >> n >> x >> t;
cout << (n / (x - 1) * t + t) << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n, x, t;
cin >> n >> x >> t;
int ans = 0;
ans += n / x * t + !!(n - n / x * x) * t;
cout << ans << endl;
}
| replace | 6 | 7 | 6 | 9 | 0 | |
p02577 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
char a[200001];
int n;
int main() {
scanf("%s", a);
for (int i = 0; i < strlen(a); i++) {
n += a[i] - 48;
}
// printf("%d\n",n);
if (n % 9 == 0) {
printf("Yes");
} else {
printf("No");
}
ret... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
char a[200001];
int n;
int main() {
scanf("%s", a);
for (int i = 0; i < 200001; i++) {
if (a[i] == 0) {
continue;
} else {
n += a[i] - 48;
}
}
// printf("%d\n",n);
if (n % 9 == 0) {
... | replace | 9 | 11 | 9 | 15 | TLE | |
p02577 | Python | Runtime Error | N = input()
tmp = 0
while N > 0:
tmp += N % 10
N /= 10
if tmp % 9 == 0:
print("Yes")
else:
print("No")
| print("No" if int(input()) % 9 else "Yes")
| replace | 0 | 9 | 0 | 1 | TypeError: '>' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02577/Python/s474365797.py", line 3, in <module>
while N > 0:
TypeError: '>' not supported between instances of 'str' and 'int'
|
p02577 | Python | Time Limit Exceeded | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(input())
total = 0
while n:
total += n % 10
n //= 10
if total % 9 == 0:
print("Yes")
else:
print("No")
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
n = int(input())
if n % 9 == 0:
print("Yes")
else:
print("No")
| replace | 7 | 13 | 7 | 8 | TLE | |
p02577 | Python | Time Limit Exceeded | n = int(input())
s = 0
for i in range(len(str(n))):
s += n % 10
n //= 10
s %= 9
print("Yes" if s == 0 else "No")
| n = int(input())
print("Yes" if n % 9 == 0 else "No")
| replace | 2 | 10 | 2 | 3 | TLE | |
p02577 | Python | Runtime Error | def main():
num = input()
if num % 9 == 0:
return "Yes"
else:
return "No"
if __name__ == "__main__":
ans = main()
print(ans)
| def main():
num = int(input())
if num % 9 == 0:
return "Yes"
else:
return "No"
if __name__ == "__main__":
ans = main()
print(ans)
| replace | 1 | 2 | 1 | 2 | TypeError: not all arguments converted during string formatting | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02577/Python/s351043563.py", line 10, in <module>
ans = main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02577/Python/s351043563.py", line 3, in main
if num % 9 == 0:
TypeError:... |
p02577 | Python | Time Limit Exceeded | N = int(input())
s = 0
while N != 0:
s = s + N % 10
N = N // 10
if s % 9 == 0:
print("Yes")
else:
print("No")
| N = int(input())
s = 0
s = sum(list(map(int, str(N))))
if s % 9 == 0:
print("Yes")
else:
print("No")
| replace | 3 | 6 | 3 | 4 | TLE | |
p02577 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
char s[100000];
long long int i, j, p = 0, a, k;
scanf("%s", s);
a = strlen(s); // printf("%d",a);
for (i = 0; i < a; i++) {
p = p + (s[i] - '0');
p = p % 9;
}
if (p % 9 == 0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include <stdio.h>
#include <string.h>
int main() {
char s[1000000];
long long int i, j, p = 0, a, k;
scanf("%s", s);
a = strlen(s); // printf("%d",a);
for (i = 0; i < a; i++) {
p = p + (s[i] - '0');
p = p % 9;
}
if (p % 9 == 0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02577 | C++ | Runtime Error |
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define IOS \
ios::sync_with_stdio(); \
cin.t... |
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define IOS \
ios::sync_with_stdio(); \
cin.t... | replace | 46 | 48 | 46 | 48 | 0 | |
p02577 | Python | Time Limit Exceeded | n = int(input())
sum = 0
while n > 0:
sum += n % 10
n = n // 10
if sum % 9 == 0:
print("Yes")
else:
print("No")
| n = int(input())
if n % 9 == 0:
print("Yes")
else:
print("No")
| replace | 1 | 6 | 1 | 2 | TLE | |
p02577 | Python | Time Limit Exceeded | N = int(input())
sum = 0
while N > 0:
sum += N % 10
N = N // 10
if sum % 9 == 0:
print("Yes")
else:
print("No")
| N = input()
s = [char for char in N]
sum_ = 0
for char in s:
sum_ += int(char)
if sum_ % 9 == 0:
print("Yes")
else:
print("No")
| replace | 0 | 6 | 0 | 6 | TLE | |
p02577 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
char s[100009];
int main() {
cin >> s;
long long sum = 0;
for (int i = 0; i < strlen(s); i++)
sum += int(s[i] - '0');
if (sum % 9 == 0)
cout << "Yes";
else {
cout << "No";
}
system("pause");
} | #include <cstring>
#include <iostream>
using namespace std;
char s[10000009];
int main() {
cin >> s;
long long sum = 0;
for (int i = 0; i < strlen(s); i++)
sum += int(s[i] - '0');
if (sum % 9 == 0)
cout << "Yes";
else {
cout << "No";
}
system("pause");
} | replace | 3 | 4 | 3 | 4 | 0 | sh: 1: pause: not found
|
p02577 | C++ | Runtime Error | // #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 1e5 + 7;
const double eps = 1e-9;
const ... | // #pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02577 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
char c[200005];
int sum = 1;
while (cin >> c[sum])
sum++;
int ans = 0;
for (int i = 1; i <= sum; i++) {
int num = (int)(c[i] - '0');
sum += num;
}
if (sum % 9 == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
int sum = 0;
for (int i = 0; i < n.length(); i++) {
sum += (n[i] - '0');
}
if (sum % 9 == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| replace | 3 | 12 | 3 | 8 | 0 | |
p02577 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
char s[100000];
unsigned long long int n = 0;
cin >> s;
for (int i = 0; s[i] != '\0'; i++) {
n += s[i] - '0';
n %= 9;
}
if (n)
cout << "No";
else
cout << "Yes";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
char s[300000];
unsigned long long int n = 0;
cin >> s;
for (int i = 0; s[i] != '\0'; i++) {
n += s[i] - '0';
n %= 9;
}
if (n)
cout << "No";
else
cout << "Yes";
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02577 | Python | Time Limit Exceeded | N = input()
cnt = 0
for s in N:
cnt += int(N)
if cnt % 9 == 0:
print("Yes")
else:
print("No")
| N = input()
cnt = 0
for s in N:
cnt += int(s)
if cnt % 9 == 0:
print("Yes")
else:
print("No")
| replace | 4 | 5 | 4 | 5 | TLE | |
p02577 | Python | Runtime Error | N = input()
ans = 0
while N:
ans += int(N[:-1])
ans = ans % 9
N = N[:-1]
if ans == 0:
print("Yes")
else:
print("No")
| N = input()
ans = 0
while N:
ans += int(N[-1])
ans = ans % 9
N = N[:-1]
if ans == 0:
print("Yes")
else:
print("No")
| replace | 3 | 4 | 3 | 4 | ValueError: invalid literal for int() with base 10: '' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02577/Python/s521471712.py", line 4, in <module>
ans += int(N[:-1])
ValueError: invalid literal for int() with base 10: ''
|
p02577 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int i, sm = 0;
char s[100000];
scanf("%s", s);
for (i = 0; i < strlen(s); i++)
sm += s[i] - '0';
if (sm % 9 == 0)
printf("Yes\n");
else
printf("No\n");
} | #include <stdio.h>
#include <string.h>
int main() {
int i, sm = 0;
char s[2000009];
scanf("%s", s);
for (i = 0; i < strlen(s); i++)
sm += s[i] - '0';
if (sm % 9 == 0)
printf("Yes\n");
else
printf("No\n");
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02577 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
using namespace std;
int sum;
char ch[200005];
int main() {
scanf("%s", ch);
for (int i = 0; i < (int)strlen(ch); ++i)
sum += ch[i] - '0';
if (sum % 9)
printf("No\n");
else
printf("Yes\n");
return 0;
} | #include <cstdio>
#include <cstring>
using namespace std;
int sum;
char ch[200005];
int main() {
scanf("%s", ch);
int t = (int)strlen(ch);
for (int i = 0; i < t; ++i)
sum += ch[i] - '0';
if (sum % 9)
printf("No\n");
else
printf("Yes\n");
return 0;
} | replace | 7 | 8 | 7 | 9 | TLE | |
p02577 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char s[100005];
int main() {
scanf("%s", s);
int len = strlen(s);
int m, a;
m = 0;
for (int i = 0; i < len; i++) {
a = s[i] - '0';
m += a;
}
if (m % 9 == 0)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char s[100000005];
int main() {
scanf("%s", s);
int len = strlen(s);
int m, a;
m = 0;
for (int i = 0; i < len; i++) {
a = s[i] - '0';
m += a;
}
if (m % 9 == 0)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02577 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e2 + 14, lg = 15;
/*
######################################################################
####################### THE BIG INT ##########################
*/
const int base = 1000000000;
const int base_digits = 9;
struct ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e2 + 14, lg = 15;
/*
######################################################################
####################### THE BIG INT ##########################
*/
const int base = 1000000000;
const int base_digits = 9;
struct ... | replace | 391 | 396 | 391 | 392 | TLE | |
p02577 | C++ | Runtime Error | //| #######################|
//| ADARSH SINGH KUSHWAHA |
//| ###################### |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Bahut_tej ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define frb(i, a, b) for (ll i = a - 1; i >= ... | //| #######################|
//| ADARSH SINGH KUSHWAHA |
//| ###################### |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define Bahut_tej ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define frb(i, a, b) for (ll i = a - 1; i >= ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02577 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define nl endl
#define in cin
#define out cout
#define ll long long
#define charToInt(c) (c - '0')
int main() {
ll a, b, c = 0, d, i, j;
char s[1000];
in >> s;
for (i = 0; s[i]; i++) {
s[i] = s[i] - 48;
c += s[i];
}
if (c % 9 == 0) {
cout << "Yes" <... | #include <bits/stdc++.h>
using namespace std;
#define nl endl
#define in cin
#define out cout
#define ll long long
#define charToInt(c) (c - '0')
int main() {
ll a, b, c = 0, d, i, j;
string s;
in >> s;
for (i = 0; s[i]; i++) {
s[i] = s[i] - 48;
c += s[i];
}
if (c % 9 == 0) {
cout << "Yes" << nl... | replace | 9 | 10 | 9 | 10 | 0 | |
p02577 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char S[20010];
int main() {
cin >> S;
int len = strlen(S);
long long sum = 0;
for (int i = 0; i < len; i++) {
sum += S[i] - '0';
}
if (sum % 9 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
;
} | #include <bits/stdc++.h>
using namespace std;
char S[200100];
int main() {
cin >> S;
int len = strlen(S);
long long sum = 0;
for (int i = 0; i < len; i++) {
sum += S[i] - '0';
}
if (sum % 9 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02577 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long int ll;
int main() {
char s[100000];
scanf("%s", s);
ll sum = 0;
rep(i, strlen(s)) sum += s[i] - '0';
if (sum % 9 == 0)
printf("Yes");
else
printf("No");
} | #include <bits/stdc++.h>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long int ll;
int main() {
char s[200000];
scanf("%s", s);
ll sum = 0;
rep(i, strlen(s)) sum += s[i] - '0';
if (sum % 9 == 0)
printf("Yes");
else
printf("No");
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02577 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define FUP(i, x, y) for (int i = (x); i <= (y); i++)
#define FDW(i, x, y) for (int i = (x); i >= (y); i--)
#define MAXN 100010
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define ll long long
#define db ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define FUP(i, x, y) for (int i = (x); i <= (y); i++)
#define FDW(i, x, y) for (int i = (x); i >= (y); i--)
#define MAXN 100010
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define ll long long
#define db ... | replace | 28 | 29 | 28 | 29 | 0 | |
p02577 | C++ | Runtime Error | #include <stdio.h>
int main() {
char S[100100];
scanf("%s", S);
int s = 0;
for (int i = 0; S[i]; i++)
s += S[i] - '0';
puts(s % 9 == 0 ? "Yes" : "No");
return 0;
} | #include <stdio.h>
int main() {
char S[200100];
scanf("%s", S);
int s = 0;
for (int i = 0; S[i]; i++)
s += S[i] - '0';
puts(s % 9 == 0 ? "Yes" : "No");
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02577 | Python | Time Limit Exceeded | N = int(input())
summer = 0
while N > 0:
digit = N % 10
summer += digit
N = N // 10
if summer % 9 == 0:
print("Yes")
else:
print("No")
| N = int(input())
if N % 9 == 0:
print("Yes")
else:
print("No")
| replace | 1 | 8 | 1 | 2 | TLE | |
p02578 | C++ | Runtime Error | #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;
int n, a[200000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
long long ans = 0;
... | #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;
int n, a[200000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
long long ans = 0;
... | replace | 15 | 17 | 15 | 17 | -11 | |
p02578 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int n, x[2000001], t, ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i];
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= 0; j--)
if (t < x[j])
t = x[j];
if (x[i] < t) {
ans += t - x[i];
x[i] += t... | #include <bits/stdc++.h>
using namespace std;
long long int n, x[2000001], t, ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i];
for (int i = 0; i < n; i++) {
if (t < x[i])
t = x[i];
if (x[i] < t) {
ans += t - x[i];
x[i] += t - x[i];
}
}
cout << ans;
} | replace | 7 | 11 | 7 | 10 | TLE | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[101010], n, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a[202020], n, ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e5 + 5;
const ll MOD = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pis pair<ll, string>
#define F first
#define S second
#define LCM(a, b) ((a * b) / __gcd(a, b))
#define inf 1e15
#define test ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 5;
const ll MOD = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pis pair<ll, string>
#define F first
#define S second
#define LCM(a, b) ((a * b) / __gcd(a, b))
#define inf 1e15
#define test ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
int main(void) {
ll n, mx = 0, sum = 0;
scanf("%lld", &n);
for (ll i = 1; i <= n; i++)
scanf("%lld", &a[i]);
mx = a[1];
for (ll i = 2; i <= n; i++) {
if (mx < a[i])
mx = a[i];
sum += mx - a[i];
}
pr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200005];
int main(void) {
ll n, mx = 0, sum = 0;
scanf("%lld", &n);
for (ll i = 1; i <= n; i++)
scanf("%lld", &a[i]);
mx = a[1];
for (ll i = 2; i <= n; i++) {
if (mx < a[i])
mx = a[i];
sum += mx - a[i];
}
pr... | replace | 5 | 6 | 5 | 6 | 0 | |
p02578 | Python | Runtime Error | N = input()
tmp = 0
while N > 0:
tmp += N % 10
N /= 10
if tmp % 9 == 0:
print("Yes")
else:
print("No")
| # # Make IO faster
# import sys
# input = sys.stdin.readline
# # get single (or) multiple str
# X = input()
# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]
# f... | replace | 0 | 9 | 0 | 65 | TypeError: '>' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02578/Python/s628445536.py", line 3, in <module>
while N > 0:
TypeError: '>' not supported between instances of 'str' and 'int'
|
p02578 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, ans;
int h[100010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
ans = 0;
for (int i = 1; i < n; i++) {
if (h[i - 1] > h[i]) {
ans += h[i - 1] - h[i];
h[i] = h[i - 1];
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n;
long long ans;
int h[200010];
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
ans = 0;
for (int i = 1; i < n; i++) {
if (h[i - 1] > h[i]) {
ans += h[i - 1] - h[i];
h[i] = h[i - 1];
}
}
cout << ans << endl;
... | replace | 4 | 6 | 4 | 7 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = 0;
for (int i = 1; i < N + 1; i++) {
if (vec.at(i - 1) > vec.at(i)) {
sum += (vec.at(i - 1) - vec.at(i));
vec.at(i) = vec.at(i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int64_t sum = 0;
for (int i = 1; i < N; i++) {
if (vec.at(i - 1) > vec.at(i)) {
sum += (vec.at(i - 1) - vec.at(i));
vec.at(i) = vec.at(i - ... | replace | 10 | 12 | 10 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02578 | C++ | Runtime Error | //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef pair<int, pint> ppint;
typedef pair<ll, pll> ppll;
typedef vector<int> vint;
typedef vector<ll> vll;
const double pi = 3.141592653589793;
const int INF10 = 1000000001;
const ll INF15 ... | //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef pair<int, pint> ppint;
typedef pair<ll, pll> ppll;
typedef vector<int> vint;
typedef vector<ll> vll;
const double pi = 3.141592653589793;
const int INF10 = 1000000001;
const ll INF15 ... | replace | 162 | 163 | 162 | 163 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[100005], sum = 0;
signed main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
sum += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout << sum;
return 0;
}... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
int n, a[200005], sum = 0;
signed main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
sum += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout... | replace | 3 | 4 | 3 | 5 | 0 | |
p02578 | C++ | Runtime Error | #include <iostream>
using namespace std;
long long a[2 * 10 ^ 5 + 5];
int main() {
long long n, min_sum = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n - 1; ++i) {
if (a[i] > a[i + 1]) {
min_sum += a[i] - a[i + 1];
a[i + 1] += a[i] - a[i + 1];
}
}
cout... | #include <iostream>
using namespace std;
long long a[2 * 100000 + 5];
int main() {
long long n, min_sum = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n - 1; ++i) {
if (a[i] > a[i + 1]) {
min_sum += a[i] - a[i + 1];
a[i + 1] += a[i] - a[i + 1];
}
}
cout... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N;
long int A[20000], ans = 0;
cin >> N;
rep(i, N) cin >> A[i];
for (int i = 1; i < N; i++) {
if (A[i] < A[i - 1]) {
ans += (A[i - 1] - A[i]);
A[i]... | #include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int N;
long int A[200001], ans = 0;
cin >> N;
rep(i, N) cin >> A[i];
for (int i = 1; i < N; i++) {
if (A[i] < A[i - 1]) {
ans += (A[i - 1] - A[i]);
A[i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int INF = 1001001001;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
ll ans = 0;
rep(i, N) cin >> A.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int INF = 1001001001;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
ll ans = 0;
rep(i, N) cin >> A.at... | replace | 14 | 21 | 14 | 18 | 0 | |
p02578 | C++ | Runtime Error | /* author:hellojim */
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inc... | /* author:hellojim */
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inc... | replace | 88 | 89 | 88 | 89 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
long long ans = 0;
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
ans += (a[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
int a[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
long long ans = 0;
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
ans += (a[i - 1] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int64_t sum = 0;
int A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s]<<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int64_t sum = 0;
int A[200010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s]<<... | replace | 6 | 7 | 6 | 7 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N;
ll sum = 0, mx;
vi A(30000);
cin >> N;
rep(i, N) cin >> A[i];
mx = A[0];
rep(i, N) {
if (mx > A[i])
sum += mx - A[i];
if (A[i] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N;
ll sum = 0, mx;
vi A(300000);
cin >> N;
rep(i, N) cin >> A[i];
mx = A[0];
rep(i, N) {
if (mx > A[i])
sum += mx - A[i];
if (A[i]... | replace | 9 | 10 | 9 | 10 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
int n, a[100050], maxn;
long long ans;
int main() {
// for(scanf("%d",&_);_;_--)
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
maxn = max(maxn, a[i]);
ans += max(maxn - a[i], 0);
}
printf("%lld", ... | #include <bits/stdc++.h>
#define sort stable_sort
using namespace std;
int _;
int n, a[200050], maxn;
long long ans;
int main() {
// for(scanf("%d",&_);_;_--)
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
maxn = max(maxn, a[i]);
ans += max(maxn - a[i], 0);
}
printf("%lld", ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02578 | C++ | Runtime Error | #include <iostream>
using namespace std;
int N;
int A[100005];
long long ans;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long mn = 1LL * A[0];
for (int i = 1; i < N; i++) {
if (A[i] < mn) {
ans += mn - 1LL * A[i];
} else {
mn = 1LL * A[i];
}
}
... | #include <iostream>
using namespace std;
int N;
int A[200005];
long long ans;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
long long mn = 1LL * A[0];
for (int i = 1; i < N; i++) {
if (A[i] < mn) {
ans += mn - 1LL * A[i];
} else {
mn = 1LL * A[i];
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(a) a.begin(), a.end()
const int maxn = 100010;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
int n, m, a[maxn];
string s, ss;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(a) a.begin(), a.end()
const int maxn = 200010;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
int n, m, a[maxn];
string s, ss;
int main() {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
if (N > 0) {
vector<long int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<long int> dai(N - 1, 0);
if (vec.at(0) > vec.at(1)) {
dai.at(0) = vec.at(0) - vec.at(1);
}
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N;
cin >> N;
if (N > 1) {
vector<long int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<long int> dai(N - 1, 0);
if (vec.at(0) > vec.at(1)) {
dai.at(0) = vec.at(0) - vec.at(1);
}
for... | replace | 6 | 7 | 6 | 7 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e5 + 5;
const ll maxm = 1e3 + 5;
namespace IO {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;
inline char gc() {
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 2e5 + 5;
const ll maxm = 1e3 + 5;
namespace IO {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;
inline char gc() {
r... | replace | 4 | 5 | 4 | 5 | 0 | |
p02578 | C++ | Runtime Error | #define boost
#ifdef boost
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#endif
#include <bits/stdc++.h>
#define int long long
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -f;
ch = ge... | #define boost
#ifdef boost
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#endif
#include <bits/stdc++.h>
#define int long long
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -f;
ch = ge... | replace | 24 | 25 | 24 | 25 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define... | replace | 59 | 60 | 59 | 60 | -11 | |
p02578 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define MOD 1000000007
#define pb push_back
#define loop(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define loope(i, b) for (int i = 1; i <= (int)b; i++)
#define loopl(i, a, b) for (ll i = ll(a); i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define MOD 1000000007
#define pb push_back
#define loop(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define loope(i, b) for (int i = 1; i <= (int)b; i++)
#define loopl(i, a, b) for (ll i = ll(a); i... | replace | 18 | 25 | 18 | 22 | TLE | |
p02578 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int a[100000];
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
sum += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int a[200000];
long long int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
sum += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout << sum << endl;
r... | replace | 7 | 9 | 7 | 9 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int sum = 0;
int A[100000000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s]<<e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int64_t sum = 0;
int A[1000000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s]<... | replace | 5 | 7 | 5 | 7 | -11 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int64_t sum = 0;
int A[100000000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t u;
int64_t sum = 0;
int A[200000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
if (N == 1) {
cout << sum << endl;
} else {
for (int i = 0; i < N - 1; i++) {
int s = i + 1;
// cout<<A[i]<<A[s]<<... | replace | 6 | 7 | 6 | 7 | -11 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[112345], ans;
int main() {
cin >> n;
for (ll i = 0; i < n; ++i)
cin >> a[i];
ll mx = a[0];
for (ll i = 1; i < n; ++i) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[212345], ans;
int main() {
cin >> n;
for (ll i = 0; i < n; ++i)
cin >> a[i];
ll mx = a[0];
for (ll i = 1; i < n; ++i) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
cout << ans << endl;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll t, n, k, a[maxn], res;
int main() {
// freopen("in.txt","r",stdin);
cin >> t;
for (int i = 0; i < t; i++)
cin >> a[i];
for (int i = 0; i < t - 1; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 100;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll t, n, k, a[maxn], res;
int main() {
// freopen("in.txt","r",stdin);
cin >> t;
for (int i = 0; i < t; i++)
cin >> a[i];
for (int i = 0; i < t - 1; i++) ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
long long a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
long long a[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a... | replace | 2 | 3 | 2 | 3 | 0 | |
p02578 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long cnt = 0;
for (int i = 0; i < N; i++) {
for (int k = i + 1; k < N; k++) {
if (A.at(i) - A.at(k) > 0) {
cnt += (A.at(i) - A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long cnt = 0;
for (int i = 0; i < (N - 1); i++) {
if (A.at(i) > A.at(i + 1)) {
cnt += (A.at(i) - A.at(i + 1));
A.at(i + 1) = A.a... | replace | 15 | 21 | 15 | 19 | TLE | |
p02578 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
long long A[20005];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", A + i);
}
long long m = A[0];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += max(0LL, m - A[i]);
m = max(m, A[i]);
}
pr... | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
long long A[200005];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", A + i);
}
long long m = A[0];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += max(0LL, m - A[i]);
m = max(m, A[i]);
}
p... | replace | 5 | 6 | 5 | 6 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define SORTD(s) sort((s).rbegin(), (s).rend())
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define SORTD(s) sort((s).rbegin(), (s).rend())
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline ... | replace | 25 | 26 | 25 | 26 | -11 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[114514];
int main() {
int cnt = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
int added = a[i - 1] - a[i];
if (added < 0)
added = 0;
a[i] += added;
cnt += added;
}
cout << cnt;
re... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[11114514];
signed main() {
int cnt = 0;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
int added = a[i - 1] - a[i];
if (added < 0)
added = 0;
a[i] += added;
cnt += add... | replace | 2 | 4 | 2 | 5 | 0 | |
p02578 | C++ | Runtime Error | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | replace | 24 | 25 | 24 | 25 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll arr[100000];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
if (arr[i] > arr[i + 1]) {
ans += arr[i] - arr[i + 1];
arr[i + 1] = arr[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll arr[1000000];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll ans = 0;
for (int i = 0; i < n - 1; i++) {
if (arr[i] > arr[i + 1]) {
ans += arr[i] - arr[i + 1];
arr[i + 1] = arr[i];
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02578 | C++ | Time Limit Exceeded | // ┏━━┓┏━━┓┏┓┏┓┏┳━┳┓┏━━┓┏━┳┓┏━━┓ ┏┳┓┏┳┓┏━┳━┓┏━━┓┏━┓
// ┃┏┓┃┃━━┫┃┗┛┃┃┃┃┃┃┃┏┓┃┃┃┃┃┗┃┃┛ ┃┏┛┃┃┃┃┃┃┃┃┃┏┓┃┃╋┃
// ┃┣┫┃┣━━┃┃┏┓┃┃┃┃┃┃┃┣┫┃┃┃┃┃┏┃┃┓ ┃┗┓┃┃┃┃┃┃┃┃┃┣┫┃┃┓┫
// ┗┛┗┛┗━━┛┗┛┗┛┗━┻━┛┗┛┗┛┗┻━┛┗━━┛ ┗┻┛┗━┛┗┻━┻┛┗┛┗┛┗┻┛
#include "bits/stdc++.h"
using namespace std;
#define mod 1e9 + 7
#define FOR(a, c) for ... | // ┏━━┓┏━━┓┏┓┏┓┏┳━┳┓┏━━┓┏━┳┓┏━━┓ ┏┳┓┏┳┓┏━┳━┓┏━━┓┏━┓
// ┃┏┓┃┃━━┫┃┗┛┃┃┃┃┃┃┃┏┓┃┃┃┃┃┗┃┃┛ ┃┏┛┃┃┃┃┃┃┃┃┃┏┓┃┃╋┃
// ┃┣┫┃┣━━┃┃┏┓┃┃┃┃┃┃┃┣┫┃┃┃┃┃┏┃┃┓ ┃┗┓┃┃┃┃┃┃┃┃┃┣┫┃┃┓┫
// ┗┛┗┛┗━━┛┗┛┗┛┗━┻━┛┗┛┗┛┗┻━┛┗━━┛ ┗┻┛┗━┛┗┻━┻┛┗┛┗┛┗┻┛
#include "bits/stdc++.h"
using namespace std;
#define mod 1e9 + 7
#define FOR(a, c) for ... | replace | 32 | 38 | 32 | 40 | TLE | |
p02578 | C++ | Runtime Error | /**
* CODE
* BY
* VIKAS VERMA
*
* $$Always Check for Constraints
*/
#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, n) for (int i = 1; k <= n; i++)
#define f_range(l, r) for (int i = l; i < r; i++)
#define jaldi ios_base::sync_with_stdio(0), cin.tie(NULL), ... | /**
* CODE
* BY
* VIKAS VERMA
*
* $$Always Check for Constraints
*/
#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, n) for (int i = 1; k <= n; i++)
#define f_range(l, r) for (int i = l; i < r; i++)
#define jaldi ios_base::sync_with_stdio(0), cin.tie(NULL), ... | replace | 59 | 60 | 59 | 60 | 0 | |
p02578 | C++ | Runtime Error | // #pragma region ALL(include define etc)
#include <algorithm> // max(a, b) min(a, b) reverse() sort()
#include <cmath> // abs(絶対値) sin cos tan(角度 / 180.0 * 3.141592)
#include <functional> // sort(a, a + N, greater<型>());
#include <iomanip>
#include <iostream> // swap(a, b)
#include <limits>
#include <math.h>
#in... | // #pragma region ALL(include define etc)
#include <algorithm> // max(a, b) min(a, b) reverse() sort()
#include <cmath> // abs(絶対値) sin cos tan(角度 / 180.0 * 3.141592)
#include <functional> // sort(a, a + N, greater<型>());
#include <iomanip>
#include <iostream> // swap(a, b)
#include <limits>
#include <math.h>
#in... | replace | 55 | 56 | 55 | 56 | 0 | |
p02578 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define fix(a) \
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define trav(a, x) for (auto &a : x)
#define fix(a) \
... | replace | 39 | 45 | 39 | 45 | TLE | |
p02578 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long;
#define ld long double
#define pb push_back
const int mod = 1e9 + 7;
const int mxN = 2e6 + 3;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
long long sum = 0;
for (int i = 0, maxnum ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long;
#define ld long double
#define pb push_back
const int mod = 1e9 + 7;
const int mxN = 2e6 + 3;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
long long sum = 0;
for (int i = 0, maxnum ... | replace | 17 | 18 | 17 | 18 | TLE | |
p02578 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
int main() {
ll n;
std::cin >> n;
std::vector<ll> a(n);
rep(i, n) { std::cin >> a[i]; }
ll sum = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
if ... | #include <algorithm>
#include <iostream>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
int main() {
ll n;
std::cin >> n;
std::vector<ll> a(n);
rep(i, n) { std::cin >> a[i]; }
ll sum = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
if ... | insert | 17 | 17 | 17 | 19 | TLE | |
p02578 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int kMaxN = 10;
long long n, ans;
int a[kMaxN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
ans += max(a[i - 1] - a[i], 0);
a[i] = max(a[i], a[i - 1]);
}
cout << ans;
return 0;
} | #include <iostream>
using namespace std;
const int kMaxN = 2000001;
long long n, ans;
int a[kMaxN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
ans += max(a[i - 1] - a[i], 0);
a[i] = max(a[i], a[i - 1]);
}
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02578 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#includ... | #pragma GCC optimize(2)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#includ... | replace | 65 | 66 | 65 | 66 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[100000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int max = a[0], ans = 0;
for (i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
else
ans = ans + max - a[i];
}
cout << ans;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[1000000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long int max = a[0], ans = 0;
for (i = 1; i < n; i++) {
if (max < a[i])
max = a[i];
else
ans = ans + max - a[i];
}
cout << ans;
ret... | replace | 3 | 4 | 3 | 4 | 0 | |
p02578 | C++ | Runtime Error | /* CF_CC_
4U7H0R:_C4551DY */
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long ll;
#define IC \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | /* CF_CC_
4U7H0R:_C4551DY */
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long ll;
#define IC \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | replace | 26 | 27 | 26 | 27 | 0 | |
p02578 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
long long a[100005], ans = 0;
int main() {
long long n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
}
... | #include <cstdio>
#include <iostream>
using namespace std;
long long a[10000005], ans = 0;
int main() {
long long n;
scanf("%lld", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 2; i <= n; i++) {
if (a[i] < a[i - 1]) {
ans += a[i - 1] - a[i];
a[i] = a[i - 1];
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02578 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, a[100000000], sum = 0;
cin >> n;
for (long long i ... | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, a[10000000], sum = 0;
cin >> n;
for (long long i =... | replace | 12 | 13 | 12 | 13 | -11 | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | #include <bits/stdc++.h>
using namespace std;
template <typename T, typename U> using pv = vector<pair<T, U>>;
template <typename T> using matrix = vector<vector<T>>;
template <typename T> using pque = priority_queue<T>;
template <typename T> using lpque = priority_queue<T, vector<T>, greater<T>>;
using ll = long lon... | replace | 157 | 158 | 157 | 158 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
using namespace std;
#define int long long
const int N = 1e3 + 10;
int dp[N][N];
char s[N][N];
bool vis[N][N];
int h, w, ch, cw;
int r[] = {0, 0, 1, -1};
int c[] = {1, -1, 0, 0};
void dijkstra() {
priority_queue<pair<int, pair<int, int>>> q;
q.push({0, {ch, cw}});
while (... | #include <iostream>
#include <queue>
using namespace std;
#define int long long
const int N = 1e3 + 10;
int dp[N][N];
char s[N][N];
bool vis[N][N];
int h, w, ch, cw;
int r[] = {0, 0, 1, -1};
int c[] = {1, -1, 0, 0};
void dijkstra() {
priority_queue<pair<int, pair<int, int>>> q;
q.push({0, {ch, cw}});
while (... | replace | 26 | 27 | 26 | 27 | TLE | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) \
for (long long i = (a); ((a) < (b) ? i <= (b) : i >= (b)); \
((a) < (b) ? ++i : --i))
#define ALL(v) (v).begin(), (v).end()
#define debug(x... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) \
for (long long i = (a); ((a) < (b) ? i <= (b) : i >= (b)); \
((a) < (b) ? ++i : --i))
#define ALL(v) (v).begin(), (v).end()
#define debug(x... | replace | 85 | 86 | 85 | 86 | TLE | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Freed freopen("0in.txt", "r",... | #include <bits/stdc++.h>
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Freed freopen("0in.txt", "r",... | replace | 63 | 65 | 63 | 65 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int dst[1010][1010];
string s[1010];
bool good(int nx, int ny, int n, int m) {
return 1 <= nx && nx <= n && 1 <= ny && ny <= m;
}
void solve() {
int n, ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int dst[1010][1010];
string s[1010];
bool good(int nx, int ny, int n, int m) {
return 1 <= nx && nx <= n && 1 <= ny && ny <= m;
}
void solve() {
int n, ... | replace | 42 | 43 | 42 | 43 | TLE | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); ... | #include <bits/stdc++.h>
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); ... | replace | 60 | 61 | 60 | 61 | TLE | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt", "r", stdin)
#define output freopen("output.txt", "w", stdout)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define pi(a) printf("%d", a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define input freopen("input.txt", "r", stdin)
#define output freopen("output.txt", "w", stdout)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define pi(a) printf("%d", a)... | replace | 25 | 26 | 25 | 26 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define REP(i, s, n) for (long long i = (s); i <= (n); i++)
#define repr(i, n) for (long long i = (n - 1); i >= 0; i--)
#define REPR(i, s, n) for (long long i = (s); i >= (n); i--)
#define all(a) (a).begin(), (a).end()
... | replace | 269 | 270 | 269 | 270 | TLE | |
p02579 | C++ | Time Limit Exceeded |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... |
#pragma GCC optimize("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>... | replace | 1 | 2 | 1 | 2 | TLE | |
p02579 | C++ | Runtime Error | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | replace | 61 | 62 | 61 | 62 | 0 | |
p02579 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", \
"inline") // Optimization flags
#pragma GCC option("arch=native", "tune=native", "no-zero-upper") // Enable AVX
#pragma GCC target("avx2") // Enable AVX
#include <bits/stdc++.h>
... | #pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", \
"inline") // Optimization flags
#pragma GCC option("arch=native", "tune=native", "no-zero-upper") // Enable AVX
#pragma GCC target("avx2") // Enable AVX
#include <bits/stdc++.h>
... | replace | 63 | 64 | 63 | 66 | TLE | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
// #define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>,
// rb_tree_tag, tree_order_statist... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
// #define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>,
// rb_tree_tag, tree_order_statist... | replace | 123 | 127 | 123 | 129 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define MOD 1000000007
#define F first
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vvl;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define MOD 1000000007
#define F first
#... | replace | 61 | 73 | 61 | 68 | TLE | |
p02579 | C++ | Runtime Error | // #pragma GCC optimize("trapv")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#define int long long
#define all(x) (x).begin(), (x).end()
#defin... | // #pragma GCC optimize("trapv")
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <unordered_set>
#include <vector>
#define int long long
#define all(x) (x).begin(), (x).end()
#defin... | replace | 39 | 40 | 39 | 40 | 0 | |
p02579 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ii = pair<int, int>;
int dijkstra(vector<vector<char>> graph, int sourcex, int sourcey, int endx,
int endy) {
priority_queue<pair<int, ii>> pq;
set<pair<int, int>> visited;
pq.push(make_pair(0, ii(sour... | #include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ii = pair<int, int>;
int dijkstra(vector<vector<char>> graph, int sourcex, int sourcey, int endx,
int endy) {
priority_queue<pair<int, ii>> pq;
set<pair<int, int>> visited;
pq.push(make_pair(0, ii(sour... | insert | 55 | 55 | 55 | 56 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define UP(a, b, c) for (ll(a) = (b); (a) < (c); (a)++)
#define UU(a, b, c) for (ll(a) = (b); (a) <= (c); (a)++)
#define DN(a, b, c) for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#define UP(a, b, c) for (ll(a) = (b); (a) < (c); (a)++)
#define UU(a, b, c) for (ll(a) = (b); (a) <= (c); (a)++)
#define DN(a, b, c) for ... | replace | 40 | 54 | 40 | 56 | TLE | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | replace | 100 | 101 | 100 | 101 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 2305843009213693951;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
ll H, W, ch, cw, dh, dw;
cin >> H >> W >> ch >> cw >> dh >> dw;
ch--;
cw--;
dh--;
dw--;
string field[1000];
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 2305843009213693951;
ll dx[4] = {1, 0, -1, 0};
ll dy[4] = {0, 1, 0, -1};
int main() {
ll H, W, ch, cw, dh, dw;
cin >> H >> W >> ch >> cw >> dh >> dw;
ch--;
cw--;
dh--;
dw--;
string field[1000];
fo... | replace | 57 | 58 | 57 | 58 | TLE | |
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
using PP = pair<int, P>;
typedef long long ll;
bool visited[1000][1000];
int dist[1000][1000];
string grid[1000]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
using PP = pair<int, P>;
typedef long long ll;
bool visited[1000][1000];
int dist[1000][1000];
string grid[1000]... | replace | 41 | 42 | 41 | 42 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.