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 | 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()))
result = [0] * n
for x in a:
result[x - 1] += 1
for v in result:
print(v)
| replace | 2 | 4 | 2 | 7 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ara[21000];
int main() {
int n, x, i;
cin >> n;
for (i = 1; i < n; i++) {
cin >> x;
ara[x]++;
}
for (i = 1; i <= n; i++) {
cout << ara[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int ara[210000];
int main() {
int n, x, i;
cin >> n;
for (i = 1; i < n; i++) {
cin >> x;
ara[x]++;
}
for (i = 1; i <= n; i++) {
cout << ara[i] << endl;
}
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
rep(i, n - 1) cin >> a[i];
vector<int> b(n, 0);
rep(i, n - 1) rep(j, n) {
if (a[i] == j + 1)
b[j]++;
}
rep(i, n) cout << b[i] << endl;
} | #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 - 1);
rep(i, n - 1) cin >> a[i];
vector<int> b(n, 0);
int cnt = 0;
rep(i, n - 1) { b[a[i] - 1]++; }
rep(i, n) cout << b[i] << endl;
} | replace | 12 | 16 | 12 | 14 | TLE | |
p02707 | C++ | Runtime Error | // Mahir Ratanpara (DA-IICT)
#include <bits/stdc++.h>
using namespace std;
#define Ff(i, a, n) for (i = a; i < n; i++)
#define Fr(i, a, n) for (i = a; i > n; i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
typedef pair<ll, ll> pa;
typedef vector<ll> vc;
typedef vector<pa> vp;
typedef vector<vc> vvc;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
//=======================
vc g[N];
ll a[N];
ll root(ll *a, ll A) {
while (a[A] != A) {
a[A] = a[a[A]];
A = a[A];
}
return A;
}
int main() {
FAST;
ll t, i, j, k, p, q, r, x, y, u, v, n, m;
cin >> n;
ll a[n - 1];
Ff(i, 0, n - 1) cin >> a[i];
ll fa[100001] = {0};
Ff(i, 0, n - 1) { fa[a[i]]++; }
Ff(i, 1, n + 1) cout << fa[i] << endl;
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1)
result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m) {
int i, u, v;
while (m--) {
cin >> u >> v;
g[u - 1].pb(v - 1);
g[v - 1].pb(u - 1);
}
}
void dfs(int u, int par) {
for (int v : g[u]) {
if (v == par)
continue;
dfs(v, u);
}
} | // Mahir Ratanpara (DA-IICT)
#include <bits/stdc++.h>
using namespace std;
#define Ff(i, a, n) for (i = a; i < n; i++)
#define Fr(i, a, n) for (i = a; i > n; i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
typedef pair<ll, ll> pa;
typedef vector<ll> vc;
typedef vector<pa> vp;
typedef vector<vc> vvc;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
//=======================
vc g[N];
ll a[N];
ll root(ll *a, ll A) {
while (a[A] != A) {
a[A] = a[a[A]];
A = a[A];
}
return A;
}
int main() {
FAST;
ll t, i, j, k, p, q, r, x, y, u, v, n, m;
cin >> n;
ll a[n - 1];
Ff(i, 0, n - 1) cin >> a[i];
ll fa[300001] = {0};
Ff(i, 0, n - 1) { fa[a[i]]++; }
Ff(i, 1, n + 1) cout << fa[i] << endl;
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1)
result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
void ipgraph(int n, int m) {
int i, u, v;
while (m--) {
cin >> u >> v;
g[u - 1].pb(v - 1);
g[v - 1].pb(u - 1);
}
}
void dfs(int u, int par) {
for (int v : g[u]) {
if (v == par)
continue;
dfs(v, u);
}
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02707 | C++ | Runtime Error | #pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
#define m_p make_pair
#define y1 ygftgfgcdtfgxffgx
#define y2 yfdsesgvtyghftfvv
#define x1 xvyr6cf6fgcfgf676
#define x2 xcr6rfc5r66y6r6fr
#define up_bound upper_bound
#define low_bound lower_bound
#define next_per next_permutation
#define pb push_back
#define i_to_s to_string
typedef priority_queue<int> p_queue;
typedef priority_queue<int, vector<int>, greater<int>> min_p_queue;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int mon[20] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
ll gcd(ll x, ll y) { return ((y == 0) ? x : gcd(y, x % y)); }
ll n, a[100010], x;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> x;
x--;
a[x]++;
}
for (int i = 0; i < n; i++)
cout << a[i] << '\n';
return 0;
}
| #pragma GCC optimize("Ofast", 3, "inline")
#include <bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
#define m_p make_pair
#define y1 ygftgfgcdtfgxffgx
#define y2 yfdsesgvtyghftfvv
#define x1 xvyr6cf6fgcfgf676
#define x2 xcr6rfc5r66y6r6fr
#define up_bound upper_bound
#define low_bound lower_bound
#define next_per next_permutation
#define pb push_back
#define i_to_s to_string
typedef priority_queue<int> p_queue;
typedef priority_queue<int, vector<int>, greater<int>> min_p_queue;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int mon[20] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
ll gcd(ll x, ll y) { return ((y == 0) ? x : gcd(y, x % y)); }
ll n, a[200010], x;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> x;
x--;
a[x]++;
}
for (int i = 0; i < n; i++)
cout << a[i] << '\n';
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02707 | C++ | Runtime Error | // nani?
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
// #define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
using namespace __gnu_pbds;
const int inf = 1e7;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 1e5 + 5;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
vector<ll> adj[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
f(i, 0, n - 1) {
ll num;
cin >> num;
adj[num].pb(i + 2);
}
f(i, 1, n + 1) { cout << adj[i].size() << endl; }
} | // nani?
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define pi acos(-1);
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define f(i, a, b) for (int i = a; i < b; i++)
#define sor(a) sort(a.begin(), a.end())
#define rsor(a) sort(a.rbegin(), a.rend())
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0)
// #define inf 1LL<<62
typedef long long ll;
typedef double ld;
using namespace std;
using namespace __gnu_pbds;
const int inf = 1e7;
const ll MOD = 1e9 + 7;
const ll mod = 998244353;
// ac cmtr;
const int MAX_N = 2e5 + 5;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
//---------------------------
vector<ll> adj[MAX_N];
int main() {
fastio;
ll n;
cin >> n;
f(i, 0, n - 1) {
ll num;
cin >> num;
adj[num].pb(i + 2);
}
f(i, 1, n + 1) { cout << adj[i].size() << endl; }
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int b[20005];
int main() {
int n;
cin >> n;
unordered_map<int, int> mp;
unordered_map<int, int>::iterator it;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
mp[x]++;
}
for (it = mp.begin(); it != mp.end(); it++) {
b[(it->first) - 1] = it->second;
}
for (int i = 0; i < n; i++)
cout << b[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
int b[200005];
int main() {
int n;
cin >> n;
unordered_map<int, int> mp;
unordered_map<int, int>::iterator it;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
mp[x]++;
}
for (it = mp.begin(); it != mp.end(); it++) {
b[(it->first) - 1] = it->second;
}
for (int i = 0; i < n; i++)
cout << b[i] << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n], b[100005] = {0};
for (i = 0; i < n - 1; i++) {
cin >> a[i];
b[a[i]]++;
}
for (i = 0; i < n; i++) {
cout << b[i + 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n], b[200005] = {0};
for (i = 0; i < n - 1; i++) {
cin >> a[i];
b[a[i]]++;
}
for (i = 0; i < n; i++) {
cout << b[i + 1] << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N); // A[i]はiの上司を指す。
A.at(0) = 0;
for (int i = 1; i < N; i++)
cin >> A.at(i); // [(0), 1, 1, 2, 2]
// 各上司について部下を求める。これには2次配列を用いる
// 5人で、1 1 2 2 の場合、2と3の上司が1、4と5の上司は2となる。
// [[2,3], [4,5], [], [], []]のような物を得たい。
vector<vector<int>> B(N, vector<int>(0));
for (int i = 1; i < N; i++) {
for (int j = 1; j <= N; j++) {
if (A.at(i) == j)
B.at(j - 1).push_back(i + 1);
}
}
for (int i = 0; i < N; i++)
cout << B.at(i).size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N); // A[i]はiの上司を指す。
A.at(0) = 0;
for (int i = 1; i < N; i++)
cin >> A.at(i); // [(0), 1, 1, 2, 2]
// 各上司について部下を求める。これには2次配列を用いる
// 5人で、1 1 2 2 の場合、2と3の上司が1、4と5の上司は2となる。
// [[2,3], [4,5], [], [], []]のような物を得たい。
vector<vector<int>> B(N, vector<int>(0));
/* for (int i = 1; i < N; i++){
(*_*; これでもできるがTLE ちょっとの改善でO(N)にできる!
for (int j = 1; j <= N; j++){
if (A.at(i) == j) B.at(j-1).push_back(i+1);
}} */
for (int i = 1; i < N; i++) { // iはAの添え字
int boss = A.at(i); // i+1番目の上司の番号はboss
B.at(boss - 1).push_back(i + 1); // こうすれば、O(N) !!
}
for (int i = 0; i < N; i++)
cout << B.at(i).size() << endl;
} | replace | 15 | 20 | 15 | 25 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[100000], i, j;
cin >> N;
for (i = 2; i <= N; i++) {
cin >> j;
A[j]++;
}
for (i = 1; i <= N; i++) {
cout << A[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A[1000000], i, j;
cin >> N;
for (i = 2; i <= N; i++) {
cin >> j;
A[j]++;
}
for (i = 1; i <= N; i++) {
cout << A[i] << endl;
}
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int a, n, boss[maxn] = {0};
int main() {
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> a;
boss[a]++;
}
for (int i = 1; i <= n; i++) {
cout << boss[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e5 + 5;
int a, n, boss[maxn] = {0};
int main() {
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> a;
boss[a]++;
}
for (int i = 1; i <= n; i++) {
cout << boss[i] << endl;
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
int s[100006];
int q[100006] = {0};
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> s[i];
q[s[i]]++;
}
for (int i = 1; i <= n; i++) {
cout << q[i] << endl;
}
} | #include <iostream>
int s[200006];
int q[200006] = {0};
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> s[i];
q[s[i]]++;
}
for (int i = 1; i <= n; i++) {
cout << q[i] << endl;
}
} | replace | 1 | 3 | 1 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define INF 5000000000000000
using namespace std;
struct Edge {
int to;
long weight;
Edge(int t, long w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long modinv(long a, long mod) { return modpow(a, mod - 2, mod); }
struct compare1 {
bool operator()(const pair<long, long> &value, const long &key) {
return (value.first < key);
}
bool operator()(const long &key, const pair<long, long> &value) {
return (key < value.first);
}
};
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n);
rank.resize(n);
REP(i, n) par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
rank[x]++;
par[y] = x;
return true;
}
};
template <class Abel> struct weightedUnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
weightedUnionFind(int n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
REP(i, n) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x)
return x;
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
rank[x]++;
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) { return weight(y) - weight(x); }
};
using Graph = vector<vector<int>>;
using P = pair<long, long>;
/*
void dijkstra(int s, int V, Graph &G, long* d){
priority_queue<P, vector<P>, greater<P>> pque;
fill(d, d + V, INF);
d[s] = 0;
pque.push(P(0, s));
while(!pque.empty()){
P p = pque.top(); pque.pop();
int now = p.second;
if(d[now] < p.first) continue;
REP(i, G[now].size()){
Edge e = G[now][i];
if(d[e.to] > d[now] + e.weight){
d[e.to] = d[now] + e.weight;
pque.push(P(d[e.to], e.to));
}
}
}
}
*/
long GCD(long a, long b) {
if (b == 0l)
return a;
if (a < b)
return GCD(b, a);
else
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
int ans[20005];
REP(i, N) ans[i] = 0;
REP(i, N - 1) {
int a;
cin >> a;
a--;
ans[a]++;
}
REP(i, N) cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define INF 5000000000000000
using namespace std;
struct Edge {
int to;
long weight;
Edge(int t, long w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long modinv(long a, long mod) { return modpow(a, mod - 2, mod); }
struct compare1 {
bool operator()(const pair<long, long> &value, const long &key) {
return (value.first < key);
}
bool operator()(const long &key, const pair<long, long> &value) {
return (key < value.first);
}
};
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n);
rank.resize(n);
REP(i, n) par[i] = i, rank[i] = 0;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
rank[x]++;
par[y] = x;
return true;
}
};
template <class Abel> struct weightedUnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
weightedUnionFind(int n = 1, Abel SUM_UNITY = 0) { init(n, SUM_UNITY); }
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
REP(i, n) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
}
int root(int x) {
if (par[x] == x)
return x;
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y, Abel w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y), w = -w;
if (rank[x] == rank[y])
rank[x]++;
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) { return weight(y) - weight(x); }
};
using Graph = vector<vector<int>>;
using P = pair<long, long>;
/*
void dijkstra(int s, int V, Graph &G, long* d){
priority_queue<P, vector<P>, greater<P>> pque;
fill(d, d + V, INF);
d[s] = 0;
pque.push(P(0, s));
while(!pque.empty()){
P p = pque.top(); pque.pop();
int now = p.second;
if(d[now] < p.first) continue;
REP(i, G[now].size()){
Edge e = G[now][i];
if(d[e.to] > d[now] + e.weight){
d[e.to] = d[now] + e.weight;
pque.push(P(d[e.to], e.to));
}
}
}
}
*/
long GCD(long a, long b) {
if (b == 0l)
return a;
if (a < b)
return GCD(b, a);
else
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
int ans[200005];
REP(i, N) ans[i] = 0;
REP(i, N - 1) {
int a;
cin >> a;
a--;
ans[a]++;
}
REP(i, N) cout << ans[i] << endl;
return 0;
}
| replace | 156 | 157 | 156 | 157 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX 1000000007
#define ll long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define ull unsigned long long int
#define pb push_back
#define eb emplace_back
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// int t;
// cin>>t;
int x = 1;
// while(t--) {
int n;
cin >> n;
int a[n - 1];
fo(i, n - 1) { cin >> a[i]; }
int arr[100001] = {0};
for (int o : a) {
arr[o]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << endl;
}
x++;
// }
return 0;
} | #include <bits/stdc++.h>
#define MAX 1000000007
#define ll long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define ull unsigned long long int
#define pb push_back
#define eb emplace_back
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// int t;
// cin>>t;
int x = 1;
// while(t--) {
int n;
cin >> n;
int a[n - 1];
fo(i, n - 1) { cin >> a[i]; }
int arr[200001] = {0};
for (int o : a) {
arr[o]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << endl;
}
x++;
// }
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union {
vector<ll> par;
Union(ll a) { par = vector<ll>(a, -1); }
ll find(ll a) {
if (par[a] < 0) {
return a;
} else {
return par[a] = find(par[a]);
}
}
bool same(ll a, ll b) { return (find(a) == find(b)); }
ll size(ll a) { return -par[find(a)]; }
void unite(ll a, ll b) {
ll c = find(a), d = find(b);
if (c == d)
return;
if (size(c) < size(d)) {
swap(c, d);
}
par[c] += par[d];
par[d] = c;
}
};
int main() {
ll n;
cin >> n;
ll a[n], b[n + 1];
for (ll i = 0; i < n + 1; i++)
b[i] = 0;
for (ll i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
}
for (ll i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union {
vector<ll> par;
Union(ll a) { par = vector<ll>(a, -1); }
ll find(ll a) {
if (par[a] < 0) {
return a;
} else {
return par[a] = find(par[a]);
}
}
bool same(ll a, ll b) { return (find(a) == find(b)); }
ll size(ll a) { return -par[find(a)]; }
void unite(ll a, ll b) {
ll c = find(a), d = find(b);
if (c == d)
return;
if (size(c) < size(d)) {
swap(c, d);
}
par[c] += par[d];
par[d] = c;
}
};
int main() {
ll n;
cin >> n;
ll a[n], b[n + 1];
for (ll i = 0; i < n + 1; i++)
b[i] = 0;
for (ll i = 0; i < n - 1; i++) {
cin >> a[i];
b[a[i]]++;
}
for (ll i = 1; i <= n; i++) {
cout << b[i] << endl;
}
}
| replace | 39 | 40 | 39 | 40 | -11 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int arr[100005];
int n, tmp;
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> tmp;
arr[tmp]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int arr[200005];
int n, tmp;
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> tmp;
arr[tmp]++;
}
for (int i = 1; i <= n; i++) {
cout << arr[i] << "\n";
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int arr[100000];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n - 1; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
arr[a[i]]++;
for (int i = 1; i <= n; i++)
cout << arr[i] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int arr[200000];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n - 1; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
arr[a[i]]++;
for (int i = 1; i <= n; i++)
cout << arr[i] << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N], subord[N];
for (int i = 0; i < N - 1; i++) {
cin >> A[i];
subord[i] = 0;
}
for (int j = 0; j < N - 1; j++) {
for (int m = 0; m < N; m++) {
if (j == A[m] - 1) {
subord[j]++;
}
}
}
for (int n = 0; n < N - 1; n++) {
cout << subord[n] << endl;
}
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N], subord[N];
for (int i = 0; i < N - 1; i++) {
cin >> A[i];
subord[i] = 0;
}
for (int j = 0; j < N - 1; j++) {
subord[A[j] - 1]++;
}
for (int n = 0; n < N - 1; n++) {
cout << subord[n] << endl;
}
cout << 0 << endl;
} | replace | 16 | 21 | 16 | 17 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, value;
cin >> N;
vector<int> count;
for (int i = 0; i < N - 1; i++) {
cin >> value;
count[value - 1]++;
}
for (int i = 0; i < N; i++)
cout << count[i] << ' ';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, value;
cin >> N;
vector<int> count(N);
for (int i = 0; i < N - 1; i++) {
cin >> value;
count[value - 1]++;
}
for (int i = 0; i < N; i++)
cout << count[i] << ' ';
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<int> A(N);
vector<int> sum(N);
for (int i = 1; i < N; i++) {
cin >> A.at(i);
for (int l = 0; l < i; l++) {
if (A.at(i) == l + 1) {
sum.at(l)++;
}
}
}
for (int i = 0; i < N; i++) {
cout << sum.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<int> A(N);
vector<int> sum(N);
for (int i = 1; i < N; i++) {
cin >> A.at(i);
sum.at((A.at(i) - 1))++;
}
for (int i = 0; i < N; i++) {
cout << sum.at(i) << endl;
}
}
| replace | 10 | 15 | 10 | 11 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve(long N, vector<long> A) {
rep(i, N) { cout << count(A.cbegin() + i, A.cend(), i + 1) << endl; }
}
int main() {
// int 3E4
// long 2E9
// long long 9E18
cin.tie(0);
ios::sync_with_stdio(false);
long N;
cin >> N;
vector<long> A(N - 2 + 1);
for (int i = 0; i < N - 2 + 1; i++) {
cin >> A[i];
}
solve(N, move(A));
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve(long N, vector<long> A) {
vector<long> count(N);
rep(i, N - 1) { count[A[i] - 1]++; }
rep(i, N) { cout << count[i] << endl; }
}
int main() {
// int 3E4
// long 2E9
// long long 9E18
cin.tie(0);
ios::sync_with_stdio(false);
long N;
cin >> N;
vector<long> A(N - 2 + 1);
for (int i = 0; i < N - 2 + 1; i++) {
cin >> A[i];
}
solve(N, move(A));
return 0;
}
| replace | 6 | 7 | 6 | 9 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b emplace_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles \
ifstream cin("input.txt"); \
ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)
// #define for(int i=0;i<n;i++) for(ll i=0;i<n;i++)
using namespace std;
// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e7;
ll inf = 1e18, mod2 = 998244353, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
: sqr(binpow(a, b / 2, mod)) % mod)
: 1;
}
ll binmult(ll a, ll b, ll mod) {
return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
: (2 * binmult(a, b / 2, mod)) % mod)
: 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// const ll to[5]={0,4,6,7,9};
// const ll N=2*1e5+1;
const ll R = 1e4;
// const ll to[7]={1,2,3,1,3,2,1};
const ll tx[4] = {2, -1, 2, 1};
const ll ty[4] = {-1, 2, 1, 2};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 3001;
ll dp[N];
bool used[N];
vector<ll> g[N];
void dfs(ll v, ll p) {
dp[v] = 1;
for (auto u : g[v]) {
if (u == p)
continue;
dfs(u, v);
dp[v] += dp[u];
}
}
signed main() {
ll n;
cin >> n;
ll v;
for (ll i = 1; i < n; i++) {
cin >> v;
--v;
g[v].p_b(i);
}
// for(ll i=0;i<n;i++){
// if(!used[i]){
// dfs(i,-1);
// }
// }
for (ll i = 0; i < n; i++) {
cout << sz(g[i]) << endl;
}
return 0;
}
/*
если WA , то чекер говно, поэтому почекай l8 строчку
*/
| #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
//
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b emplace_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles \
ifstream cin("input.txt"); \
ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll) x.size()
#define endl "\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)
// #define for(int i=0;i<n;i++) for(ll i=0;i<n;i++)
using namespace std;
// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e7;
ll inf = 1e18, mod2 = 998244353, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
: sqr(binpow(a, b / 2, mod)) % mod)
: 1;
}
ll binmult(ll a, ll b, ll mod) {
return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
: (2 * binmult(a, b / 2, mod)) % mod)
: 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// const ll to[5]={0,4,6,7,9};
// const ll N=2*1e5+1;
const ll R = 1e4;
// const ll to[7]={1,2,3,1,3,2,1};
const ll tx[4] = {2, -1, 2, 1};
const ll ty[4] = {-1, 2, 1, 2};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 2 * 1e5 + 1;
ll dp[N];
bool used[N];
vector<ll> g[N];
void dfs(ll v, ll p) {
dp[v] = 1;
for (auto u : g[v]) {
if (u == p)
continue;
dfs(u, v);
dp[v] += dp[u];
}
}
signed main() {
ll n;
cin >> n;
ll v;
for (ll i = 1; i < n; i++) {
cin >> v;
--v;
g[v].p_b(i);
}
// for(ll i=0;i<n;i++){
// if(!used[i]){
// dfs(i,-1);
// }
// }
for (ll i = 0; i < n; i++) {
cout << sz(g[i]) << endl;
}
return 0;
}
/*
если WA , то чекер говно, поэтому почекай l8 строчку
*/
| replace | 65 | 66 | 65 | 66 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repll(i, n) for (long long int i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
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;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
template <typename T_char> char ToUpper(char cX) { return toupper(cX); }
// g++ -std=c++1z temp.cpp
//./a.exe
ll digit(ll a) {
ll count = 0;
for (ll i = 0; i < a; i++) {
if (a == 0) {
break;
} else {
a = a / 10;
count++;
}
}
return count;
}
#include <cstdint>
uintmax_t comb(unsigned int n, unsigned int r) {
if (r * 2 > n)
r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for (unsigned int i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
// 桁数のカウント
// pow(x,n) == x^n
// sum = accumulate(v.begin(),v.end(),0);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
/////////////////////////////////////////////////////
int n;
cin >> n;
vi a(n - 1), ans(n);
rep(i, n - 1) cin >> a[i];
Sort(a);
rep(i, n) ans[i] = 0;
rep(i, n - 1) {
for (int j = 1; j < n; j++) {
if (a[i] == j) {
ans[j - 1]++;
break;
}
}
}
rep(i, n) cout << ans[i] << endl;
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repll(i, n) for (long long int i = 0; i < n; i++)
#define fin(ans) cout << (ans) << endl
#define P 1000000007
#define STI(s) atoi(s.c_str()) // string to int
#define mp(p, q) make_pair(p, q)
#define Sort(a) sort(a.begin(), a.end())
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;
return 1;
}
return 0;
}
const int INF = INT_MAX;
const long long LLINF = 1LL << 60;
template <typename T_char> char ToUpper(char cX) { return toupper(cX); }
// g++ -std=c++1z temp.cpp
//./a.exe
ll digit(ll a) {
ll count = 0;
for (ll i = 0; i < a; i++) {
if (a == 0) {
break;
} else {
a = a / 10;
count++;
}
}
return count;
}
#include <cstdint>
uintmax_t comb(unsigned int n, unsigned int r) {
if (r * 2 > n)
r = n - r;
uintmax_t dividend = 1;
uintmax_t divisor = 1;
for (unsigned int i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
// 桁数のカウント
// pow(x,n) == x^n
// sum = accumulate(v.begin(),v.end(),0);
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
/////////////////////////////////////////////////////
int n;
cin >> n;
vi a(n - 1), ans(n);
rep(i, n - 1) cin >> a[i];
Sort(a);
ans[n - 1] = 0;
rep(i, n - 1) { ans[a[i] - 1]++; }
rep(i, n) cout << ans[i] << endl;
//////////////////////////////////////////////////////
return 0;
} | replace | 95 | 104 | 95 | 97 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLr(obj) (obj).rbegin(), (obj).rend()
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, m, a[101010], sum[101010] = {};
string s;
cin >> n;
rep(i, n - 1) {
cin >> a[i];
sum[a[i]]++;
}
rep(i, n) { cout << sum[i + 1] << endl; }
// cout<<endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLr(obj) (obj).rbegin(), (obj).rend()
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll n, m, a[201010], sum[201010] = {};
string s;
cin >> n;
rep(i, n - 1) {
cin >> a[i];
sum[a[i]]++;
}
rep(i, n) { cout << sum[i + 1] << endl; }
// cout<<endl;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
map<int, int> b;
for (int i = 1; i < n; 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;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
map<int, int> b;
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 | 8 | 9 | 8 | 9 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, m, ans, temp;
int a[111111];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> temp;
a[temp]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
long long n, m, ans, temp;
int a[11111111];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> temp;
a[temp]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, m;
cin >> n;
int arr[20000];
memset(arr, 0, 20000);
m = n - 1;
while (m--) {
cin >> a;
arr[a - 1]++;
}
for (i = 0; i < n; i++)
cout << arr[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, m;
cin >> n;
int arr[n];
memset(arr, 0, sizeof(arr));
m = n - 1;
while (m--) {
cin >> a;
arr[a - 1]++;
}
for (i = 0; i < n; i++)
cout << arr[i] << endl;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ARB \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define bp __builtin_popcount
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e5 + 5;
const double EPS = 1e-14;
const int MOD = 1000000007;
int arr[maxn];
int fr[maxn] = {0};
int main() {
ARB int n;
cin >> n;
for (int i = 1; i < n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++)
fr[arr[i]]++;
for (int i = 1; i <= n; i++)
cout << fr[i] << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ARB \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define bp __builtin_popcount
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e8 + 5;
const double EPS = 1e-14;
const int MOD = 1000000007;
int arr[maxn];
int fr[maxn] = {0};
int main() {
ARB int n;
cin >> n;
for (int i = 1; i < n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++)
fr[arr[i]]++;
for (int i = 1; i <= n; i++)
cout << fr[i] << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int n, a[100000], b[100000] = {0}, i;
cin >> n;
for (i = 1; i < n; i++) {
cin >> a[i];
}
for (i = 1; i < n; i++) {
b[a[i]]++;
}
for (i = 1; i <= n; i++) {
cout << b[i] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
int n, a[300000], b[300000] = {0}, i;
cin >> n;
for (i = 1; i < n; i++) {
cin >> a[i];
}
for (i = 1; i < n; i++) {
b[a[i]]++;
}
for (i = 1; i <= n; i++) {
cout << b[i] << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | Python | Time Limit Exceeded | n = int(input())
line = list(map(int, input().strip().split(" ")))
for i in range(1, n + 1):
print(line.count(i))
| n = int(input())
line = list(map(int, input().strip().split(" ")))
ans = [0 for s in range(n)]
for i in line:
ans[i - 1] += 1
for i in range(n):
print(ans[i])
| replace | 4 | 6 | 4 | 11 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
} // Usages NumberToString(3)
template <typename T> T StringToNumber(const string &Text) {
istringstream ss(Text);
T result;
return ss >> result ? result : 0;
} // StringToNumber<int>("3")
int vec[100006];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int x;
for (int i = 1; i < n; i++) {
cin >> x;
vec[x]++;
}
for (int i = 1; i <= n; i++)
cout << vec[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> std::string NumberToString(T Number) {
std::ostringstream ss;
ss << Number;
return ss.str();
} // Usages NumberToString(3)
template <typename T> T StringToNumber(const string &Text) {
istringstream ss(Text);
T result;
return ss >> result ? result : 0;
} // StringToNumber<int>("3")
int vec[900006];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int x;
for (int i = 1; i < n; i++) {
cin >> x;
vec[x]++;
}
for (int i = 1; i <= n; i++)
cout << vec[i] << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long
int main() {
lli n, i, j, c = 0, s = 0;
cin >> n;
lli arr[n - 1];
lli brr[10001] = {0};
for (i = 0; i < n - 1; i++)
cin >> arr[i];
unordered_map<lli, lli> m;
for (i = 0; i < n - 1; i++) {
m[arr[i]]++;
}
for (auto it : m) {
brr[it.first] = it.second;
}
for (i = 1; i <= n; i++) {
cout << brr[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long
int main() {
lli n, i, j, c = 0, s = 0;
cin >> n;
lli arr[n - 1];
lli brr[1000001] = {0};
for (i = 0; i < n - 1; i++)
cin >> arr[i];
unordered_map<lli, lli> m;
for (i = 0; i < n - 1; i++) {
m[arr[i]]++;
}
for (auto it : m) {
brr[it.first] = it.second;
}
for (i = 1; i <= n; i++) {
cout << brr[i] << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int d[20001], a[20001], i, n;
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> a[i];
d[a[i]]++;
}
for (int i = 1; i <= n; i++)
cout << d[i] << "\n";
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long d[2000001], a[2000001], i, n;
cin >> n;
for (int i = 2; i <= n; i++) {
cin >> a[i];
d[a[i]]++;
}
for (int i = 1; i <= n; i++)
cout << d[i] << "\n";
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int A;
vec.at(0) = 0;
for (int i = 1; i < N; i++) {
cin >> A;
vec.at(i) = A;
}
sort(vec.begin(), vec.end());
int counter;
int start = 0;
for (int i = 0; i < N; i++) {
counter = 0;
for (int j = start; j < N; j++) {
if (vec.at(j) == i + 1)
counter++;
}
cout << counter << endl;
start += counter;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
int A;
vec.at(0) = 0;
for (int i = 1; i < N; i++) {
cin >> A;
vec.at(i) = A;
}
sort(vec.begin(), vec.end());
int counter;
int start = 0;
for (int i = 0; i < N; i++) {
counter = 0;
for (int j = start; j < N; j++) {
if (vec.at(j) == i + 1)
counter++;
if (vec.at(j) > i + 1)
break;
}
cout << counter << endl;
start += counter;
}
}
| insert | 21 | 21 | 21 | 23 | TLE | |
p02707 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a), c(a);
for (int i = 0; i < a; i++) {
cin >> b.at(i);
c.at(b.at(i) - 1)++;
}
for (int i = 0; i < a; i++) {
cout << c.at(i) << endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a - 1), c(a);
for (int i = 0; i < a - 1; i++) {
cin >> b.at(i);
c.at(b.at(i) - 1)++;
}
for (int i = 0; i < a; i++) {
cout << c.at(i) << endl;
}
} | replace | 6 | 8 | 6 | 8 | -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 | /**********************************************************************
File .cpp
Author Takahiro Yamazaki
**********************************************************************/
/**********************************************************************
Include Libraries
**********************************************************************/
#include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
/**********************************************************************
Declare variables
**********************************************************************/
/**********************************************************************
Declare instance
**********************************************************************/
/**********************************************************************
Proto_type_Declare functions
**********************************************************************/
/**********************************************************************
Main
**********************************************************************/
int main() {
int n;
cin >> n;
int a[220000];
a[0] = 0;
repr(i, 1, n) cin >> a[i];
int ans[220000];
rep(i, n) ans[i] = 0;
int counter = 0;
int tmp;
/* 数値を昇順にソート */
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j]) {
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
rep(i, n) {
repr(j, 1 + counter, n) {
if (a[j] == i + 1) {
ans[i]++;
counter++;
} else if (a[j] != i + 1)
break;
}
}
// int j = 0;
// repr(i, 1, n){
// if (a[i] == j) {
// ans[i]++;
// }
// }
// printf("%d\n", n);
// rep(i,n) a[i] = 0;
rep(i, n) printf("%d\n", ans[i]);
}
/**********************************************************************
Functions
**********************************************************************/
| /**********************************************************************
File .cpp
Author Takahiro Yamazaki
**********************************************************************/
/**********************************************************************
Include Libraries
**********************************************************************/
#include <algorithm>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
/**********************************************************************
Declare variables
**********************************************************************/
/**********************************************************************
Declare instance
**********************************************************************/
/**********************************************************************
Proto_type_Declare functions
**********************************************************************/
/**********************************************************************
Main
**********************************************************************/
int main() {
int n;
cin >> n;
int a[220000];
a[0] = 0;
repr(i, 1, n) cin >> a[i];
int ans[220000];
rep(i, n) ans[i] = 0;
int counter = 0;
// int tmp;
// /* 数値を昇順にソート */
// for (int i=0; i<n; ++i) {
// for (int j=i+1; j<n; ++j) {
// if (a[i] > a[j]) {
// tmp = a[i];
// a[i] = a[j];
// a[j] = tmp;
// }
// }
// }
sort(a, a + n);
rep(i, n) {
repr(j, 1 + counter, n) {
if (a[j] == i + 1) {
ans[i]++;
counter++;
} else if (a[j] != i + 1)
break;
}
}
// int j = 0;
// repr(i, 1, n){
// if (a[i] == j) {
// ans[i]++;
// }
// }
// printf("%d\n", n);
// rep(i,n) a[i] = 0;
rep(i, n) printf("%d\n", ans[i]);
}
/**********************************************************************
Functions
**********************************************************************/
| replace | 36 | 48 | 36 | 48 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(200010);
vector<int> ans(200010);
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define ll long long
#define f(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
#define spc " "
#define pb push_back
#define mp make_pair
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("in.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n;
cin >> n;
ll a[10000];
f(i, 0, n - 1) { cin >> a[i]; }
map<ll, ll> m;
f(i, 1, n + 1) m[i] = 0;
f(i, 0, n - 1) { m[a[i]]++; }
f(i, 1, n + 1) { cout << m[i] << endl; }
} | #include <bits/stdc++.h>
using namespace std;
using namespace std;
#define ll long long
#define f(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
#define spc " "
#define pb push_back
#define mp make_pair
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("in.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n;
cin >> n;
ll a[n];
f(i, 0, n - 1) { cin >> a[i]; }
map<ll, ll> m;
f(i, 1, n + 1) m[i] = 0;
f(i, 0, n - 1) { m[a[i]]++; }
f(i, 1, n + 1) { cout << m[i] << endl; }
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 9003372036854775807LL
#define mod 998244353
#define fixed fixed << setprecision(12)
#define abs(x, y) (max(x, y) - min(x, y))
#define lol long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
lol a[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
lol n, m, k, r, x, y;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> m;
a[m]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << '\n';
}
return (0);
}
| #include <bits/stdc++.h>
#define INF 9003372036854775807LL
#define mod 998244353
#define fixed fixed << setprecision(12)
#define abs(x, y) (max(x, y) - min(x, y))
#define lol long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
lol a[300010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
lol n, m, k, r, x, y;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> m;
a[m]++;
}
for (int i = 1; i <= n; i++) {
cout << a[i] << '\n';
}
return (0);
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
const double PI = acos(-1);
#define MOD 1000000007
#define pb push_back
#define F first
#define S second
#define test \
int tc; \
cin >> tc; \
while (tc--)
#define forn(i, n) for (i = 0; i < n; i++)
#define rforn(i, n) for (i = n - 1; i >= 0; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) x.size()
#define el << '\n'
#define sp << ' '
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (abs(a * b) / gcd(a, b))
#define sqr(a) (a * a)
#define optimize() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define file() \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
int a[100001];
int main() {
/// optimize();
int n, i, b;
cin >> n;
for (i = 1; i < n; i++) {
cin >> b;
a[b]++;
}
for (i = 1; i <= n; i++)
cout << a[i] el;
return 0;
}
/// Brainless people are gonna understand this code.
/// Brainless_Loco Terminates Here!
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
const double PI = acos(-1);
#define MOD 1000000007
#define pb push_back
#define F first
#define S second
#define test \
int tc; \
cin >> tc; \
while (tc--)
#define forn(i, n) for (i = 0; i < n; i++)
#define rforn(i, n) for (i = n - 1; i >= 0; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) x.size()
#define el << '\n'
#define sp << ' '
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (abs(a * b) / gcd(a, b))
#define sqr(a) (a * a)
#define optimize() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define file() \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
int a[200001];
int main() {
/// optimize();
int n, i, b;
cin >> n;
for (i = 1; i < n; i++) {
cin >> b;
a[b]++;
}
for (i = 1; i <= n; i++)
cout << a[i] el;
return 0;
}
/// Brainless people are gonna understand this code.
/// Brainless_Loco Terminates Here!
| replace | 40 | 41 | 40 | 41 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
const double pi = acos(-1);
int n, c[N], a;
int main() {
scanf("%d", &n);
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
c[a]++;
}
for (int i = 1; i <= n; ++i)
printf("%d\n", c[i]);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
const double pi = acos(-1);
int n, c[N], a;
int main() {
scanf("%d", &n);
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
c[a]++;
}
for (int i = 1; i <= n; ++i)
printf("%d\n", c[i]);
} | 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> bossNumber(N);
for (int i = 1; i < N; i++) {
cin >> bossNumber.at(i);
}
vector<int> numberOfStuff(N);
for (int i = 0; i < N; i++) {
for (int j = 1; j < N; j++) {
if (i == bossNumber.at(j) - 1) {
numberOfStuff.at(i)++;
}
}
}
for (int i = 0; i < N; i++) {
cout << numberOfStuff.at(i) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> bossNumber(N);
for (int i = 1; i < N; i++) {
cin >> bossNumber.at(i);
}
vector<int> numberOfStuff(N);
for (int i = 1; i < N; i++) {
numberOfStuff.at(bossNumber.at(i) - 1)++;
}
for (int i = 0; i < N; i++) {
cout << numberOfStuff.at(i) << endl;
}
} | replace | 11 | 17 | 11 | 13 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n - 1];
for (int i = 0; i < n - 1; i++) {
cin >> num[i];
}
int buka[n];
for (int i = 0; i < n; i++) {
buka[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (i + 1 == num[j]) {
buka[i] = buka[i] + 1;
}
}
}
for (int i = 0; i < n; i++) {
cout << buka[i] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int num[n - 1];
for (int i = 0; i < n - 1; i++) {
cin >> num[i];
}
int buka[n] = {};
for (int i = 0; i < n - 1; i++) {
buka[num[i] - 1] = buka[num[i] - 1] + 1;
}
for (int i = 0; i < n; i++) {
cout << buka[i] << endl;
}
return 0;
} | replace | 13 | 23 | 13 | 16 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int cnt[20001] = {0};
int main() {
int N;
cin >> N;
for (int i = 2; i <= N; i++) {
int Ai;
cin >> Ai;
cnt[Ai]++;
}
for (int i = 1; i <= N; i++) {
cout << cnt[i] << endl;
}
}
| #include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repto(i, n) for (int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
__attribute__((constructor)) void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int cnt[200001] = {0};
int main() {
int N;
cin >> N;
for (int i = 2; i <= N; i++) {
int Ai;
cin >> Ai;
cnt[Ai]++;
}
for (int i = 1; i <= N; i++) {
cout << cnt[i] << endl;
}
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define mp make_pair
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
int ans[N];
int main() {
int n, x;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
ans[x]++;
}
for (int i = 1; i <= n; i++)
printf("%d\n", ans[i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define mp make_pair
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int ans[N];
int main() {
int n, x;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
ans[x]++;
}
for (int i = 1; i <= n; i++)
printf("%d\n", ans[i]);
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
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> ans(n);
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n; j++) {
if (a[i] == j + 1)
ans[j]++;
}
}
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
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> ans(n);
for (int i = 0; i < n - 1; i++)
ans[a[i] - 1]++;
for (int i = 0; i < n; i++)
cout << ans[i] << endl;
return 0;
} | replace | 16 | 22 | 16 | 18 | TLE | |
p02707 | C++ | Runtime Error | ///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d %d", &a, &b)
#define sf3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pf(a) printf("%d", a)
#define pf2(a, b) printf("%d %d", a, b)
#define pf3(a, b, c) printf("%d %d %d", a, b, c)
#define sfl(a) scanf("%lld", &a)
#define sfl2(a, b) scanf("%lld %lld", &a, &b)
#define sfl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pfl(a) printf("%lld", a)
#define pfl2(a, b) printf("%lld %lld", a, b)
#define pfl3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
#define tz 100000
#define clr0(a) memset(a, 0, sizeof(a))
#define clr1(a) memset(a, -1, sizeof(a))
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
int main() {
timesave;
int n, i, mp[100005] = {0}, a;
cin >> n;
for (i = 1; i < n; i++) {
cin >> a;
mp[a]++;
}
for (i = 1; i <= n; i++)
cout << mp[i] << endl;
}
| ///...................SUBHASHIS MOLLICK...................///
///.....DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING....///
///.............ISLAMIC UNIVERSITY,BANGLADESH.............///
///....................SESSION-(14-15)....................///
#include <bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%d", &a)
#define sf2(a, b) scanf("%d %d", &a, &b)
#define sf3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pf(a) printf("%d", a)
#define pf2(a, b) printf("%d %d", a, b)
#define pf3(a, b, c) printf("%d %d %d", a, b, c)
#define sfl(a) scanf("%lld", &a)
#define sfl2(a, b) scanf("%lld %lld", &a, &b)
#define sfl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define pfl(a) printf("%lld", a)
#define pfl2(a, b) printf("%lld %lld", a, b)
#define pfl3(a, b, c) printf("%lld %lld %lld", a, b, c)
#define nl printf("\n")
#define timesave \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define MPI map<int, int> mp;
#define fr(i, n) for (i = 0; i < n; i++)
#define fr1(i, n) for (i = 1; i <= n; i++)
#define frl(i, a, b) for (i = a; i <= b; i++)
#define tz 100000
#define clr0(a) memset(a, 0, sizeof(a))
#define clr1(a) memset(a, -1, sizeof(a))
/*primes in range 1 - n
1 - 100(1e2) -> 25 pimes
1 - 1000(1e3) -> 168 primes
1 - 10000(1e4) -> 1229 primes
1 - 100000(1e5) -> 9592 primes
1 - 1000000(1e6) -> 78498 primes
1 - 10000000(1e7) -> 664579 primes
large primes ->
104729 1299709 15485863 179424673 2147483647 32416190071 112272535095293
48112959837082048697
*/
// freopen("Input.txt","r",stdin);
// freopen("Output.txt","w",stdout);
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
int main() {
timesave;
int n, i, a;
map<int, int> mp;
cin >> n;
for (i = 1; i < n; i++) {
cin >> a;
mp[a]++;
}
for (i = 1; i <= n; i++)
cout << mp[i] << endl;
}
| replace | 53 | 54 | 53 | 55 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 1e5 + 20;
vector<int> adj[maxn];
bool visited[maxn];
void dfs(int v) {
visited[v] = 1;
for (auto u : adj[v])
if (!visited[u])
dfs(u);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a;
cin >> a;
a--;
adj[a].pb(i);
}
for (int i = 0; i < n; i++) {
cout << adj[i].size() << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 2e5 + 20;
vector<int> adj[maxn];
bool visited[maxn];
void dfs(int v) {
visited[v] = 1;
for (auto u : adj[v])
if (!visited[u])
dfs(u);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a;
cin >> a;
a--;
adj[a].pb(i);
}
for (int i = 0; i < n; i++) {
cout << adj[i].size() << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define TitansGo \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define all(v) v.begin(), v.end()
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define ll long long
#define endl "\n"
#define S second
#define F first
using namespace std;
int frq[50000];
int main() {
TitansGo int n, a;
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a;
frq[a]++;
}
for (int i = 1; i <= n; i++)
cout << frq[i] << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define TitansGo \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define all(v) v.begin(), v.end()
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define ll long long
#define endl "\n"
#define S second
#define F first
using namespace std;
int frq[200000];
int main() {
TitansGo int n, a;
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a;
frq[a]++;
}
for (int i = 1; i <= n; i++)
cout << frq[i] << endl;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p02707 | C++ | Runtime Error | // #pragma GCC optimize(“O2”)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define pi 3.14159265358979323846264338327950254
#define STDIN \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout); //************************************
#define ll long long
// #define int ll
const int mod = 100999;
const int N = 1e5 + 10;
int son[N];
int main() {
// STDIN
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int t;
cin >> t;
son[t]++;
}
for (int i = 1; i <= n; i++) {
cout << son[i] << endl;
}
}
| // #pragma GCC optimize(“O2”)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define pi 3.14159265358979323846264338327950254
#define STDIN \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout); //************************************
#define ll long long
// #define int ll
const int mod = 100999;
const int N = 3e5 + 10;
int son[N];
int main() {
// STDIN
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
int t;
cin >> t;
son[t]++;
}
for (int i = 1; i <= n; i++) {
cout << son[i] << endl;
}
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02707 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 100010;
const int MX = 123456;
const int mod = (int)1e9 + 7;
const int base = 97;
const ull BS1 = 10000019ULL;
const int INF = (1 << 29);
template <class T> inline void fastScan(T &x) {
register char c = getchar();
int neg = 0;
x = 0;
for (; (c < 48 || c > 57) && (c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg)
x = -x;
}
// OrderedSet
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template < typename T > using ordered_set = tree < T, null_type, greater < T
// >, rb_tree_tag, tree_order_statistics_node_update >;
// typedef uint64_t hash_t;
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// const int HASH_COUNT = 2;
// const hash_t HASH_P = (uint32_t)-13337;
// uniform_int_distribution<hash_t> MULT_DIST(0.25 * HASH_P, 0.75 * HASH_P);
// const hash_t HASH_MULT[HASH_COUNT] = {MULT_DIST(rng), MULT_DIST(rng)};
int a[N];
int main() {
int n, m;
fastScan(n);
for (int i = 2; i <= n; i++) {
int x, y;
fastScan(x);
a[x]++;
}
for (int i = 1; i <= n; i++) {
printf("%d\n", a[i]);
}
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2 * acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 100010;
const int MX = 123456;
const int mod = (int)1e9 + 7;
const int base = 97;
const ull BS1 = 10000019ULL;
const int INF = (1 << 29);
template <class T> inline void fastScan(T &x) {
register char c = getchar();
int neg = 0;
x = 0;
for (; (c < 48 || c > 57) && (c != '-'); c = getchar())
;
if (c == '-') {
neg = 1;
c = getchar();
}
for (; c > 47 && c < 58; c = getchar()) {
x = (x << 1) + (x << 3) + c - 48;
}
if (neg)
x = -x;
}
// OrderedSet
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template < typename T > using ordered_set = tree < T, null_type, greater < T
// >, rb_tree_tag, tree_order_statistics_node_update >;
// typedef uint64_t hash_t;
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// const int HASH_COUNT = 2;
// const hash_t HASH_P = (uint32_t)-13337;
// uniform_int_distribution<hash_t> MULT_DIST(0.25 * HASH_P, 0.75 * HASH_P);
// const hash_t HASH_MULT[HASH_COUNT] = {MULT_DIST(rng), MULT_DIST(rng)};
int a[N * 2];
int main() {
int n, m;
fastScan(n);
for (int i = 2; i <= n; i++) {
int x, y;
fastScan(x);
a[x]++;
}
for (int i = 1; i <= n; i++) {
printf("%d\n", a[i]);
}
return 0;
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return (0)
#define rep(i, n) for (int(i) = (0); (i) < (n); (++i))
#define FOR(i, start, end) for (int(i) = (start); (i) < (end); (++i))
#define foreach(e, elem) for (auto &(e) : (elem))
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define size(s) (s).size()
#define all(vec) (vec).begin(), (vec).end()
#define pb(e) push_back(e);
#define INF 1e+12
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
int a[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int an;
cin >> an;
a[an]++;
}
for (int i = 1; i <= n; ++i) {
println(a[i]);
}
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return (0)
#define rep(i, n) for (int(i) = (0); (i) < (n); (++i))
#define FOR(i, start, end) for (int(i) = (start); (i) < (end); (++i))
#define foreach(e, elem) for (auto &(e) : (elem))
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(nullptr)
#define size(s) (s).size()
#define all(vec) (vec).begin(), (vec).end()
#define pb(e) push_back(e);
#define INF 1e+12
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
int a[200010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n - 1; ++i) {
int an;
cin >> an;
a[an]++;
}
for (int i = 1; i <= n; ++i) {
println(a[i]);
}
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[50000];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i < n; i++) {
cin >> a[i];
dp[a[i]]++;
}
for (int i = 1; i <= n; i++) {
cout << dp[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[50000000];
int main() {
int n;
cin >> n;
int a[n];
for (int i = 1; i < n; i++) {
cin >> a[i];
dp[a[i]]++;
}
for (int i = 1; i <= n; i++) {
cout << dp[i] << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
rep(i, n - 1) cin >> a.at(i);
sort(a.begin(), a.end());
rep(i, n) {
if (i < a.back()) {
cout << count(a.begin(), a.end(), i + 1) << endl;
} else {
cout << 0 << endl;
}
}
return 0;
} | #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 + 1);
for (int i = 2; i <= n; i++) {
int num;
cin >> num;
a.at(num)++;
}
for (int i = 1; i <= n; i++) {
cout << a.at(i) << endl;
}
return 0;
} | replace | 9 | 18 | 9 | 17 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define longlongvector vector<long long>
#define intvector vector<int>
#define size size()
using namespace std;
int n, m, k;
int main() {
int n;
cin >> n;
int arr[100002] = {0};
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
arr[a]++;
}
for (int i = 1; i < n + 1; i++)
cout << arr[i] << endl;
// system("pause");
} | #include <bits/stdc++.h>
#define longlongvector vector<long long>
#define intvector vector<int>
#define size size()
using namespace std;
int n, m, k;
int main() {
int n;
cin >> n;
int arr[200002] = {0};
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
arr[a]++;
}
for (int i = 1; i < n + 1; i++)
cout << arr[i] << endl;
// system("pause");
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int k;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a_(n);
a_[0] = 0;
for (int i = 1; i < n; i++)
cin >> a_[i];
vector<int> cnt(n, 0);
rep(i, n) { cnt[a_[i] - 1]++; }
rep(i, n) cout << cnt[i] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int k;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
vector<int> a_(n);
a_[0] = 0;
for (int i = 1; i < n; i++)
cin >> a_[i];
vector<int> cnt(n, 0);
for (int i = 1; i < n; i++) {
cnt[a_[i] - 1]++;
}
rep(i, n) cout << cnt[i] << endl;
return 0;
} | replace | 32 | 33 | 32 | 35 | -6 | double free or corruption (out)
|
p02707 | C++ | Runtime Error | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[100000] = {0};
int a, n;
cin >> n;
rep(i, n - 1) {
cin >> a;
p[a - 1]++;
}
rep(i, n) { cout << p[i] << endl; }
} | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p[200001] = {0};
int a, n;
cin >> n;
rep(i, n - 1) {
cin >> a;
p[a - 1]++;
}
rep(i, n) { cout << p[i] << endl; }
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define SORT(obj) sort(obj.begin(), obj.end())
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
ll const MOD = 1e9 + 7;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<int> data(n - 1, 0);
REP(i, n - 1) {
int a;
cin >> a;
data[a - 1]++;
}
REP(i, n) { cout << data.at(i) << endl; }
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(obj) obj.begin(), obj.end()
#define SORT(obj) sort(obj.begin(), obj.end())
#define pb(obj) push_back(obj)
#define REP(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
ll const MOD = 1e9 + 7;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<int> data(n);
REP(i, n - 1) {
int a;
cin >> a;
data[a - 1]++;
}
REP(i, n) { cout << data.at(i) << endl; }
}
| replace | 13 | 14 | 13 | 14 | -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++ | Runtime Error | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);
#define endl "\n"
#define MAXN 100123
#define ll long long
#define INF INT_MAX
#define FORE(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) FORE(i, 0, n)
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define ps(v) push_back(v)
#define ms(v, x) memset(v, x, sizeof(v))
using namespace std;
int n, v;
int freq[MAXN];
int main() {
_ cin >> n;
FOR(i, n - 1) {
cin >> v;
freq[v]++;
}
FORE(i, 1, n + 1) { cout << freq[i] << endl; }
return 0;
} | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);
#define endl "\n"
#define MAXN 2 * 100123
#define ll long long
#define INF INT_MAX
#define FORE(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) FORE(i, 0, n)
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define ps(v) push_back(v)
#define ms(v, x) memset(v, x, sizeof(v))
using namespace std;
int n, v;
int freq[MAXN];
int main() {
_ cin >> n;
FOR(i, n - 1) {
cin >> v;
freq[v]++;
}
FORE(i, 1, n + 1) { cout << freq[i] << endl; }
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n - 1];
long long int arr[100000] = {0};
for (long long int i = 0; i < n - 1; i++) {
cin >> a[i];
arr[a[i]]++;
}
for (long long int i = 1; i <= n; i++) {
cout << arr[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n + 5];
long long int arr[1000000] = {0};
for (long long int i = 0; i < n - 1; i++) {
cin >> a[i];
arr[a[i]]++;
}
for (long long int i = 1; i <= n; i++) {
cout << arr[i] << endl;
}
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int g[100100] = {};
int n;
cin >> n;
rep(i, n - 1) {
int a;
cin >> a;
g[a]++;
}
repi(i, 1, n + 1) { cout << g[i] << endl; }
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int g[200100] = {};
int n;
cin >> n;
rep(i, n - 1) {
int a;
cin >> a;
g[a]++;
}
repi(i, 1, n + 1) { cout << g[i] << endl; }
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int cnt[N] = {};
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, x;
cin >> n;
for (int i = 1; i < n; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++)
cout << cnt[i] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int cnt[N] = {};
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, x;
cin >> n;
for (int i = 1; i < n; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++)
cout << cnt[i] << '\n';
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
int vis[maxn];
int main() {
memset(vis, 0, sizeof(vis));
int n;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
int x;
scanf("%d", &x);
vis[x]++;
}
for (int i = 1; i <= n; i++) {
printf("%d\n", vis[i]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
int vis[maxn];
int main() {
memset(vis, 0, sizeof(vis));
int n;
scanf("%d", &n);
for (int i = 2; i <= n; i++) {
int x;
scanf("%d", &x);
vis[x]++;
}
for (int i = 1; i <= n; i++) {
printf("%d\n", vis[i]);
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, m, sum = 0;
cin >> n;
ll a;
ll Employee[100005] = {};
for (int i = 1; i < n; i++) {
cin >> a;
Employee[a]++;
}
for (int i = 1; i <= n; i++) {
cout << Employee[i] << endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ll n, m, sum = 0;
cin >> n;
ll a;
ll Employee[200005] = {};
for (int i = 1; i < n; i++) {
cin >> a;
Employee[a]++;
}
for (int i = 1; i <= n; i++) {
cout << Employee[i] << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pie 3.1415926
int ara[100005], ara2[100005];
int main() {
int n, i;
cin >> n;
for (i = 2; i <= n; i++) {
cin >> ara[i];
ara2[ara[i]]++;
}
for (i = 1; i <= n; i++)
cout << ara2[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pie 3.1415926
int ara[200020], ara2[200020];
int main() {
int n, i;
cin >> n;
for (i = 2; i <= n; i++) {
cin >> ara[i];
ara2[ara[i]]++;
}
for (i = 1; i <= n; i++)
cout << ara2[i] << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
// #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int CM = 220000, CL = 12;
char cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll *)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
return tmp;
}
char *di = cn;
inline void putint(int X) {
if (X < 10) {
*di++ = '0' + X;
*di++ = '\n';
return;
}
int keta = 0;
char C[10];
while (X) {
*(C + keta) = '0' + X % 10;
X /= 10;
keta++;
}
for (int i = keta - 1; i >= 0; i--)
*di++ = (*(C + i));
*di++ = '\n';
}
int A[200001];
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N = getint();
rep(i, N - 1) A[getint()]++;
rep1(i, N) putint(A[i]);
fwrite(cn, 1, di - cn, stdout);
Would you please return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
// #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int CM = 440000, CL = 12;
char cn[CM + CL], *ci = cn + CM + CL, *owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll *)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
return tmp;
}
char *di = cn;
inline void putint(int X) {
if (X < 10) {
*di++ = '0' + X;
*di++ = '\n';
return;
}
int keta = 0;
char C[10];
while (X) {
*(C + keta) = '0' + X % 10;
X /= 10;
keta++;
}
for (int i = keta - 1; i >= 0; i--)
*di++ = (*(C + i));
*di++ = '\n';
}
int A[200001];
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N = getint();
rep(i, N - 1) A[getint()]++;
rep1(i, N) putint(A[i]);
fwrite(cn, 1, di - cn, stdout);
Would you please return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
const int n = 100000;
int A[n];
int M[n] = {0};
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> A[i];
M[A[i]] += 1;
}
for (int i = 1; i < N + 1; i++) {
cout << M[i] << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N;
const int n = 1000000;
int A[n];
int M[n] = {0};
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> A[i];
M[A[i]] += 1;
}
for (int i = 1; i < N + 1; i++) {
cout << M[i] << endl;
}
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
// #define Add(x, y) x = (x + (y)) % mod
// #define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N - 1);
REP(i, N - 1) cin >> A[i];
vec ans(N, 0);
for (int i = 1; i <= N; i++) {
REP(j, N - 1) {
if (A[j] == i)
ans[i - 1]++;
}
}
REP(i, N) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
// #define Add(x, y) x = (x + (y)) % mod
// #define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
cin >> N;
vector<int> A(N - 1);
REP(i, N - 1) cin >> A[i];
vec ans(N, 0);
for (int i = 0; i < N - 1; i++) {
ans[A[i] - 1]++;
}
REP(i, N) cout << ans[i] << endl;
} | replace | 109 | 114 | 109 | 111 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int cnt[100005];
int main() {
int n, x;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int cnt[10000005];
int main() {
int n, x;
cin >> n;
for (int i = 0; i < n - 1; i++) {
cin >> x;
cnt[x]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using lint = long long int;
int main() {
lint n;
cin >> n;
vector<lint> vc;
rep(i, n - 1) {
int x;
cin >> x;
vc.push_back(x);
}
vector<lint> cnt(5);
rep(i, n - 1) cnt[(vc[i] - 1)]++;
rep(i, n) cout << cnt[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using lint = long long int;
int main() {
lint n;
cin >> n;
vector<lint> vc;
rep(i, n - 1) {
int x;
cin >> x;
vc.push_back(x);
}
vector<lint> cnt(n);
rep(i, n - 1) cnt[(vc[i] - 1)]++;
rep(i, n) cout << cnt[i] << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02707 | Python | Time Limit Exceeded | n = int(input())
a = map(int, input().split())
a = list(a)
for i in range(n):
count = 0
for j in range(i, n - 1):
if a[j] == i + 1:
count += 1
print(count)
| n = int(input())
a = map(int, input().split())
a = list(a)
result = [0] * n
for i in range(n - 1):
result[a[i] - 1] += 1
print(*result, sep="\n")
| replace | 4 | 10 | 4 | 9 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int n = n + 1;
vector<int> a(n);
for (int i = 2; i <= N; i++) {
cin >> a[i];
}
vector<int> d(n);
for (int i = 2; i <= N; i++) {
++d[a[i]];
}
erep1(i, N) cout << d[i] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
int n = N + 1;
vector<int> a(n);
for (int i = 2; i <= N; i++) {
cin >> a[i];
}
vector<int> d(n);
for (int i = 2; i <= N; i++) {
++d[a[i]];
}
erep1(i, N) cout << d[i] << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02707 | C++ | Runtime Error | #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; i++) {
ans.at(i) = 0;
}
for (int i = 0; i < N; i++) {
ans.at(A.at(i)) = ans.at(A.at(i)) + 1;
}
for (int i = 0; i < N; i++) {
cout << ans.at(i) << endl;
}
return 0;
} | #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; i++) {
ans.at(i) = 0;
}
for (int i = 0; i < N - 1; i++) {
ans.at(A.at(i) - 1) = ans.at(A.at(i) - 1) + 1;
}
for (int i = 0; i < N; i++) {
cout << ans.at(i) << endl;
}
return 0;
} | replace | 15 | 17 | 15 | 17 | -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++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N, 0);
for (int i = 1; i < N; i++)
cin >> A[i];
vector<long long> ANS(N, 0);
for (int i = 0; i < N; i++)
ANS[A[i] - 1]++;
for (int i = 0; i < N; i++)
cout << ANS[i] << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N, 0);
for (int i = 1; i < N; i++)
cin >> A[i];
vector<long long> ANS(N, 0);
for (int i = 1; i < N; i++)
ANS[A[i] - 1]++;
for (int i = 0; i < N; i++)
cout << ANS[i] << endl;
}
| replace | 14 | 15 | 14 | 15 | -6 | munmap_chunk(): invalid pointer
|
p02707 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 1; i < n; i++)
cin >> A[i];
vector<int> ans(n);
for (int i = 0; i < n; i++) {
ans[(A[i] - 1)] += 1;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 1; i < n; i++)
cin >> A[i];
vector<int> ans(n);
for (int i = 1; i < n; i++) {
int supervisor = A[i] - 1;
ans[supervisor] += 1;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
| replace | 14 | 16 | 14 | 17 | -6 | double free or corruption (out)
|
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
vector<int> b(n, 0);
rep(i, n - 1) cin >> a[i];
sort(a.begin(), a.end());
rep(i, n - 1) {
for (int j = i; j < n - 1; ++j) {
if (i + 1 == a[j]) {
++b[i];
} else if (i + 1 < a[j]) {
break;
i = j;
}
}
}
rep(i, n) cout << b.at(i) << "\n";
return 0;
} | #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 - 1);
vector<int> b(n, 0);
rep(i, n - 1) cin >> a[i];
sort(a.begin(), a.end());
int i = 1, j = 0;
while (i < n) {
if (i == a[j]) {
++b[i - 1];
++j;
continue;
} else if (i != a[j]) {
++i;
continue;
}
}
rep(i, n) cout << b.at(i) << "\n";
return 0;
} | replace | 13 | 21 | 13 | 22 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ms memset
// #define MAXN 10005
// #define MAXM 100005
#define pi 3.14159265359
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef long long ll;
typedef priority_queue<int> pqi;
typedef priority_queue<pii, vpii, greater<pii>> dij;
int N, n;
int A[100010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> n;
A[n]++;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ms memset
// #define MAXN 10005
// #define MAXM 100005
#define pi 3.14159265359
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
typedef long long ll;
typedef priority_queue<int> pqi;
typedef priority_queue<pii, vpii, greater<pii>> dij;
int N, n;
int A[200010];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
for (int i = 0; i < N - 1; i++) {
cin >> n;
A[n]++;
}
for (int i = 1; i <= N; i++) {
cout << A[i] << "\n";
}
return 0;
} | replace | 19 | 20 | 19 | 20 | 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 rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
vector<int> b(200000);
int ans = 0;
rep(i, n - 1) {
cin >> a.at(i);
b.at(a.at(i))++;
}
rep2(i, 1, n + 1) { cout << b.at(i) << endl; }
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n - 1);
vector<int> b(200200);
int ans = 0;
rep(i, n - 1) {
cin >> a.at(i);
b.at(a.at(i))++;
}
rep2(i, 1, n + 1) { cout << b.at(i) << endl; }
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define REP(i, n) for (LL i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (LL i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x).begin(), (x).end()
#define int long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
};
signed main() {
int n;
cin >> n;
vector<int> a(20010);
vector<int> ans(200010);
REP(i, 200010) {
a[i] = 0;
ans[i] = 0;
}
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define REP(i, n) for (LL i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (LL i = m; i n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define all(x) (x).begin(), (x).end()
#define int long long
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
};
signed main() {
int n;
cin >> n;
vector<int> a(200010);
vector<int> ans(200010);
REP(i, 200010) {
a[i] = 0;
ans[i] = 0;
}
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
}
| replace | 18 | 19 | 18 | 19 | -11 | |
p02707 | C++ | Runtime Error | /*! at-abc163c.cc
* 2020-04-30
* GCC+17
* Type (opt):
* Notes (opt):
*/
#include <cstdio>
using llu = long long unsigned;
using ll = long long;
int main(void) {
int co[100001];
llu n, i, a;
scanf("%llu", &n);
for (i = 1; i < n; i++) {
// printf("%d", i);
scanf("%llu", &a);
co[a]++;
}
for (i = 1; i < n + 1; i++)
printf("%i\n", co[i]);
return 0;
}
| /*! at-abc163c.cc
* 2020-04-30
* GCC+17
* Type (opt):
* Notes (opt):
*/
#include <cstdio>
using llu = long long unsigned;
using ll = long long;
int main(void) {
int co[1000000];
llu n, i, a;
scanf("%llu", &n);
for (i = 1; i < n; i++) {
// printf("%d", i);
scanf("%llu", &a);
co[a]++;
}
for (i = 1; i < n + 1; i++)
printf("%i\n", co[i]);
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<int> A;
ll cnt[20001];
void solve() {
for (int i = 0; i < n; i++) {
cnt[i] = 0;
}
for (auto &e : A) {
cnt[e - 1]++;
}
for (int i = 0; i < n; i++)
cout << cnt[i] << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
A.push_back(a);
}
solve();
return EXIT_SUCCESS;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<int> A;
int cnt[200000];
void solve() {
for (int i = 0; i < n; i++) {
cnt[i] = 0;
}
for (auto &e : A) {
cnt[e - 1]++;
}
for (int i = 0; i < n; i++)
cout << cnt[i] << endl;
}
int main() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int a;
cin >> a;
A.push_back(a);
}
solve();
return EXIT_SUCCESS;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n;
cin >> n;
int stuff[n], boss[200010] = {0};
repi(i, 1, n) cin >> stuff[i];
rep(i, n) boss[stuff[i] - 1]++;
for (int i = 0; i < n; i++)
cout << boss[i] << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int n;
cin >> n;
int stuff[n], boss[200010] = {0};
for (int i = 2; i <= n; i++)
cin >> stuff[i];
for (int i = 2; i <= n; i++)
boss[stuff[i]]++;
for (int i = 1; i <= n; i++)
cout << boss[i] << endl;
} | replace | 10 | 13 | 10 | 15 | -11 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
#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);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
for (int j = 1; j <= n; j++) {
int ans = 0;
rep(i, n) {
if (a[i] == j)
ans++;
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <map>
#include <string>
#include <vector>
#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 - 1);
rep(i, n - 1) cin >> a[i];
vector<int> ans(n);
rep(i, n - 1) ans[a[i] - 1]++;
rep(i, n) cout << ans[i] << endl;
return 0;
} | replace | 12 | 23 | 12 | 17 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define ll long long
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
int main() {
ll n;
cin >> n;
vector<ll> a(n - 1);
vector<ll> s(n + 1);
rep(i, n) { s[i] = 0; }
rep(i, n) {
cin >> a[i];
s[a[i]]++;
/*for(int j=0;j<n;j++){
if(j==a[i])
s[j]++;
}*/
}
rep(i, n + 1) cout << s[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
#define ll long long
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> s(n + 1);
rep(i, n) { s[i] = 0; }
rep(i, n) {
cin >> a[i];
s[a[i]]++;
/*for(int j=0;j<n;j++){
if(j==a[i])
s[j]++;
}*/
}
rep(i, n + 1) cout << s[i] << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N);
A.at(0) = 0;
for (int i = 1; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N - 1; i++) {
B.at(i) = 0;
for (int j = i + 1; j < N; j++) {
if (i + 1 == A.at(j)) {
B.at(i)++;
}
}
}
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);
vector<int> B(N);
A.at(0) = 0;
for (int i = 1; i < N; i++) {
cin >> A.at(i);
}
for (int i = 1; i < N; i++) {
B.at(A.at(i) - 1)++;
}
for (int i = 0; i < N; i++) {
cout << B.at(i) << endl;
}
} | replace | 12 | 19 | 12 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e5 + 5;
int cnt[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a;
for (int i = 2; i <= n; i++) {
cin >> a;
cnt[a]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 2e5 + 5;
int cnt[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a;
for (int i = 2; i <= n; i++) {
cin >> a;
cnt[a]++;
}
for (int i = 1; i <= n; i++) {
cout << cnt[i] << endl;
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | /*-- ILSH --*/
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpl vector<pll>
#define fi first
#define sz size
#define len length
#define se second
const ll mod = 1e9 + 7;
const ll inf = 1e18 + 1e17;
// const ll mod = 998244353;
ll modInverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll powm(ll a, ll b) {
a = a % mod;
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return (res % mod);
}
const ll N = 1e5 + 6;
const long double pi = 3.14159265358979323;
vii v[N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int aa;
cin >> aa;
v[aa].pb(i + 2);
}
for (int i = 1; i <= n; i++)
cout << v[i].sz() << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
}
| /*-- ILSH --*/
#include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpi vector<pii>
#define vpl vector<pll>
#define fi first
#define sz size
#define len length
#define se second
const ll mod = 1e9 + 7;
const ll inf = 1e18 + 1e17;
// const ll mod = 998244353;
ll modInverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll powm(ll a, ll b) {
a = a % mod;
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return (res % mod);
}
const ll N = 2e5 + 6;
const long double pi = 3.14159265358979323;
vii v[N];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n - 1; i++) {
int aa;
cin >> aa;
v[aa].pb(i + 2);
}
for (int i = 1; i <= n; i++)
cout << v[i].sz() << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cfenv>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
int A[100000];
int ans[100000];
cin >> N;
for (int i = 0; i < 100000; 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;
}
return 0;
} | #include <algorithm>
#include <array>
#include <cfenv>
#include <cmath>
#include <deque>
#include <forward_list>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <unordered_map>
#include <unordered_set>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N;
int A[500000];
int ans[500000];
cin >> N;
for (int i = 0; i < 100000; 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;
}
return 0;
} | replace | 33 | 35 | 33 | 35 | 0 | |
p02707 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n, a;
cin >> n;
vector<int> vec(n, 0);
for (int i = 0; i < n; i++) {
cin >> a;
vec[--a]++;
}
for (int i = 0; i < n; i++)
cout << vec[i] << ' ';
cout << endl;
}
| #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n, a;
cin >> n;
vector<int> vec(n, 0);
for (int i = 0; i < n - 1; i++) {
cin >> a;
vec[--a]++;
}
for (int i = 0; i < n; i++)
cout << vec[i] << ' ';
cout << endl;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define ll long long
#define out(n) cout << #n << ' = ' << '\n'
using namespace std;
const int maxn = 1e5;
int a[maxn];
int ans[maxn];
int main() {
int n;
cin >> n;
rep(i, 0, n - 1) {
cin >> a[i];
ans[a[i]]++;
}
rep(i, 1, n + 1) cout << ans[i] << '\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define ll long long
#define out(n) cout << #n << ' = ' << '\n'
using namespace std;
const int maxn = 2e5 + 10;
int a[maxn];
int ans[maxn];
int main() {
int n;
cin >> n;
rep(i, 0, n - 1) {
cin >> a[i];
ans[a[i]]++;
}
rep(i, 1, n + 1) cout << ans[i] << '\n';
return 0;
} | replace | 9 | 10 | 9 | 10 | 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[i];
}
vector<int> ans(n, 0);
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= n; j++) {
if (j == a[i])
ans[j - 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;
vector<int> a(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> a[i];
}
vector<int> ans(n, 0);
for (int i = 0; i < n - 1; i++) {
ans[a[i] - 1]++;
}
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
| replace | 12 | 16 | 12 | 14 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> vec(N - 1);
vector<int> vec2(N);
for (int i = 0; i < N - 1; i++) {
int a;
cin >> a;
vec.at(i) = a;
}
for (int i = 0; i < N - 1; i++) {
vec2.at(vec.at(i) - 1)++;
}
for (int i = 0; i < N; i++) {
cout << vec2.at(i) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N - 1);
vector<int> vec2(N);
for (int i = 0; i < N - 1; i++) {
int a;
cin >> a;
vec.at(i) = a;
}
for (int i = 0; i < N - 1; i++) {
vec2.at(vec.at(i) - 1)++;
}
for (int i = 0; i < N; i++) {
cout << vec2.at(i) << endl;
}
}
| insert | 5 | 5 | 5 | 6 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> ans(n);
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> ans(n + 1);
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
return 0;
}
| replace | 8 | 10 | 8 | 10 | 0 | |
p02707 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <boost/array.hpp>
// #include <boost/range/numeric.hpp>
// #include <boost/range/algorithm.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
// using namespace boost::multiprecision;
constexpr long long INF = LLONG_MAX;
constexpr long long MOD = 1000000007;
constexpr long double PI = M_PI;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, n, r) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(x) x.begin(), x.end()
#define CALL(x) x.cbegin(), x.cend()
#define RALL(x) x.rbegin(), x.rend()
#define CRALL(x) x.crbegin(), x.crend()
#define cout cout << fixed << setprecision(12)
#define dbglf cerr << '\n'
#define ACCM(arr) accumulate(ALL(arr), 0LL)
#define Yes(ex) cout << ((ex) ? "Yes" : "No") << endl
#define YES(ex) cout << ((ex) ? "YES" : "NO") << endl
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
using vp = vector<pair<ll, ll>>;
using vs = vector<string>;
using vc = vector<char>;
using lst = list<ll>;
using pq = priority_queue<ll>;
template <typename T> inline void veccin(vector<T> &v) {
for (auto &&e : v) {
cin >> e;
}
}
template <typename T> inline void dbg(T a) { cerr << a << ' '; }
ll n, m, k;
ll ans = 0, sum = 0, cnt = 0;
// ld d;
string s /*1, s2, s3*/;
char c /*1, c2, c3*/;
bool flag = false;
/*--------------------template--------------------*/
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vi a(n);
FOR(i, 1, n) { cin >> a[i]; }
REP(i, n) { cout << count(ALL(a), i + 1) << endl; }
}
| #include <bits/stdc++.h>
// #include <boost/array.hpp>
// #include <boost/range/numeric.hpp>
// #include <boost/range/algorithm.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
// using namespace boost::multiprecision;
constexpr long long INF = LLONG_MAX;
constexpr long long MOD = 1000000007;
constexpr long double PI = M_PI;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); ++i)
#define RFOR(i, n, r) for (ll i = (ll)(n - 1); i >= r; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(x) x.begin(), x.end()
#define CALL(x) x.cbegin(), x.cend()
#define RALL(x) x.rbegin(), x.rend()
#define CRALL(x) x.crbegin(), x.crend()
#define cout cout << fixed << setprecision(12)
#define dbglf cerr << '\n'
#define ACCM(arr) accumulate(ALL(arr), 0LL)
#define Yes(ex) cout << ((ex) ? "Yes" : "No") << endl
#define YES(ex) cout << ((ex) ? "YES" : "NO") << endl
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
using vp = vector<pair<ll, ll>>;
using vs = vector<string>;
using vc = vector<char>;
using lst = list<ll>;
using pq = priority_queue<ll>;
template <typename T> inline void veccin(vector<T> &v) {
for (auto &&e : v) {
cin >> e;
}
}
template <typename T> inline void dbg(T a) { cerr << a << ' '; }
ll n, m, k;
ll ans = 0, sum = 0, cnt = 0;
// ld d;
string s /*1, s2, s3*/;
char c /*1, c2, c3*/;
bool flag = false;
/*--------------------template--------------------*/
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vi a(n), b(n, 0);
FOR(i, 1, n) {
cin >> a[i];
b[(a[i] - 1)]++;
}
REP(i, n) { cout << b[i] << endl; }
}
| replace | 65 | 68 | 65 | 71 | TLE | |
p02707 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
// 数値の定義
int N; // 人数
cin >> N;
int num[N]; // 上司番号{0,1,1,2,2}
int buka[N]; // 部下の数{2,2,0,0,0}
for (int i = 0; i < N; i++) { // 部下の数をループ
buka[i] = 0;
if (i > 0) {
cin >> num[i];
for (int j = 0; j < N; j++) { // 上司の数をループ
// cout << "num[i] = " << num[i] << " "<< "j+1 = " << j+1 << endl;
if (num[i] == j + 1) {
// cout << "--> correct" << endl;
buka[j]++;
break;
}
}
}
}
// 判定
for (int i = 0; i < N; i++) {
cout << buka[i] << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
// 数値の定義
int N; // 人数
cin >> N;
int num[N]; // 上司番号{0,1,1,2,2}
int buka[N]; // 部下の数{2,2,0,0,0}
for (int i = 0; i < N; i++) { // 部下の数をループ
buka[i] = 0;
if (i > 0) {
cin >> num[i];
buka[num[i] - 1]++;
}
}
// 判定
for (int i = 0; i < N; i++) {
cout << buka[i] << endl;
}
return 0;
} | replace | 17 | 25 | 17 | 18 | TLE | |
p02707 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int N, M, A[20002] = {0}, i, j, k;
int main() {
cin >> N;
for (i = 1; i < N; i++) {
cin >> k;
A[k]++;
}
for (i = 1; i <= N; i++) {
cout << A[i] << endl;
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string.h>
#include <vector>
using namespace std;
int N, M, A[200002] = {0}, i, j, k;
int main() {
cin >> N;
for (i = 1; i < N; i++) {
cin >> k;
A[k]++;
}
for (i = 1; i <= N; i++) {
cout << A[i] << endl;
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02707 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
n -= 1;
vector<int> a(200000);
vector<int> b(200000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 1; j <= i + 1; j++) {
if (a[i] == j) {
b[j - 1]++;
continue;
}
}
}
for (int i = 0; i <= n; i++) {
cout << b[i] << endl;
}
} | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
n -= 1;
vector<int> a(200000);
vector<int> b(200000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[a[i] - 1]++;
}
for (int i = 0; i <= n; i++) {
cout << b[i] << endl;
}
} | replace | 19 | 25 | 19 | 20 | TLE | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int main() {
cin >> n;
for (int i = 1; i < n; ++i) {
int x;
cin >> x;
a[x]++;
}
for (int i = 1; i <= n; ++i)
cout << a[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[200005];
int main() {
cin >> n;
for (int i = 1; i < n; ++i) {
int x;
cin >> x;
a[x]++;
}
for (int i = 1; i <= n; ++i)
cout << a[i] << endl;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int ind[maxn];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; ++i) {
int x;
cin >> x;
ind[x]++;
}
for (int i = 1; i <= n; ++i) {
cout << ind[i] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int ind[maxn];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; ++i) {
int x;
cin >> x;
ind[x]++;
}
for (int i = 1; i <= n; ++i) {
cout << ind[i] << endl;
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02707 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100000];
int ans[100000];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200010];
int ans[200010];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
ans[a[i]]++;
for (int i = 1; i <= n; i++)
cout << ans[i] << endl;
}
| 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.