Submission #1379971
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; const ull mod = 1e9 + 7; #define REP(i,n) for(int i=0;i<(int)n;++i) typedef vector<pii> Array; typedef vector<Array> Graph; Graph G(100005); int get_connect(int ver, int edge){ if(G[ver][edge].second != -1) return G[ver][edge].second; //cout << ver << " " << G[ver][edge].first << endl; int res = 1; int next = G[ver][edge].first; REP(i, G[next].size()){ if(G[next][i].first != ver) res += get_connect(next, i); } G[ver][edge].second = res; return res; } int main(){ int N; cin >> N; REP(i, N-1){ int p; cin >> p; pii q,r; q.first = p; q.second = -1; r.first = i+1; r.second = -1; G[i+1].push_back(q); G[p].push_back(r); } REP(i, N){ int res = -1; REP(j, G[i].size()){ int k; if(G[i][j].second==-1){ k = get_connect(i, j); }else{ k=G[i][j].second; } res = max(res, k); } cout << res << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋王国の分割統治 |
User | theory_and_me |
Language | C++14 (GCC 5.4.1) |
Score | 30 |
Code Size | 1316 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 14080 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 2 ms | 2560 KB |
sample_02.txt | AC | 2 ms | 2560 KB |
subtask1_01.txt | AC | 2 ms | 2560 KB |
subtask1_02.txt | AC | 2 ms | 2560 KB |
subtask1_03.txt | AC | 2 ms | 2560 KB |
subtask1_04.txt | AC | 2 ms | 2560 KB |
subtask1_05.txt | AC | 4 ms | 2560 KB |
subtask1_06.txt | AC | 4 ms | 2688 KB |
subtask1_07.txt | AC | 8 ms | 2688 KB |
subtask1_08.txt | AC | 5 ms | 2688 KB |
subtask1_09.txt | AC | 4 ms | 2688 KB |
subtask2_01.txt | AC | 155 ms | 5760 KB |
subtask2_02.txt | AC | 193 ms | 6528 KB |
subtask2_03.txt | AC | 211 ms | 6912 KB |
subtask2_04.txt | AC | 208 ms | 6912 KB |
subtask2_05.txt | TLE | 2104 ms | 6516 KB |
subtask2_06.txt | TLE | 2104 ms | 6764 KB |
subtask2_07.txt | AC | 205 ms | 14080 KB |