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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += vec[i];
}
if (sum <= N) {
cout << N - sum << ... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec[i];
}
int sum = 0;
for (int i = 0; i < M; i++) {
sum += vec[i];
}
if (sum <= N) {
cout << N - sum << ... | replace | 14 | 15 | 14 | 15 | 0 | |
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
c... | replace | 15 | 16 | 15 | 16 | 0 | |
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 504 | 505 | 504 | 505 | 0 | |
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> V;
for (int i = 0; i < M; i++) {
cin >> V.at(i);
}
int P = 0;
for (int i = 0; i < M; i++) {
P += V.at(i);
}
if (N - P >= 0)
cout << N - P;
else
cout << "-1";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> V(M);
for (int i = 0; i < M; i++) {
cin >> V.at(i);
}
int P = 0;
for (int i = 0; i < M; i++) {
P += V.at(i);
}
if (N - P >= 0)
cout << N - P;
else
cout << "-1";
} | replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02706 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int n, m;
cin >> n >> m;
vector<int> A(m);
rep(i, n) cin >> A.at(i);
int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
int n, m;
cin >> n >> m;
vector<int> A(m);
rep(i, m) cin >> A.at(i);
int ... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int a[100];
int s = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
s += a[i];
}
if (s > n) {
cout << -1 << endl;
} else {
cout << n - s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int a[100100];
int s = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
s += a[i];
}
if (s > n) {
cout << -1 << endl;
} else {
cout << n - s << endl;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02706 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int m;
int a[1000];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < m; i++) {
sum = sum + a[i];
}
if (n - sum < 0) {
cout << -1 << endl;
} else {
cout << n - sum << endl;
... | #include <iostream>
using namespace std;
int main() {
int n;
int m;
int a[10000];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < m; i++) {
sum = sum + a[i];
}
if (n - sum < 0) {
cout << -1 << endl;
} else {
cout << n - sum << endl;... | replace | 7 | 8 | 7 | 8 | 0 | |
p02706 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
int n, m, a[1000];
cin >> n >> m;
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum += a[i];
}
if (sum <= n) {
cout << n - sum;
} else {
cout << -1;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int main() {
int n, m, a[10000];
cin >> n >> m;
int sum = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
sum += a[i];
}
if (sum <= n) {
cout << n - sum;
} else {
cout << -1;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02706 | C++ | Time Limit Exceeded | // #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
// 293206GT
#include <algorithm>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#includ... | // #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
// 293206GT
#include <algorithm>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#includ... | replace | 72 | 73 | 72 | 73 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using... | #include <algorithm>
#include <cmath>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using... | replace | 33 | 34 | 33 | 34 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int human_number;
int __report[160000], __sums[160000] = {0};
cin >> human_number;
for (int index = 1; index < human_number; index++) {
cin >> __report[index];
__sums[__report[index]]++;
}
for (int index = 1; index <=... | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int human_number;
int __report[2560000], __sums[2560000] = {0};
cin >> human_number;
for (int index = 1; index < human_number; index++) {
cin >> __report[index];
__sums[__report[index]]++;
}
for (int index = 1; index ... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
const double PI = 3.14159265358979323846;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
int b = 0;
for (int j = 0; j < n; j++) {
cin >> a[j];
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
const double PI = 3.14159265358979323846;
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> b(N);
for (int ... | replace | 6 | 18 | 6 | 18 | TLE | |
p02707 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A[21000];
cin >> N;
A[1] = 1;
for (int i = 2; i <= N; ++i)
cin >> A[i];
int B[N];
for (int i = 1; i <= N; ++i) {
B[i] = 0;
}
for (int i = 1; i <= N; ++i) {
if (i != A[i])
B[A[i]] += 1;
}
for (in... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A[220000];
cin >> N;
A[1] = 1;
for (int i = 2; i <= N; ++i)
cin >> A[i];
int B[N];
for (int i = 1; i <= N; ++i) {
B[i] = 0;
}
for (int i = 1; i <= N; ++i) {
if (i != A[i])
B[A[i]] += 1;
}
for (i... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[10000], p = 0;
memset(arr, 0, sizeof(arr));
cin >> n;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
arr[x]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[1000000], p = 0;
memset(arr, 0, sizeof(arr));
cin >> n;
for (int i = 2; i <= n; i++) {
int x;
cin >> x;
arr[x]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << "\n";
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#include <filesystem>
namespace fs = std::filesystem;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = ... | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#include <filesystem>
namespace fs = std::filesystem;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = ... | replace | 73 | 74 | 73 | 74 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N - 1; i++) {
cin >> A[i];
}
vector<int> C(N);
for (int i = 0; i < N; i++) {
C[A[i] - 1]++;
}
for (int i = 0; i < N; i++) {
cout << C[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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]++;
}
for (int i = 0; i < N; i++) {
cout << C[i] << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//////////////////////////////////////////////////////////////////////////////////////... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
//////////////////////////////////////////////////////////////////////////////////////... | replace | 20 | 21 | 20 | 21 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
#define read(x) scanf("%d", &x)
#define readl(x) scanf("%lld", &x)
#define ll long long
#define ull unsigned long long
int n, l;
int b[100005] = {0};
int main() {
read(n);
for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
#define read(x) scanf("%d", &x)
#define readl(x) scanf("%lld", &x)
#define ll long long
#define ull unsigned long long
int n, l;
int b[200005] = {0};
int main() {
read(n);
for (int i... | replace | 14 | 15 | 14 | 15 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 11;
const int M = 1e6 + 11;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
int son[N];
int main(int argc, char **args) {
// freopen("in.txt", "r", stdin);
int n;
cin >> n;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e5 + 11;
const int M = 1e6 + 11;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
int son[N];
int main(int argc, char **args) {
// freopen("in.txt", "r", stdin);
int n;
cin >> n;
for (int i =... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define ll long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define loop(i, start, stop) for (int i = start; i < (stop); i++)
using namespace std;
int... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#define ll long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define loop(i, start, stop) for (int i = start; i < (stop); i++)
using namespace std;
int... | replace | 16 | 18 | 16 | 18 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
int tmp;
cin >> num;
vector<pair<int, int>> v;
a... | #include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
int tmp;
cin >> num;
array<long long, 200010> ans ... | replace | 18 | 21 | 18 | 20 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans[n];
for (int i = 0; i < n; i++) {
ans[i] = 0;
}
int a;
for (int i = 1; i < n; i++) {
cin >> a;
for (int j = 1; j <= n; j++) {
if (j == a) {
ans[j - 1] = ans[j - 1] + 1;
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans[n];
for (int i = 0; i < n; i++) {
ans[i] = 0;
}
int a;
for (int i = 1; i < n; i++) {
cin >> a;
ans[a - 1] = ans[a - 1] + 1;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
| replace | 13 | 19 | 13 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
int a[10000], b[10000] = {};
int i = 0;
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> a[i];
b[a[i] - 1]++;
}
for (int i = 0; i < N; i++) {
cout << b[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
int a[1000000], b[1000000] = {};
int i = 0;
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> a[i];
b[a[i] - 1]++;
}
for (int i = 0; i < N; i++) {
cout << b[i] << endl;
}
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
// #define endl '\n'
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define se second
#define fi first
#define pai acos(-1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
// #define endl '\n'
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define se second
#define fi first
#define pai acos(-1... | replace | 62 | 63 | 62 | 63 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long... | replace | 38 | 39 | 38 | 39 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> vec.at(i);
}
vector<int> ans(n, 0);
for (int i = 0; i < n - 1; i++) {
ans.at(vec.at(i) - 1)++;
}
// cout << ans.at(0);
for (int i = 0; i <... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> vec.at(i);
}
vector<int> ans(n, 0);
for (int i = 0; i < n - 1; i++) {
ans.at(vec.at(i) - 1)++;
}
cout << ans.at(0);
for (int i = 1; i < n;... | replace | 14 | 17 | 14 | 17 | -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)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int S[100000] = {0};
int M;
int W;
cin >> M;
for (int i = 0; i < M - 1; i++) {
cin >> W;
S[W - 1]++;
}
cout << "";
for (int i = 0; i < M; i++) {
cout << S[i] << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int S[200000] = {0};
int M;
int W;
cin >> M;
for (int i = 0; i < M - 1; i++) {
cin >> W;
S[W - 1]++;
}
cout << "";
for (int i = 0; i < M; i++) {
cout << S[i] << "\n";
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i... | replace | 17 | 18 | 17 | 18 | 0 | |
p02707 | C++ | Runtime Error | // naveen mall
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#... | // naveen mall
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#... | replace | 44 | 45 | 44 | 45 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, m;
cin >> n;
// cin>>m;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
a[i] = 0;
}
for (int i = 1; i < n; i++) {
int b;
cin >> b;
for (int j = 0; j < n; j++) {
if (j + 1 == b)
a[j]++;... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n, m;
cin >> n;
// cin>>m;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
a[i] = 0;
}
for (int i = 1; i < n; i++) {
int b;
cin >> b;
a[b - 1]++;
}
for (int i = 0; i < n; i++) {
cout << a[i] <... | replace | 17 | 21 | 17 | 18 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long;
#define dbg(x) cout << #x << "--------------" << x << endl;
#define dl cout << "LINE" << __LINE__ << endl;
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
int a[9999];
cin >> n;
for (int i = 2; i <= n; i++) {
int ... | #include <bits/stdc++.h>
#define ll long long;
#define dbg(x) cout << #x << "--------------" << x << endl;
#define dl cout << "LINE" << __LINE__ << endl;
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
int a[999999];
cin >> n;
for (int i = 2; i <= n; i++) {
in... | replace | 9 | 10 | 9 | 10 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int cnt[100010] = {0};
cin >> n;
for (int i = 1; i < n; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
int cnt[200010] = {0};
cin >> n;
for (int i = 1; i < n; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using P = pair<int, int>;
const int INF = 1e9;
const ll INFLL = 1e18;
const int MOD = 1e9 + 7;
const int NIL = -1;
const ld PI = acosl(-1);
#define rep(i, n) for (int i = 0; i <... | replace | 28 | 29 | 28 | 29 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int i, n;
int *C;
cin >> n;
C = (int *)malloc(sizeof(int));
for (i = 0; i < n; i++) {
C[i] = 0;
}
for (i = 0; i < n - 1; i++) {
int k;
cin >> k;
C[k - 1]++;
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int i, n;
int *C;
cin >> n;
C = (int *)malloc(sizeof(int) * n);
for (i = 0; i < n; i++) {
C[i] = 0;
}
for (i = 0; i < n - 1; i++) {
int k;
cin >> k;
C[k - 1]+... | replace | 12 | 13 | 12 | 13 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n, 0);
for (int i = 0; i < n - 1; i++)
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n - 1);
vector<int> b(n, 0);
for (int i = 0; i < n - 1; i++)... | replace | 16 | 17 | 16 | 17 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void chkmax(T1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void chkmax(T1... | replace | 23 | 24 | 23 | 24 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
#define ll long int
const int ARR = 1e5 + 2;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[ARR];
a[0] = 1;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
ll ans[ARR] = {0};
for (int i = 1; i < n; i++) {
ans[a[i] - 1]++;
}
for (int i = 0; i < n; i++) {
cout << a... | #include <iostream>
#define ll long int
const int ARR = 2e5 + 5;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[ARR];
a[0] = 1;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
ll ans[ARR] = {0};
for (int i = 1; i < n; i++) {
ans[a[i] - 1]++;
}
for (int i = 0; i < n; i++) {
cout << a... | replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
A[0] = 0;
B[0] = 0;
for (int i = 1; i < N; i++) {
cin >> A[i];
B[i] = 0;
}
for (int i = 0; i < N; i++) {
B[A[i] - 1] +=... |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
A[0] = 0;
B[0] = 0;
for (int i = 1; i < N; i++) {
cin >> A[i];
B[i] = 0;
}
for (int i = 1; i < N; i++) {
B[A[i] - 1] +=... | replace | 23 | 24 | 23 | 24 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespa... | replace | 33 | 34 | 33 | 34 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int A[100005];
int main() {
int N, M;
cin >> N;
for (int i = 1; i < N; i++) {
int t;
cin >> t;
A[t - 1]++;
}
for (int i = 0; i < N; i++)
cout << A[i] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int A[200005];
int main() {
int N, M;
cin >> N;
for (int i = 1; i < N; i++) {
int t;
cin >> t;
A[t - 1]++;
}
for (int i = 0; i < N; i++)
cout << A[i] << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vector<int> a(n - 1);
rep(i, n - 1) cin >> a[i];
ll ans1 = 0;
rep(i, n - ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
vector<int> a(n - 1);
rep(i, n - 1) cin >> a[i];
vector<int> z(n);
rep(i,... | replace | 15 | 30 | 15 | 19 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 2;
int arr[MAXN];
int main() {
int N;
cin >> N;
for (int i = 2; i <= N; i++) {
int pos;
cin >> pos;
arr[pos]++;
}
for (int i = 1; i <= N; i++) {
cout << arr[i] << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 2;
int arr[MAXN];
int main() {
int N;
cin >> N;
for (int i = 2; i <= N; i++) {
int pos;
cin >> pos;
arr[pos]++;
}
for (int i = 1; i <= N; i++) {
cout << arr[i] << "\n";
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N, 0);
for (int i = 1; i < N; i++) {
cin >> s.at(i);
}
vector<int> result(N, 0);
for (int i = 1; i < N; i++) {
for (int j = 1; j < N; j++) {
if (s.at(j) == i) {
result.at(i - 1) += 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> s(N, 0);
for (int i = 1; i < N; i++) {
cin >> s.at(i);
}
vector<int> result(N, 0);
for (int i = 1; i < N; i++) {
result.at(s.at(i) - 1) += 1;
}
for (int i = 0; i < N; i++) {
cout << result.at(i) << endl... | replace | 11 | 16 | 11 | 12 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N - 1);
vector<int> b(N);
for (int i = 0; i < N - 1; i++) {
cin >> a[i];
}
for (int j = 0; j < N - 1; j++) {
for (int k = 1; k < N; k++) {
if (a[j] == k)
b[k - 1]++;
}
}
for (int l = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N - 1);
vector<int> b(N);
for (int i = 0; i < N - 1; i++) {
cin >> a[i];
}
for (int j = 0; j < N - 1; j++) {
b[a[j] - 1]++;
}
for (int l = 0; l < N; l++) {
cout << b[l] << endl;
}
}
| replace | 13 | 17 | 13 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long int ll;
using namespace std;
#define maxN 200007
int n;
int solve() {
int temp[maxN] = {};
for (int i = 0; i < n - 1; i++) {
int a;
... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
typedef long long int ll;
using namespace std;
#define maxN 200007
int n;
void solve() {
int temp[maxN] = {};
for (int i = 0; i < n - 1; i++) {
int a;... | replace | 15 | 16 | 15 | 16 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
signed main() {
int subs[100000];
int n;
cin >> n;
subs[0] = 0;
for (int i = 1; i < n; i++) {
subs[i] = 0;
int no;
cin >> no;
subs[no - 1]++;
}
for (int i = 0; i < n; i++) {
cout << subs[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int subs[200000];
int n;
cin >> n;
subs[0] = 0;
for (int i = 1; i < n; i++) {
subs[i] = 0;
int no;
cin >> no;
subs[no - 1]++;
}
for (int i = 0; i < n; i++) {
cout << subs[i] << endl;
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll = long long;
using ull = unsigned long long;
const ll INF = 1001001001;
// 10億7。 100000007
// 最大公約数
ll gc... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include <stdio.h>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll = long long;
using ull = unsigned long long;
const ll INF = 1001001001;
// 10億7。 100000007
// 最大公約数
ll gc... | replace | 38 | 39 | 38 | 39 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
int n;
cin >> n;
int temp;
for (int i = 1; i < n; i++) {
cin >> temp;
a[temp]++;
}
for (int i = 1; i <= n; i++)
cout << a[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[200001];
int main() {
int n;
cin >> n;
int temp;
for (int i = 1; i < n; i++) {
cin >> temp;
a[temp]++;
}
for (int i = 1; i <= n; i++)
cout << a[i] << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> vec.at(i);
}
vector<int> count(N - 1);
for (int i = 0; i < N - 1; i++) {
count.at(vec.at(i))++;
}
for (int i = 1; i <= N; i++) {
cout << count.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> vec.at(i);
}
vector<int> count(N + 1);
for (int i = 0; i < N - 1; i++) {
count.at(vec.at(i))++;
}
for (int i = 1; i <= N; i++) {
cout << count.at(... | replace | 11 | 12 | 11 | 12 | -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)
|
p02707 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v1(n);
vector<int> v2(n - 1);
for (int i = 0; i < n - 1; ++i) {
cin >> v2[i];
}
for (int i = 1; i < n; ++i) {
for (int j = 0; j < n - 1; j++) {
if (i == v2[j])
v1[i - 1]++;
}
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v1(n);
vector<int> v2(n - 1);
for (int i = 0; i < n - 1; ++i) {
cin >> v2[i];
v1[v2[i] - 1]++;
}
for (int i = 0; i < n; ++i) {
cout << v1[i] << endl;
}
return 0;
} | replace | 10 | 16 | 10 | 11 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
#define endl "\n"
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make... | replace | 64 | 65 | 64 | 65 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 2; i <= n; i++)
cin >> a[i];
int v[n + 1];
for (int i = 1; i <= n; i++) {
v[i] = 0;
}
for (int i = 1; i <= n; i++) {
v[a[i]]++;
}
for (int i = 1; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 2; i <= n; i++)
cin >> a[i];
int v[n + 1];
for (int i = 1; i <= n; i++) {
v[i] = 0;
}
for (int i = 2; i <= n; i++) {
v[a[i]]++;
}
for (int i = 1; i <= n; i++) {
... | replace | 13 | 14 | 13 | 14 | -11 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
for (int x : A) {
cin >> x;
B.at(x - 1)++;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N - 1);
vector<int> B(N);
for (int x : A) {
cin >> x;
B.at(x - 1)++;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << endl;
}
}
| replace | 6 | 7 | 6 | 7 | -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++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.en... | replace | 34 | 35 | 34 | 35 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, i, c[100], x;
cin >> t;
for (i = 1; i <= t - 1; i++) {
cin >> x;
c[x]++;
}
for (int i = 1; i <= t; i++)
cout << c[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int t, i, c[1000005], x;
cin >> t;
for (i = 1; i <= t - 1; i++) {
cin >> x;
c[x]++;
}
for (int i = 1; i <= t; i++)
cout << c[i] << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v)... | replace | 31 | 32 | 31 | 32 | 0 | |
p02707 | C++ | Runtime Error | /**
* author: musasi
* created: 19.04.2020 21:29:30
**/
#include <bits/stdc++.h>
using namespace std;
#define rep2(x, from, to) for (long long(x) = (from); (x) < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S ... | /**
* author: musasi
* created: 19.04.2020 21:29:30
**/
#include <bits/stdc++.h>
using namespace std;
#define rep2(x, from, to) for (long long(x) = (from); (x) < (to); (x)++)
#define rep(x, to) rep2(x, 0, to)
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n - 1; i > 0LL; i--)
#define FOR(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.e... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n - 1; i > 0LL; i--)
#define FOR(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.e... | replace | 64 | 65 | 64 | 65 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<int> g[N];
int sz[N];
int dfs(int u, int p) {
sz[u] = 1;
for (int v : g[u])
if (v != p)
sz[u] += dfs(v, u);
return sz[u];
}
int main() {
int n;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
int p;
scanf("%d",... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
vector<int> g[N];
int sz[N];
int dfs(int u, int p) {
sz[u] = 1;
for (int v : g[u])
if (v != p)
sz[u] += dfs(v, u);
return sz[u];
}
int main() {
int n;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
int p;
scanf("%d",... | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> a.at(i);
}
vector<int> sum(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (i + 1 == a.at(j)) {
sum.at(i) += ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> a.at(i);
}
vector<int> sum(n);
for (int i = 0; i < n - 1; i++) {
sum.at(a.at(i) - 1)++;
}
for (int i = 0; i < n; i++) {
cout << sum.at(i) ... | replace | 11 | 17 | 11 | 13 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
struct node {
int num;
int sco;
} b[200005];
int main() {
int n, i, j;
cin >> n;
int a[n];
for (i = 1; i <= n; i++)
b[i].num = i;
for (i = 1; i < n; i++)
cin >> a[i];
for (i = 1; i < n; i++)
for (j = 1; j <= n; j++) {
if (a[i] == b[j].n... | #include <bits/stdc++.h>
using namespace std;
struct node {
int num;
int sco;
} b[200005];
int main() {
int n, i, j;
cin >> n;
int a[n];
for (i = 1; i <= n; i++)
b[i].num = i;
for (i = 1; i < n; i++)
cin >> a[i];
for (i = 1; i < n; i++)
b[a[i]].sco++;
for (i = 1; i <= n; i++)
cout... | replace | 19 | 23 | 19 | 20 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define cl(x) x.clear()
#define all(x) x.begin(), x.end()
#define r(... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define cl(x) x.clear()
#define all(x) x.begin(), x.end()
#define r(... | replace | 45 | 46 | 45 | 46 | 0 | |
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;
int main() {
int n, x = 0;
cin >> n;
vector<int> a, b;
rep(i, n - 1) cin >> a[i];
rep(i, n) b[i] = 0;
sort(a.begin(), a.end());
rep(i, n) {
while (a[x] == i + 1) {
x++;
b[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n, x = 0;
cin >> n;
vector<int> a(n - 1), b(n);
rep(i, n - 1) cin >> a[i];
rep(i, n) b[i] = 0;
sort(a.begin(), a.end());
rep(i, n) {
while (a[x] == i + 1) {
x++;
... | replace | 8 | 9 | 8 | 9 | -11 | |
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> ans(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (i + 1 == a.at(j)) {
ans.at(i)++;
}
... | #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> ans(n);
for (int i = 0; i < n - 1; i++) {
ans.at(a.at(i) - 1)++;
}
for (int i = 0; i < n; i++) {
cout << ans.at(i) << endl;
}... | replace | 10 | 17 | 10 | 13 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
// define
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int n;
cin >> n;
vi a(n), b(n);
rep(i, n - 1) cin >> a[i];
rep(i, n) { ... | #include <bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
// define
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int n;
cin >> n;
vi a(n), b(n);
rep(i, n - 1) cin >> a[i];
rep(i, n - 1... | replace | 16 | 17 | 16 | 17 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[20000] = {0};
int c[20000] = {0};
for (int i = 2; i <= N; i++) {
cin >> a[i];
c[a[i]]++;
}
for (int i = 1; i <= N; i++) {
cout << c[i] << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[200001] = {0};
int c[200001] = {0};
for (int i = 2; i <= N; i++) {
cin >> a[i];
c[a[i]]++;
}
for (int i = 1; i <= N; i++) {
cout << c[i] << endl;
}
} | replace | 8 | 10 | 8 | 10 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> add(n);
rep(i, n - 1) { cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> add(n);
rep(i, n - 1) { cin >>... | replace | 17 | 22 | 17 | 18 | TLE | |
p02707 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll lo... |
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll lo... | replace | 41 | 53 | 41 | 45 | TLE | |
p02707 | C++ | Runtime Error | using namespace std;
#include <bits/stdc++.h>
int n, x;
int a[100005];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
a[x - 1]++;
}
for (int i = 0; i < n; i++) {
cout << a[i] << endl;
}
} | using namespace std;
#include <bits/stdc++.h>
int n, x;
int a[200005];
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
a[x - 1]++;
}
for (int i = 0; i < n; i++) {
cout << a[i] << endl;
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ar[100003];
int main() {
int n;
cin >> n;
int x;
for (int i = 1; i <= n - 1; i++) {
cin >> x;
ar[x] = ar[x] + 1;
}
for (int i = 1; i <= n; i++) {
cout << ar[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int ar[200005];
int main() {
int n;
cin >> n;
int x;
for (int i = 1; i <= n - 1; i++) {
cin >> x;
ar[x] = ar[x] + 1;
}
for (int i = 1; i <= n; i++) {
cout << ar[i] << endl;
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(20001);
for (int i = 0; i < n - 1; i++) {
int x;
cin >> x;
a[x]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << '\n';
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(200001);
for (int i = 0; i < n - 1; i++) {
int x;
cin >> x;
a[x]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << '\n';
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02707 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
for i in range(1, N + 1):
print(A.count(i))
| N = int(input())
A = list(map(int, input().split()))
lis = [0] * N
for i in range(N - 1):
lis[(A[i] - 1)] += 1
for i in range(N):
print(lis[i])
| replace | 2 | 4 | 2 | 9 | TLE | |
p02707 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
for i in range(n):
print(a.count(i + 1))
| n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(n)]
for i in a:
b[i - 1] += 1
for i in b:
print(i)
| replace | 2 | 4 | 2 | 9 | TLE | |
p02707 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
B = []
for i in range(1, N + 1):
print(A.count(i))
| N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for i in A:
B[i - 1] += 1
for i in B:
print(i)
| replace | 2 | 5 | 2 | 7 | TLE | |
p02707 | Python | Time Limit Exceeded | N = int(input())
A_i = list(map(int, input().split()))
uq_A_i = list(set(A_i))
C = ["0\n"] * N
for i in uq_A_i:
C[i - 1] = "{}".format(A_i.count(i)) + "\n"
print("".join(C))
| N = int(input())
A_i = list(map(int, input().split()))
C = [0] * N
for i in A_i:
C[i - 1] += 1
print(*C)
| replace | 2 | 7 | 2 | 6 | TLE | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int *p;
cin >> n;
p = new int(n);
for (int i = 0; i < n; i++)
p[i] = 0;
for (int i = 0; i < n - 1; i++) {
int data;
cin >> data;
p[data - 1]++;
}
for (int i = 0; i < n; i++)
cout << p[i] << endl;
delete[] p;
ret... | #include <iostream>
using namespace std;
int main() {
int n;
int *p;
cin >> n;
p = new int[n];
for (int i = 0; i < n; i++)
p[i] = 0;
for (int i = 0; i < n - 1; i++) {
int data;
cin >> data;
p[data - 1]++;
}
for (int i = 0; i < n; i++)
cout << p[i] << endl;
delete[] p;
ret... | replace | 9 | 10 | 9 | 10 | 0 | |
p02707 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace ... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace ... | replace | 77 | 78 | 77 | 78 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define repi(i, a, n) for (int i = (int)a; i < (int)(n); i++)
#define ll long long
int main(void) {
int n;
std::cin >> n;
std::vector<int> num(100005, 0);
rep(i, n - 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define repi(i, a, n) for (int i = (int)a; i < (int)(n); i++)
#define ll long long
int main(void) {
int n;
std::cin >> n;
std::vector<int> num(1000005, 0);
rep(i, n - 1) {
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02707 | C++ | Time Limit Exceeded | #pragma GCC diagnostic error "-std=c++14"
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include <cctype>
#include <cstdio>
using namespace std;
template <class code> inline code read(const code &a) {
code x = 0;
short w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '... | #pragma GCC diagnostic error "-std=c++14"
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include <cctype>
#include <cstdio>
using namespace std;
template <class code> inline code read(const code &a) {
code x = 0;
short w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '... | replace | 31 | 32 | 31 | 32 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
a[0] = 0;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
a[0] = 0;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
... | replace | 18 | 20 | 18 | 27 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec1(N - 1);
vector<int> vec2(N);
for (int i = 0; i < N - 1; i++) {
cin >> vec1.at(i);
}
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < N; j++) {
if (vec1.at(i) == j) {
vec2.at(j - 1)++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec1(N - 1);
vector<int> vec2(N);
for (int i = 0; i < N - 1; i++) {
cin >> vec1.at(i);
vec2.at(vec1.at(i) - 1)++;
}
for (int i = 0; i < N; i++) {
cout << vec2.at(i) << endl;
}
} | replace | 12 | 20 | 12 | 13 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int N;
int A[200001];
cin >> N;
for (int i = 2; i <= N; i++) {
cin >> A[i];
}
int ans[200001];
for (int i = 1; i <= N; i++) {
for (int j = 2; j <= N; j++) {
if (A[j] == i) {
ans[i]++;
}
}
}
for (int i = 1; i <... | #include <iostream>
using namespace std;
int main(void) {
int N;
int A[200001];
cin >> N;
for (int i = 2; i <= N; i++) {
cin >> A[i];
}
int ans[200001];
for (int j = 2; j <= N; j++) {
ans[A[j]]++;
}
for (int i = 1; i <= N; i++) {
cout << ans[i] << endl;
}
return 0;
} | replace | 12 | 18 | 12 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int A[20001] = {0};
int N;
int chk;
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> chk;
A[chk]++;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << " ";
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A[200001] = {0};
int N;
int chk;
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> chk;
A[chk]++;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << " ";
}
cout << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define PI 3.141592653
int main() {
ll arr[20002] = {0};
ll n;
cin >> n;
rep(i, 1, n) {
ll ch;
cin >> ch;
arr[ch] += 1;
}
rep(i, 1, n + 1) cout << arr[i] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define PI 3.141592653
int main() {
ll arr[200002] = {0};
ll n;
cin >> n;
rep(i, 1, n) {
ll ch;
cin >> ch;
arr[ch] += 1;
}
rep(i, 1, n + 1) cout << arr[i] << "\n";
return 0;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), ans(n, 0);
for (int i = 2; i <= n; i++)
cin >> a.at(i);
for (int i = 2; i <= n; i++)
ans.at(a.at(i))++;
for (int i = 1; i <= n; i++)
cout << ans.at(i) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n - 1);
vector<long long> B(n, 0);
for (int i = 0; i < n - 1; i++) {
cin >> A.at(i);
B.at(A.at(i) - 1)++;
}
for (int i = 0; i < n; i++) {
cout << B.at(i) << endl;
}
}
| replace | 6 | 13 | 6 | 17 | -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)
|
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> A.at(i);
}
vector<long long> B(n, 0);
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j < n; j++) {
if (A.at(i) == j) {
B.at(j - 1)++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> A.at(i);
}
vector<long long> B(n, 0);
for (int i = 0; i < n - 1; i++) {
B.at(A.at(i) - 1)++;
}
for (int i = 0; i < n; i++) {
cout << B.at(i)... | replace | 15 | 20 | 15 | 16 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
a[i] = 0;
}
int A[n];
for (int i = 2; i <= n; i++) {
cin >> A[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == A[j])
a[i]++;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i <= n; i++) {
a[i] = 0;
}
int A[n];
for (int i = 2; i <= n; i++) {
cin >> A[i];
a[A[i]]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << endl;
}
return 0;
} | replace | 15 | 22 | 15 | 16 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mN = 100100;
int c[mN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 2, a; i <= n; i++)
cin >> a, c[a]++;
for (int i = 1; i <= n; i++)
cout << c[i] << " ";
} | #include <bits/stdc++.h>
using namespace std;
const int mN = 200200;
int c[mN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 2, a; i <= n; i++)
cin >> a, c[a]++;
for (int i = 1; i <= n; i++)
cout << c[i] << " ";
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 2; i <= (int)(n); i++)
long long A[21111];
long long dp[21111];
int main() {
long long N;
cin >> N;
rep(i, N) {
cin >> A[i];
dp[A[i]]++;
}
for (int i ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 2; i <= (int)(n); i++)
long long A[211111];
long long dp[211111];
int main() {
long long N;
cin >> N;
rep(i, N) {
cin >> A[i];
dp[A[i]]++;
}
for (int ... | replace | 8 | 10 | 8 | 10 | 0 | |
p02707 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define mes(a, b) memset(a, b, sizeof a)
#define pb push_back
typedef unsigned long long int ull;
typedef long long int ll;
const int maxn = 1e5 + 20;
const int maxm = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
const d... |
#include <bits/stdc++.h>
#define mes(a, b) memset(a, b, sizeof a)
#define pb push_back
typedef unsigned long long int ull;
typedef long long int ll;
const int maxn = 2e5 + 20;
const int maxm = 1e5 + 10;
const ll mod = 1e9 + 7;
const ll INF = 1e18 + 100;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
const d... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | //**PEACE BE UPON YOU**
// AZMAYEN FAYEK SABIL
// IUT CSE SWE-19
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
int a[100005];
int c[100005] = {0};
int i;
for (i = 1; i < n; i++) {
cin >> a[i]... | //**PEACE BE UPON YOU**
// AZMAYEN FAYEK SABIL
// IUT CSE SWE-19
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
int a[200005];
int c[200005] = {0};
int i;
for (i = 1; i < n; i++) {
cin >> a[i]... | replace | 18 | 20 | 18 | 20 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n + 1);
for (int i = 1; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n + 1; i++) {
int cnt = 0;
for (int j = 1; j < n + 1; j++) {
if (i == a[j]) {
cnt++;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n + 1);
for (int i = 1; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
for (int i = 1; i < n + 1; i++)
cout << b[i] << endl;
} | replace | 11 | 20 | 11 | 12 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n;
cin >> n;
long long int a[n];
vector<long long int> v(n + 1, 0);
for (long long int i = 0; i < n; i++) {
cin >> a[i];
v[a[i]] += 1;
}
for (long long int i = 1; i < n + 1; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long int n;
cin >> n;
long long int a[n];
vector<long long int> v(n + 1, 0);
for (long long int i = 0; i < n - 1; i++) {
cin >> a[i];
v[a[i]] += 1;
}
for (long long int i = 1; i < n + 1; i... | replace | 9 | 10 | 9 | 10 | -11 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7;
int freq[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
freq[x]++;
}
for (int i = 1; i <= n; i++... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int freq[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
freq[x]++;
}
for (int i = 1; i <= n; i++... | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (i = a; i < n; i++)
#define per(i, a, n) for (i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define SIZE 1000001
#define ONL... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (i = a; i < n; i++)
#define per(i, a, n) for (i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define SIZE 1000001
#define ONL... | replace | 39 | 40 | 39 | 40 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n - 1);
vector<int> cnt(n, 0);
for (int i = 1; i < n; i++)
cin >> a[i];
for (int i = 1; i < n;) {
cnt[a[i] - 1]++;
i++;
}
for (int i = 0; i < n; i++)
cout << cnt[i] << endl;
... | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(n, 0);
for (int i = 1; i < n; i++)
cin >> a[i];
for (int i = 1; i < n;) {
cnt[a[i] - 1]++;
i++;
}
for (int i = 0; i < n; i++)
cout << cnt[i] << endl;
retu... | replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int ar[100000] = {0};
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int temp;
cin >> temp;
++ar[temp];
}
for (int i = 1; i <= n; i++) {
printf("%d\n", ar[i]);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ar[1000000] = {0};
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int temp;
cin >> temp;
++ar[temp];
}
for (int i = 1; i <= n; i++) {
printf("%d\n", ar[i]);
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(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 bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(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 bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02707 | Python | Runtime Error | N = int(input())
A = list(map(int, input().split()))
result = [0] * N
for a in A:
result[a - 1] += 1
print("\n".join(result))
| N = int(input())
A = list(map(int, input().split()))
result = [0] * N
for a in A:
result[a - 1] += 1
print("\n".join(map(str, result)))
| replace | 6 | 7 | 6 | 7 | TypeError: sequence item 0: expected str instance, int found | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02707/Python/s320227284.py", line 7, in <module>
print('\n'.join(result))
TypeError: sequence item 0: expected str instance, int found
|
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int mp[100200];
int s[100200];
int main() {
int a, i;
cin >> a;
for (i = 2; i <= a; i++) {
cin >> s[i];
mp[s[i]]++;
}
for (i = 1; i <= a; i++) {
cout << mp[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int mp[1000200];
int s[1000200];
int main() {
int a, i;
cin >> a;
for (i = 2; i <= a; i++) {
cin >> s[i];
mp[s[i]]++;
}
for (i = 1; i <= a; i++) {
cout << mp[i] << endl;
}
return 0;
}
| replace | 2 | 4 | 2 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.