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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long n, m;
int tem, cnt[maxn] = {0};
int read() {
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
long long n, m;
int tem, cnt[maxn] = {0};
int read() {
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-')
w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sf scanf
#define pf printf
#define srev reverse(s.begin(), s.end())
#define sortstr sort(s.begin(), s.end());
#define gtl(x) getl... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define sf scanf
#define pf printf
#define srev reverse(s.begin(), s.end())
#define sortstr sort(s.begin(), s.end());
#define gtl(x) getl... | replace | 60 | 61 | 60 | 61 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> ans(100100, 0);
for (ll i = 1; i < N; ++i) {
ll temp;
cin >> temp;
++ans[temp - 1];
}
for (ll i = 0; i < N; ++i) {
cout << ans[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> ans(200100, 0);
for (ll i = 1; i < N; ++i) {
ll temp;
cin >> temp;
++ans[temp - 1];
}
for (ll i = 0; i < N; ++i) {
cout << ans[i]... | replace | 8 | 9 | 8 | 9 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N;
int b[20000] = {0};
cin >> N;
for (int i = 1; i < N; i++) {
int tmp;
cin >> tmp;
b[tmp - 1]++;
}
for (int i = 0; i < N; i++)
cout << b[i] << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N;
int b[200000] = {0};
cin >> N;
for (int i = 1; i < N; i++) {
int tmp;
cin >> tmp;
b[tmp - 1]++;
}
for (int i = 0; i < N; i++)
cout << b[i] << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int nmax = 20005;
int v[nmax];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
if (x < i)
v[x]++;
}
for (int i = 1; i <= n; i++)
cout << v[i] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
const int nmax = 200005;
int v[nmax];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
if (x < i)
v[x]++;
}
for (int i = 1; i <= n; i++)
cout << v[i] << "\n";
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | #include <bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
using ull = unsigned long long;
template <class T, class U> using P = pair<T, U>;
template <class T> using Heap = priority_queue<T>;
template <class T> using he... | replace | 42 | 43 | 42 | 43 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n;
cin >> n;
vector<ll> a(n), ans(n);
for (int i = 2; i <= n; ++i)
cin >> a[i], ans[a[i]]++;
for (int i = 1; i <= n; ++i)
cout << ans[i] << endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 5), ans(n + 5);
for (int i = 2; i <= n; ++i)
cin >> a[i], ans[a[i]]++;
for (int i = 1; i <= n; ++i)
cout << ans[i] <<... | replace | 10 | 11 | 10 | 11 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using dou = long double;
string yes = "yes";
string Yes = "Yes";
string YES = "YES";
string no = "no";
string No = "No";
string NO = "NO";
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return... | replace | 152 | 153 | 152 | 153 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n;
vector<int> data(20001, 0);
cin >> n;
int x;
for (int i = 0; i < n - 1; i++) {
cin >> x;
data.at(x - 1) += 1;
}
for (int i = 0; i < n; i++) {
cout << data.at(i) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n;
vector<int> data(200001, 0);
cin >> n;
int x;
for (int i = 0; i < n - 1; i++) {
cin >> x;
data.at(x - 1) += 1;
}
for (int i = 0; i < n; i++) {
cout << data.at(i) << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, x;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> x;
x--;
a[x]++;
}
for (i = 0; i < n; i++)
cout << a[i] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, x;
cin >> n;
vector<int> a(n);
for (i = 0; i < n - 1; i++) {
cin >> x;
x--;
a[x]++;
}
for (i = 0; i < n; i++)
cout << a[i] << "\n";
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | replace | 22 | 24 | 22 | 24 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> c(a);
c[a] = 0;
for (int i = 0; i < a - 1; i++) {
int b;
cin >> b;
c[b - 1]++;
}
for (int i = 0; i < a; i++) {
cout << c[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> c(a);
for (int i = 0; i < a; i++) {
c[i] = 0;
}
for (int i = 0; i < a - 1; i++) {
int b;
cin >> b;
c[b - 1]++;
}
for (int i = 0; i < a; i++) {
cout << c[i] << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 10 | 0 | |
p02707 | C++ | Runtime Error | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | replace | 53 | 54 | 53 | 54 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
using namespace std;
int main(void) {
int n, i, a, cnt[100001];
scanf("%d", &n);
for (i = 1; i <= n; i++)
cnt[i] = 0;
for (i = 2; i <= n; i++) {
scanf("%d", &a);
cnt[a]++;
}
for (i = 1; i <= n; i++)... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
using namespace std;
int main(void) {
int n, i, a, cnt[200001];
scanf("%d", &n);
for (i = 1; i <= n; i++)
cnt[i] = 0;
for (i = 2; i <= n; i++) {
scanf("%d", &a);
cnt[a]++;
}
for (i = 1; i <= n; i++)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#incl... | replace | 25 | 26 | 25 | 26 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> A.at(i);
}
vector<int> buka(N);
for (int i = 0; i < N; i++) {
buka.at(i) = 0;
}
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j < N + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> A.at(i);
}
vector<int> buka(N);
for (int i = 0; i < N; i++) {
buka.at(i) = 0;
}
for (int i = 0; i < N - 1; i++) {
buka.at(A.at(i) - 1)++;
}
for... | replace | 17 | 22 | 17 | 18 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<int, int>... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
using P = pair<int, int>... | replace | 201 | 202 | 201 | 202 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 2 * 10000 + 5;
int s[M], n, x, i;
int main() {
cin >> n;
for (i = 2; i <= n; i++) {
cin >> x;
s[x]++;
}
for (i = 1; i <= n; i++)
cout << s[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 2 * 100000 + 5;
int s[M], n, x, i;
int main() {
cin >> n;
for (i = 2; i <= n; i++) {
cin >> x;
s[x]++;
}
for (i = 1; i <= n; i++)
cout << s[i] << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector<vector<int>... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector<vector<int>... | replace | 34 | 35 | 34 | 35 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define MOD 1000000000
#define inf -100000
#define fast \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define ll long long
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define MOD 1000000000
#define inf -100000
#define fast \
ios_base::sync_with_stdio(0); ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N, 0);
vector<int> count(N, 0);
for (int i = 0; i < N - 1; i++) {
cin >> A.at(i);
count.at(A.at(i - 1)) += 1;
}
for (int i = 0; i < N; i++) {
cout << count.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N, 0);
vector<int> count(N, 0);
for (int i = 0; i < N - 1; i++) {
cin >> A.at(i);
count.at(A.at(i) - 1) += 1;
}
for (int i = 0; i < N; i++) {
cout << count.at(i) << endl;
}
} | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 5)
|
p02707 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int l;
vector<int> A(N);
vector<int> sum(N);
sum[0] = 0;
A[0] = 0;
for (int i = 1; i < N; i++) {
cin >> l;
A[i] = l;
sum[i] = 0;
}
for (int i = 1; i < N; i+... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int l;
vector<int> A(N);
vector<int> sum(N);
sum[0] = 0;
A[0] = 0;
for (int i = 1; i < N; i++) {
cin >> l;
A[i] = l;
sum[i] = 0;
}
for (int i = 1; i < N; i+... | replace | 21 | 26 | 21 | 22 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rr... | replace | 48 | 49 | 48 | 49 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> boss(N - 1);
for (int i = 0; i < N - 1; i++)
cin >> boss.at(i);
vector<int> num(N);
for (int i = 0; i < N - 1; i++) {
int count = 0;
for (int j : boss) {
if (i == j - 1)
count++;
}
nu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> boss(N - 1);
for (int i = 0; i < N - 1; i++)
cin >> boss.at(i);
vector<int> num(N);
for (int i = 0; i < N - 1; i++) {
num.at(boss.at(i) - 1) += 1;
}
for (int i = 0; i < N; i++)
cout << num.at(i) << en... | replace | 13 | 19 | 13 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265358979323846
#define ll long long
#define N 100001
int main() {
ll n;
cin >> n;
ll ara[n - 1];
for (int i = 0; i < n - 1; i++)
cin >> ara[i];
ll x;
ll p[N] = {0};
for (int i = 0; i < n - 1; i++) {
x = ara[i];
p[x]++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265358979323846
#define ll long long
#define N 200001
int main() {
ll n;
cin >> n;
ll ara[n - 1];
for (int i = 0; i < n - 1; i++)
cin >> ara[i];
ll x;
ll p[N] = {0};
for (int i = 0; i < n - 1; i++) {
x = ara[i];
p[x]++;
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | // #include "pch.h"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#incl... | // #include "pch.h"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#incl... | replace | 50 | 51 | 50 | 51 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, j, a[20000], count[20000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
count[i] = 0;
}
for (int i = 0; i < n; i++) {
j = a[i] - 1;
count[j]++;
}
for (int i = 0; i < n; i++) {
cout << count[i] << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, j, a[200000], count[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
count[i] = 0;
}
for (int i = 0; i < n; i++) {
j = a[i] - 1;
count[j]++;
}
for (int i = 0; i < n; i++) {
cout << count[i] << endl;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i > 0; i--)
#define all(v) v.begin(), v.end()
#define debug(x) cout << x << endl
#define vout(v) rep(i, v.size()) cout << v[i] << " ";... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i > 0; i--)
#define all(v) v.begin(), v.end()
#define debug(x) cout << x << endl
#define vout(v) rep(i, v.size()) cout << v[i] << " ";... | replace | 20 | 21 | 20 | 21 | -6 | double free or corruption (out)
|
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N;
int a[200001];
int main() {
cin >> N;
for (int i = 1; i < N; i++)
cin >> a[i];
map<int, int> mp;
for (int i = 1; i < N; i++) {
mp[i] = 0;
}
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
for (int i = 1; i < N; i++) {
if (a[i] == ... | #include <bits/stdc++.h>
using namespace std;
int N;
int a[200001];
int main() {
cin >> N;
for (int i = 1; i < N; i++)
cin >> a[i];
map<int, int> mp;
for (int i = 1; i < N; i++) {
mp[i] = 0;
}
for (int i = 1; i < N; i++) {
mp[a[i]]++;
}
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
... | replace | 13 | 19 | 13 | 15 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (a[j] == i + 1) {
b[i]++;
}
}
}
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
}
vector<int> b(n, 0);
for (int j = 0; j < n - 1; j++) {
b[a[j] - 1]++;
}
for (int i = 0; i < n; i++) {
cout << b[i] << endl;
}
return 0;
} | replace | 11 | 17 | 11 | 13 | TLE | |
p02707 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
vector<int> A;
vector<int> answer;
cin >> N;
rep(i, N) {
A.push_back(0);
answer.push_back(0);
if (i >= 1) {
cin >> A[i];
}
}
rep(i, N) { answer[A[i] - 1]++; ... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
vector<int> A;
vector<int> answer;
cin >> N;
rep(i, N) {
A.push_back(0);
answer.push_back(0);
if (i >= 1) {
cin >> A[i];
}
}
rep(i, N) {
if (i >= 1) {
... | replace | 19 | 20 | 19 | 24 | -6 | double free or corruption (out)
|
p02707 | 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>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n - 1; i++)
cin >> a[i];
vector<int> c(n);
rep(i, n) { c[a[i] - 1]++; }
rep(i, n) { print... | #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>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n - 1; i++)
cin >> a[i];
vector<int> c(n);
for (int i = 0; i < n - 1; i++) {
c[a[i] - 1]... | replace | 14 | 15 | 14 | 17 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> count(100000, 0);
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
count[a - 1]++;
}
for (int i = 0; i < n; i++) {
cout << count[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> count(200000, 0);
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
count[a - 1]++;
}
for (int i = 0; i < n; i++) {
cout << count[i] << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n - 1], ans[n];
for (int i = 0; i < n; i++)
ans[i] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[a[i] - 1]++;
}
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n - 1], ans[n];
for (int i = 0; i < n; i++)
ans[i] = 0;
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
ans[a[i] - 1]++;
}
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for (int j = k; j <= n + 1; j++) {
ll min = 0;
ll max = 0;
for (int i = 0; i < j; i++) {
min += i;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for (int j = k; j <= n + 1; j++) {
// ll min=(j-1)*j/2;
// ll max=(n+n-j+1)*j/2;
// for(int i=0; i<j;i++){
... | replace | 10 | 19 | 10 | 24 | TLE | |
p02708 | C++ | Time Limit Exceeded | #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 fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | #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 fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;... | replace | 36 | 38 | 36 | 38 | TLE | |
p02708 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
const ll mod = 1000000007;
int main() {
int n, k;
cin >> n ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define P pair<int, int>
using ll = int64_t;
using namespace std;
#define ketasuu(n) fixed << setprecision(n)
#define btoe(p) p.begin(), p.end()
#define etob(p) p.rbegin(), p.rend()
const ll mod = 1000000007;
int main() {
int n, k;
cin >> n ... | replace | 14 | 15 | 14 | 15 | -6 | malloc(): corrupted top size
|
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
static const llint MAX = 2e5 + 5;
// static const int NIL = -1;
// static const ll INF = 1<<21;
static const llint MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
static const llint MAX = 2e5 + 5;
// static const int NIL = -1;
// static const ll INF = 1<<21;
static const llint MOD = 1e9 + 7;
bool compPair(const pair<int, int> &arg1, const pair<int, int> &arg2) {
return arg1.first > arg... | replace | 33 | 37 | 33 | 35 | TLE | |
p02708 | C++ | Runtime Error | // Winners don't quit and Quitters don't win
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 1000000007
#define MAX 100005
ll sum[2 * MAX];
ll solve_() {
ll i;
f... | // Winners don't quit and Quitters don't win
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 1000000007
#define MAX 100005
ll sum[2 * MAX];
void solve_() {
ll i;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long tempmin, tempmax;
long long ans = 0;
for (long long i = K; i <= N + 1; i++) {
tempmin = 0;
tempmax = 0;
for (long long j = 0; j < i; j++) {
tempmin = tempmin + j;
tempmax = tempmax + (N ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
long long tempmin, tempmax;
long long ans = 0;
for (long long i = K; i <= N + 1; i++) {
tempmin = (i - 1) * i / 2;
tempmax = (2 * N + 1 - i) * i / 2;
// cout<<tempmin<<" "<<tempmax<<endl;
ans = (ans + tem... | replace | 8 | 14 | 8 | 10 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int N, K;
long int sum = 0;
long int mod = 1000000007;
cin >> N >> K;
for (int i = K; i <= N + 1; i++) {
long int max = 0;
long int min = 0;
for (int j = 0; j < i; j++) {
min += j;
max += (N - j);
}
sum += (max - min ... | #include <iostream>
using namespace std;
int main(void) {
int N, K;
long int sum = 0;
long int mod = 1000000007;
cin >> N >> K;
long int max = 0;
long int min = 0;
for (int i = 0; i < K; i++) {
min += i;
max += (N - i);
}
sum += (max - min + 1);
for (int i = K; i < N + 1; i++) {
min ... | replace | 10 | 17 | 10 | 21 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long c = 0;
for (int kk = k; kk <= n + 1; kk++) {
long long b = 1;
for (int i = 0; i < kk; i++)
b += (n - 2 * i) % (1000000007);
c = (b + c) % (1000000007);
}
cout << c << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long c = 0;
for (long long kk = k; kk <= n + 1; kk++) {
c = (kk * (n + 1 - kk) + 1 + c) % (1000000007);
}
cout << c << endl;
return 0;
}
| replace | 6 | 11 | 6 | 8 | TLE | |
p02708 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> pair_t;
using Graph = vector<vector<ll>>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef pair<ll, ll> pair_t;
using Graph = vector<vector<ll>>;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
/***** define constant start *******/
const ll MOD = 1... | replace | 21 | 23 | 21 | 23 | -6 | munmap_chunk(): invalid pointer
|
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll ans, n, k, i, a, b, j;
cin >> n >> k;
ans = 0;
for (i = k; i <= n + 1; i++) {
a = 0;
b = 0;
for (j = 0; j < i; j++) {
a += j;
b += n - j;
}
ans += b - a + 1;
ans = ans % 1000000007;
}
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll ans, n, k, i, a, b, j;
cin >> n >> k;
ans = 0;
a = 0;
b = 0;
for (j = 0; j < k; j++) {
a += j;
b += n - j;
}
ans += b - a + 1;
ans = ans % 1000000007;
for (i = k; i <= n; i++) {
a += i;
b += n - i;
... | replace | 8 | 15 | 8 | 19 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <stdio.h>
using namespace std;
unsigned long long a(unsigned long long N, unsigned long long K) {
return (N - K + 1) * K + 1;
}
unsigned long long solve(unsigned long long N, unsigned long long K) {
unsigned long long ans = 0;
for (int i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <stdio.h>
using namespace std;
unsigned long long a(unsigned long long N, unsigned long long K) {
return (N - K + 1) * K + 1;
}
unsigned long long solve(unsigned long long N, unsigned long long K) {
unsigned long long ans = 0;
for (int i... | replace | 18 | 19 | 18 | 19 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) ... | insert | 35 | 35 | 35 | 36 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const ll mod = 1000000007;
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n + 1; i++) {
ll tmpLeft = 0;
for (ll j = 0; j < i; j++) {
tmpLeft += j;
}
ll tmpRight = 0;
for (ll j = n - i + 1; j <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const ll mod = 1000000007;
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n + 1; i++) {
ll tmpLeft = (i - 1) * i / 2;
ll tmpRight = n * (n + 1) / 2 - (n - i) * (n - i + 1) / 2;
ans += tmpRight - tmpLeft + 1... | replace | 11 | 19 | 11 | 13 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll sum(ll a, ll b) {
ll count = 0;
for (ll i = a; i <= b; i++)
count += i;
return count;
}
int main(void) {
ll N = 0, M = 0;
cin >> N >> M;
ll s = 0;
for (ll i = M; i <= N + 1; i++) {
s += (sum(N + 1 - i, N) - sum(0, i - 1) +... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll sum(ll a, ll b) {
ll count = 0;
count = (b - a + 1) * (a + b) / 2;
return count;
}
int main(void) {
ll N = 0, M = 0;
cin >> N >> M;
ll s = 0;
for (ll i = M; i <= N + 1; i++) {
s += (sum(N + 1 - i, N) - sum(0, i - 1) + 1);
}
... | replace | 6 | 8 | 6 | 7 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
const int INF = 0x7fffffff;
co... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
const int INF = 0x7fffffff;
co... | replace | 38 | 43 | 38 | 44 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end());
#define vecmin(A) *min_element(A.begin(), A.end());
#define vecmax(A) *max_element(A.beg... | replace | 10 | 22 | 10 | 11 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll i, ans = 0, j, mod = 1e9 + 7;
for (i = k; i <= n + 1; i++) {
ll sum = 0, sum1 = 0;
for (j = 0; j < i; j++) {
sum += j;
sum1 += n - j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll i, ans = 0, j, mod = 1e9 + 7;
for (i = k; i <= n + 1; i++) {
ll sum = 0, sum1 = 0;
sum = i * (i - 1) / 2;
sum1 = i * (n + n - i + 1) / 2;
... | replace | 10 | 14 | 10 | 12 | TLE | |
p02708 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int ans = 0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int ans = 0;... | replace | 17 | 23 | 17 | 21 | TLE | |
p02708 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long K;
cin >> N >> K;
long ans = 0;
vector<long> bb(N + 1);
vector<long> aa(N + 1);
aa.at(0) = 0;
bb.at(0) = 0;
for (int i = 1; i < N + 2; i++) {
bb.at(i) = bb.at(i - 1) + (i - 1);
}
for (int i = 1; i < N + 2; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N;
long K;
cin >> N >> K;
long ans = 0;
vector<long> bb(N + 2);
vector<long> aa(N + 2);
aa.at(0) = 0;
bb.at(0) = 0;
for (int i = 1; i < N + 2; i++) {
bb.at(i) = bb.at(i - 1) + (i - 1);
}
for (int i = 1; i < N + 2; i++) {
... | replace | 11 | 13 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02708 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <math.h>
#define rep(i, m, n) for (int i = (m); i < (n); ++i)
#define rem(i, m, n) for (int i = (m); i > (n); --i)
#define MOD 100000... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <cmath>
#include <math.h>
#define rep(i, m, n) for (int i = (m); i < (n); ++i)
#define rem(i, m, n) for (int i = (m); i > (n); --i)
#define MOD 100000... | replace | 30 | 35 | 30 | 32 | TLE | |
p02709 | C++ | Time Limit Exceeded | // Sakhiya07 - Yagnik Sakhiya
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp make_pair
#define bp __builtin_popcountll
#define MOD 1000000007
const int N = 2005;
#define... | // Sakhiya07 - Yagnik Sakhiya
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp make_pair
#define bp __builtin_popcountll
#define MOD 1000000007
const int N = 2005;
#define... | replace | 28 | 29 | 28 | 30 | TLE | |
p02709 | Python | Time Limit Exceeded | # 解説AC
n = int(input())
A = list(map(int, input().split()))
B = []
for i, e in enumerate(A):
B.append((e, i + 1))
B.sort(reverse=True)
# dp[i][j]: Aiまで入れた時、左にj個決めた時の最大値
dp = [[-1] * (n + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(i + 1): # 左の個数
k = i - j # 右の個数
n... | # 解説AC
import sys
input = sys.stdin.buffer.readline
n = int(input())
A = list(map(int, input().split()))
B = []
for i, e in enumerate(A):
B.append((e, i + 1))
B.sort(reverse=True)
# dp[i][j]: Aiまで入れた時、左にj個決めた時の最大値
dp = [[-1] * (n + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n):
for j in range(i + ... | insert | 1 | 1 | 1 | 5 | TLE | |
p02709 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x7fffffff
#define INFL 0x7fffffffffffffffLL
vector<pair<ll, ll>> a(2000);
ll n;
ll dp[2000][2000];
ll calc(ll x, ll y) {
int idx = x + ((n - 1) - y);
if (idx == n)
return 0;
// if (dp[x][y]!=0) return ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x7fffffff
#define INFL 0x7fffffffffffffffLL
vector<pair<ll, ll>> a(2000);
ll n;
ll dp[2000][2000];
ll calc(ll x, ll y) {
int idx = x + ((n - 1) - y);
if (idx == n)
return 0;
if (dp[x][y] != 0)
retu... | replace | 15 | 16 | 15 | 17 | TLE | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
#define MOD 1'000'000'007
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
#define MOD 1'000'000'007
template <class T> ... | replace | 39 | 40 | 39 | 40 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define eb emplace_back
#define PI 3.14159265
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define hcf(a, b) __gcd(a, b)
#define all(c) c.rbegin(), c.rend()
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define eb emplace_back
#define PI 3.14159265
#define sz(c) (int)c.size()
#define len(c) (int)c.length()
#define hcf(a, b) __gcd(a, b)
#define all(c) c.rbegin(), c.rend()
... | replace | 37 | 39 | 37 | 39 | TLE | |
p02709 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
int main() {
pair<long long, int> order[2020];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long temp;
cin >> temp;
order[i] = make_pair(temp, i + 1);
}
sort(order, order + n);
reverse(ord... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
int main() {
pair<long long, int> order[2020];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
long long temp;
cin >> temp;
order[i] = make_pair(temp, i + 1);
}
sort(order, order + n);
reverse(ord... | replace | 17 | 18 | 17 | 18 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const int mod = 1e9 + 7;
typedef long long ll;
const int N = 2e3 + 5;
int n;
std::vector<std::pair<ll, int>> v;
ll dp[N][N];
ll solve(int l, int r) {
if (dp[l][r] >= 0)
return dp[l][r];
if (r < l)
return dp[l][r] = 0;
int i = n - r + l; // 当前正在放第i个
return std::max(v[i].first * ... | #include <bits/stdc++.h>
const int mod = 1e9 + 7;
typedef long long ll;
const int N = 2e3 + 5;
int n;
std::vector<std::pair<ll, int>> v;
ll dp[N][N];
ll solve(int l, int r) {
if (dp[l][r] >= 0)
return dp[l][r];
if (r < l)
return dp[l][r] = 0;
int i = n - r + l; // 当前正在放第i个
return dp[l][r] =
... | replace | 14 | 16 | 14 | 17 | TLE | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | insert | 47 | 47 | 47 | 49 | TLE | |
p02709 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int n;
vector<P> A;
ll dp[2005][2005];
ll nex[2005][2005];
ll ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
A.push_back(P(a, i));
}
sort(A.b... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int n;
vector<P> A;
ll dp[2005][2005];
ll nex[2005][2005];
ll ans;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
A.push_back(P(a, i));
}
sort(A.b... | replace | 41 | 42 | 41 | 45 | TLE | |
p02709 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
long long dp[2005][2005] = {};
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> a(n + 1);
dp[2005][2005] = {};
for (long long i = 1; i < n + 1; ++i)
cin >> a[i].first, a[i].second = ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
long long dp[2005][2005] = {};
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> a(n + 1);
for (long long i = 1; i < n + 1; ++i)
cin >> a[i].first, a[i].second = i;
sort(a.begin() + 1... | delete | 14 | 15 | 14 | 14 | -11 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
using namespace boost::m... | #include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
using namespace boost::m... | replace | 237 | 238 | 237 | 238 | TLE | |
p02709 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define mes(a, b) memset(a, b, sizeof a)
#define pb push_back
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 2e6 + 10;
const double eps = 1e-1;
ll n;
ll l, r;
ll max(ll x, ll y) { return x > y ? x : y; }
str... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define mes(a, b) memset(a, b, sizeof a)
#define pb push_back
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 2e6 + 10;
const double eps = 1e-1;
ll n;
ll l, r;
ll max(ll x, ll y) { return x > y ? x : y; }
str... | replace | 18 | 19 | 18 | 19 | 0 | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define orep(i, n) for (int i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (int i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (int i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(), (x).end() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define orep(i, n) for (int i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (int i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (int i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(), (x).end() ... | replace | 57 | 58 | 57 | 58 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini \
freopen(name ".inp", "r", stdin); \
freopen(name ".out", "w", stdout)
#define foe(it, c) for (__typeof(c.begin()) it = c.begin();... | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini \
freopen(name ".inp", "r", stdin); \
freopen(name ".out", "w", stdout)
#define foe(it, c) for (__typeof(c.begin()) it = c.begin();... | replace | 22 | 23 | 22 | 23 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec... | replace | 38 | 49 | 38 | 47 | TLE | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
int main() {
int N;
cin >> N;
vector<P> a(N);
for (int i = 0; i < N; i++) {
long long b;
cin >> b;
a[i] = P(b, i);
}
sort(a.begin(), a.end());
long long dp[N][N];
long long ans = 0;
for (int i = 0; i < N; i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
int main() {
int N;
cin >> N;
vector<P> a(N);
for (int i = 0; i < N; i++) {
long long b;
cin >> b;
a[i] = P(b, i);
}
sort(a.begin(), a.end());
long long dp[N + 1][N + 1];
long long ans = 0;
for (int i = 0; ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | replace | 82 | 83 | 82 | 83 | TLE | |
p02709 | C++ | Runtime Error | /*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (i... | /*
Author: Nguyen Tan Bao
Status:
Idea:
*/
#include <bits/stdc++.h>
#define FI first
#define SE second
#define EPS 1e-9
#define ALL(a) a.begin(), a.end()
#define SZ(a) int((a).size())
#define MS(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORE(i, a, b) for (i... | replace | 46 | 47 | 46 | 48 | 0 | |
p02709 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include... | #include <algorithm>
#include <array>
#include <cfenv>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include... | replace | 32 | 33 | 32 | 33 | 0 | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02709 | Python | Time Limit Exceeded | from heapq import heappop, heappush
from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))
hp = []
for i, e in enumerate(a, 1):
heappush(hp, [-e, i])
dp = defaultdict(int)
dp[(0, n + 1)] = 0
while hp:
e, i = heappop(hp)
e = -e
dp2 = defaultdict(int)
for k, v in d... | from heapq import heappop, heappush
from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))
hp = []
for i, e in enumerate(a, 1):
heappush(hp, [-e, i])
dp = defaultdict(int)
dp[(0, n + 1)] = 0
while hp:
e, i = heappop(hp)
e = -e
dp2 = defaultdict(int)
for k, v in d... | replace | 23 | 26 | 23 | 24 | TLE | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
// definitions
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (long long)(l); i--)
#define pb push_back
#define mod... | #include <bits/stdc++.h>
// definitions
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (long long)(l); i--)
#define pb push_back
#define mod... | replace | 140 | 141 | 140 | 141 | 0 | |
p02709 | C++ | Runtime Error | // https://twitter.com/armeria_betrue/status/1251868789773238273
// を見て実装
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#in... | // https://twitter.com/armeria_betrue/status/1251868789773238273
// を見て実装
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#in... | replace | 124 | 125 | 124 | 125 | 0 | |
p02709 | C++ | Runtime Error |
// E - Active Infants
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
pair<ll, int> A[2000]; // 活発度とindexのペア
ll dp[2001][2001]; // dp[l][r]:
// 左端にl人、右端にr人移動させたときのうれしさの合計の最大値
i... |
// E - Active Infants
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
pair<ll, int> A[2000]; // 活発度とindexのペア
ll dp[2001][2001]; // dp[l][r]:
// 左端にl人、右端にr人移動させたときのうれしさの合計の最大値
i... | insert | 33 | 33 | 33 | 36 | 0 | |
p02709 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#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;
#define fo(i, n) for (int i = 0; i < n; i++)
#defi... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#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;
#define fo(i, n) for (int i = 0; i < n; i++)
#defi... | insert | 137 | 137 | 137 | 138 | TLE | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define vcout(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define vcout(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#def... | replace | 28 | 37 | 28 | 37 | -6 | 84cd0eca-6b16-4a88-84a2-fb4ec578664c.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02709/C++/s108658118.cpp:31: int mainsolve(): Assertion `dp[i+1][j+1] >= 0' failed.
|
p02709 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef double db;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
i... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef double db;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout... | replace | 11 | 13 | 11 | 13 | TLE | |
p02709 | C++ | Time Limit Exceeded | #ifndef DEBUG
#define NDEBUG
#endif
#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
// template {{{
// misc {{{
using Z = long long;
... | #ifndef DEBUG
#define NDEBUG
#endif
#include <algorithm>
#include <array>
#include <cassert>
#include <iostream>
#include <iterator>
#include <limits>
#include <numeric>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
// template {{{
// misc {{{
using Z = long long;
... | replace | 129 | 130 | 129 | 130 | TLE | |
p02709 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
using namespace std;
const double pi = acos(-1);
typedef long long ll;
const int maxn = 2005;
struct pp {
ll v;
int id;
bool operator<(const pp &o) const {
if (v != o.v)
return v > o.v;
return id < o.id;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <stdio.h>
using namespace std;
const double pi = acos(-1);
typedef long long ll;
const int maxn = 2005;
struct pp {
ll v;
int id;
bool operator<(const pp &o) const {
if (v != o.v)
return v > o.v;
return id < o.id;... | insert | 48 | 48 | 48 | 50 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define simplify \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl "\... | #include <bits/stdc++.h>
#define simplify \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl "\... | replace | 26 | 27 | 26 | 27 | TLE | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
const int N = 1005;
int dp[N][N];
int n;
vector<pair<int, int>> a;
int solve(int l, int r) {
if (l > r)
return 0;
int &res = dp[l][r];
if (res != -1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define fast ios::sync_with_stdio(false), cin.tie(nullptr);
const int N = 2005;
int dp[N][N];
int n;
vector<pair<int, int>> a;
int solve(int l, int r) {
if (l > r)
return 0;
int &res = dp[l][r];
if (res != -1... | replace | 7 | 8 | 7 | 8 | 0 | |
p02709 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
template <class T> inline bool chmax(T &a, T b) {
if (... | replace | 46 | 48 | 46 | 50 | 0 | |
p02709 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | replace | 84 | 88 | 84 | 89 | TLE | |
p02709 | 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--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | #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--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | delete | 193 | 198 | 193 | 193 | 0 | |
p02710 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int c[maxn];
vector<int> g[maxn];
int siz[maxn];
ll ans[maxn];
void dfs(int at, int p,... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n;
int c[maxn];
vector<int> g[maxn];
int siz[maxn];
ll ans[maxn];
void dfs(int at, int p,... | insert | 31 | 31 | 31 | 34 | TLE | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i)... | replace | 229 | 230 | 229 | 230 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 5e3 + 5;
long long n;
vector<long long> v1[MAXN];
long long ans[MAXN];
long long res[MAXN];
long long col[MAXN];
long long sz[MAXN];
long long f(long long x) { return 1LL * x * (x + 1) / 2; }
void df... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 2e5 + 5;
long long n;
vector<long long> v1[MAXN];
long long ans[MAXN];
long long res[MAXN];
long long col[MAXN];
long long sz[MAXN];
long long f(long long x) { return 1LL * x * (x + 1) / 2; }
void df... | replace | 4 | 5 | 4 | 5 | 0 | |
p02710 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | replace | 64 | 65 | 64 | 65 | TLE | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
int sz[200001], zen[200001], c[200001], ans[200001];
bool used[200001];
vector<int> hen[200000];
int dfssz(int a) {
sz[a] = 1;
for (auto &&i : hen[a])
if (!sz[i])
sz[a] += dfssz(i);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
int sz[200001], zen[200001], c[200001], ans[200001];
bool used[200001];
vector<int> hen[200001];
int dfssz(int a) {
sz[a] = 1;
for (auto &&i : hen[a])
if (!sz[i])
sz[a] += dfssz(i);
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n;
int c[200005], dead[200005], treesize[200... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n;
int c[200005], dead[200005], treesize[200... | replace | 107 | 108 | 107 | 108 | 0 | |
p02710 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | replace | 29 | 30 | 29 | 30 | 0 | |
p02710 | C++ | Runtime Error | // <head>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess {
preprocess() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} ____;
// </head>
// <library>
templat... | // <head>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess {
preprocess() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} ____;
// </head>
// <library>
templat... | replace | 35 | 36 | 35 | 36 | 0 | |
p02710 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a)... | replace | 51 | 52 | 51 | 52 | 0 | |
p02710 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define REL
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iom... | #define _CRT_SECURE_NO_WARNINGS
#define REL
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iom... | replace | 88 | 89 | 88 | 89 | 0 | |
p02710 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#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 rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
constexpr long long MOD = 1000000007... | #pragma GCC optimize("Ofast")
#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 rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define ln '\n'
constexpr long long MOD = 1000000007... | replace | 35 | 36 | 35 | 36 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.