Submission #3093653
Source Code Expand
//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
//debug
#define DEBUG
#define DUMPOUT cout
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<" "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
void dump_func() {DUMPOUT << endl;};
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) DUMPOUT << " ";
else DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "[";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
os << "[";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
int n;
vector<vector<int>> g(100000 + 5);
int chsum[100000 + 5];
vector<int> ans(100000 + 5);
int dfs1(int now, int par) {
for (auto nx : g[now]) {
if (nx == par) continue;
chsum[now] += dfs1(nx, now);
}
return ++chsum[now];
}
void dfs2(int now, int par, int psum) {
int mx = psum;
int tmp_sum = psum;
for (auto nx : g[now]) {
if (nx == par) continue;
tmp_sum += chsum[nx];
mx = max(mx, chsum[nx]);
}
for (auto nx : g[now]) {
if (nx == par) continue;
dfs2(nx, now, tmp_sum - chsum[nx] + 1);
}
ans[now] = mx;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n - 1) {
int p;
cin >> p;
g[i + 1].push_back(p);
g[p].push_back(i + 1);
}
dfs1(0, -1);
dfs2(0, -1, 0);
rep(i, n) cout << ans[i] << endl;
}
Submission Info
Submission Time |
|
Task |
C - 高橋王国の分割統治 |
User |
roto_37 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4274 Byte |
Status |
AC |
Exec Time |
181 ms |
Memory |
14080 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 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 |
3 ms |
3328 KB |
sample_02.txt |
AC |
2 ms |
3456 KB |
subtask1_01.txt |
AC |
2 ms |
3328 KB |
subtask1_02.txt |
AC |
2 ms |
3328 KB |
subtask1_03.txt |
AC |
2 ms |
3328 KB |
subtask1_04.txt |
AC |
2 ms |
3456 KB |
subtask1_05.txt |
AC |
4 ms |
3456 KB |
subtask1_06.txt |
AC |
4 ms |
3456 KB |
subtask1_07.txt |
AC |
4 ms |
3456 KB |
subtask1_08.txt |
AC |
4 ms |
3456 KB |
subtask1_09.txt |
AC |
4 ms |
3456 KB |
subtask2_01.txt |
AC |
129 ms |
7168 KB |
subtask2_02.txt |
AC |
162 ms |
8064 KB |
subtask2_03.txt |
AC |
179 ms |
8448 KB |
subtask2_04.txt |
AC |
176 ms |
8448 KB |
subtask2_05.txt |
AC |
163 ms |
8692 KB |
subtask2_06.txt |
AC |
164 ms |
8812 KB |
subtask2_07.txt |
AC |
181 ms |
14080 KB |