oj.uz

답안 #208170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208170 2020-03-10T06:56:34 Z coldEr66 Unique Cities (JOI19_ho_t5) C++14
100 / 100
 474 ms 34664 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int,int> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"LINE: %d (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

int c[MAXn];
vector<int> e[MAXn];
int son[MAXn],dep[MAXn],mx[MAXn];
vector<int> stk;
int ans[MAXn],cnt;
int col[MAXn];
void gtDia(int x,int p){
    dep[x] = dep[p] + 1;
    for (auto i:e[x]) {
        if (i == p) continue;
        gtDia(i,x);
    }
}
void stk_push(int x){
    col[c[x]]++;
    cnt += (col[c[x]] == 1);
    stk.eb(x);
}
void stk_pop(){
    int cur = stk.back();
    stk.pop_back();
    col[c[cur]]--;
    cnt -= (col[c[cur]] == 0);
    debug(cnt,stk);
}
void dfs1(int x,int p){
    dep[x] = dep[p] + 1;
    son[x] = mx[x] = 0;
    for (auto i:e[x]) {
        if (i == p) continue;
        dfs1(i,x);
        if (mx[i] > mx[son[x]]) son[x] = i;
    }
    mx[x] = mx[son[x]] + 1;
}
void dfs2(int x,int p){
    if (!son[x]) {
        ans[x] = max(ans[x],cnt);
        return;
    }
    int mxdep = 0;
    for (auto i:e[x]) {
        if (i == p || i == son[x]) continue;
        mxdep = max(mxdep,mx[i]);
    }
    while (SZ(stk) && dep[stk.back()] >= dep[x] - mxdep) stk_pop();
    stk_push(x);
    dfs2(son[x],x);

    for (auto i:e[x]) {
        if (i == p || i == son[x]) continue;
        while (SZ(stk) && dep[stk.back()] >= dep[x] - mx[son[x]]) stk_pop();
        stk_push(x);
        dfs2(i,x);
    }
    while (SZ(stk) && dep[stk.back()] >= dep[x] - mx[son[x]]) stk_pop();
    ans[x] = max(ans[x],cnt);
}
int main(){
    IOS();
    int n,m;
    cin >> n >> m;
    REP (i,n-1) {
        int u,v;
        cin >> u >> v;
        e[u].eb(v);
        e[v].eb(u);
    }
    REP1 (i,n) cin >> c[i];

    gtDia(1,1);
    int S = 0,T = 0;
    REP1 (i,n) {
        if (S == 0) S = i;
        else if (dep[S] < dep[i]) S = i;
    }
    gtDia(S,S);
    REP1 (i,n) {
        if (T == 0) T = i;
        else if (dep[T] < dep[i]) T = i;
    }
    debug(S,T);

    dfs1(S,S);
    dfs2(S,S);
    pary(son+1,son+n+1);
    dfs1(T,T);
    dfs2(T,T);
    pary(son+1,son+n+1);

    REP1 (i,n) cout << ans[i] << endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 5240 KB Output is correct
3 Correct 8 ms 5240 KB Output is correct
4 Correct 9 ms 5112 KB Output is correct
5 Correct 9 ms 5240 KB Output is correct
6 Correct 9 ms 5372 KB Output is correct
7 Correct 10 ms 5240 KB Output is correct
8 Correct 9 ms 5240 KB Output is correct
9 Correct 9 ms 5244 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 9 ms 5240 KB Output is correct
12 Correct 9 ms 5240 KB Output is correct
13 Correct 9 ms 5368 KB Output is correct
14 Correct 9 ms 5240 KB Output is correct
15 Correct 9 ms 5244 KB Output is correct
16 Correct 9 ms 5240 KB Output is correct
17 Correct 9 ms 5240 KB Output is correct
18 Correct 10 ms 5240 KB Output is correct
19 Correct 9 ms 5240 KB Output is correct
20 Correct 9 ms 5368 KB Output is correct
21 Correct 10 ms 5244 KB Output is correct
22 Correct 9 ms 5116 KB Output is correct
23 Correct 10 ms 5244 KB Output is correct
24 Correct 9 ms 5240 KB Output is correct
25 Correct 9 ms 5240 KB Output is correct
26 Correct 8 ms 5240 KB Output is correct
27 Correct 9 ms 5368 KB Output is correct
28 Correct 9 ms 5240 KB Output is correct
29 Correct 9 ms 5240 KB Output is correct
30 Correct 9 ms 5244 KB Output is correct
31 Correct 9 ms 5240 KB Output is correct
32 Correct 9 ms 5240 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 13048 KB Output is correct
2 Correct 211 ms 20468 KB Output is correct
3 Correct 32 ms 7928 KB Output is correct
4 Correct 340 ms 18808 KB Output is correct
5 Correct 442 ms 31980 KB Output is correct
6 Correct 412 ms 25200 KB Output is correct
7 Correct 303 ms 18676 KB Output is correct
8 Correct 344 ms 19960 KB Output is correct
9 Correct 350 ms 19576 KB Output is correct
10 Correct 328 ms 19448 KB Output is correct
11 Correct 162 ms 19304 KB Output is correct
12 Correct 401 ms 26736 KB Output is correct
13 Correct 361 ms 25464 KB Output is correct
14 Correct 360 ms 24696 KB Output is correct
15 Correct 164 ms 19308 KB Output is correct
16 Correct 343 ms 27884 KB Output is correct
17 Correct 370 ms 25588 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 17020 KB Output is correct
2 Correct 424 ms 33260 KB Output is correct
3 Correct 38 ms 8440 KB Output is correct
4 Correct 342 ms 20476 KB Output is correct
5 Correct 474 ms 34664 KB Output is correct
6 Correct 422 ms 27116 KB Output is correct
7 Correct 344 ms 20548 KB Output is correct
8 Correct 378 ms 23160 KB Output is correct
9 Correct 379 ms 22264 KB Output is correct
10 Correct 372 ms 21496 KB Output is correct
11 Correct 262 ms 20596 KB Output is correct
12 Correct 446 ms 31908 KB Output is correct
13 Correct 377 ms 26484 KB Output is correct
14 Correct 385 ms 26356 KB Output is correct
15 Correct 177 ms 20396 KB Output is correct
16 Correct 361 ms 30060 KB Output is correct
17 Correct 379 ms 27508 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 5240 KB Output is correct
3 Correct 8 ms 5240 KB Output is correct
4 Correct 9 ms 5112 KB Output is correct
5 Correct 9 ms 5240 KB Output is correct
6 Correct 9 ms 5372 KB Output is correct
7 Correct 10 ms 5240 KB Output is correct
8 Correct 9 ms 5240 KB Output is correct
9 Correct 9 ms 5244 KB Output is correct
10 Correct 9 ms 5240 KB Output is correct
11 Correct 9 ms 5240 KB Output is correct
12 Correct 9 ms 5240 KB Output is correct
13 Correct 9 ms 5368 KB Output is correct
14 Correct 9 ms 5240 KB Output is correct
15 Correct 9 ms 5244 KB Output is correct
16 Correct 9 ms 5240 KB Output is correct
17 Correct 9 ms 5240 KB Output is correct
18 Correct 10 ms 5240 KB Output is correct
19 Correct 9 ms 5240 KB Output is correct
20 Correct 9 ms 5368 KB Output is correct
21 Correct 10 ms 5244 KB Output is correct
22 Correct 9 ms 5116 KB Output is correct
23 Correct 10 ms 5244 KB Output is correct
24 Correct 9 ms 5240 KB Output is correct
25 Correct 9 ms 5240 KB Output is correct
26 Correct 8 ms 5240 KB Output is correct
27 Correct 9 ms 5368 KB Output is correct
28 Correct 9 ms 5240 KB Output is correct
29 Correct 9 ms 5240 KB Output is correct
30 Correct 9 ms 5244 KB Output is correct
31 Correct 9 ms 5240 KB Output is correct
32 Correct 9 ms 5240 KB Output is correct
33 Correct 174 ms 13048 KB Output is correct
34 Correct 211 ms 20468 KB Output is correct
35 Correct 32 ms 7928 KB Output is correct
36 Correct 340 ms 18808 KB Output is correct
37 Correct 442 ms 31980 KB Output is correct
38 Correct 412 ms 25200 KB Output is correct
39 Correct 303 ms 18676 KB Output is correct
40 Correct 344 ms 19960 KB Output is correct
41 Correct 350 ms 19576 KB Output is correct
42 Correct 328 ms 19448 KB Output is correct
43 Correct 162 ms 19304 KB Output is correct
44 Correct 401 ms 26736 KB Output is correct
45 Correct 361 ms 25464 KB Output is correct
46 Correct 360 ms 24696 KB Output is correct
47 Correct 164 ms 19308 KB Output is correct
48 Correct 343 ms 27884 KB Output is correct
49 Correct 370 ms 25588 KB Output is correct
50 Correct 259 ms 17020 KB Output is correct
51 Correct 424 ms 33260 KB Output is correct
52 Correct 38 ms 8440 KB Output is correct
53 Correct 342 ms 20476 KB Output is correct
54 Correct 474 ms 34664 KB Output is correct
55 Correct 422 ms 27116 KB Output is correct
56 Correct 344 ms 20548 KB Output is correct
57 Correct 378 ms 23160 KB Output is correct
58 Correct 379 ms 22264 KB Output is correct
59 Correct 372 ms 21496 KB Output is correct
60 Correct 262 ms 20596 KB Output is correct
61 Correct 446 ms 31908 KB Output is correct
62 Correct 377 ms 26484 KB Output is correct
63 Correct 385 ms 26356 KB Output is correct
64 Correct 177 ms 20396 KB Output is correct
65 Correct 361 ms 30060 KB Output is correct
66 Correct 379 ms 27508 KB Output is correct
67 Correct 30 ms 7032 KB Output is correct
68 Correct 151 ms 17520 KB Output is correct
69 Correct 219 ms 18168 KB Output is correct
70 Correct 355 ms 18688 KB Output is correct
71 Correct 457 ms 32060 KB Output is correct
72 Correct 418 ms 25236 KB Output is correct
73 Correct 318 ms 18680 KB Output is correct
74 Correct 366 ms 21240 KB Output is correct
75 Correct 344 ms 19832 KB Output is correct
76 Correct 345 ms 19704 KB Output is correct
77 Correct 240 ms 18932 KB Output is correct
78 Correct 427 ms 28272 KB Output is correct
79 Correct 363 ms 27120 KB Output is correct
80 Correct 371 ms 23924 KB Output is correct
81 Correct 146 ms 19176 KB Output is correct
82 Correct 351 ms 27756 KB Output is correct
83 Correct 363 ms 25436 KB Output is correct
84 Correct 343 ms 18936 KB Output is correct
85 Correct 432 ms 32620 KB Output is correct
86 Correct 419 ms 25720 KB Output is correct
87 Correct 321 ms 18936 KB Output is correct
88 Correct 375 ms 21752 KB Output is correct
89 Correct 357 ms 20472 KB Output is correct
90 Correct 362 ms 20216 KB Output is correct
91 Correct 253 ms 19312 KB Output is correct
92 Correct 460 ms 32176 KB Output is correct
93 Correct 358 ms 23800 KB Output is correct
94 Correct 357 ms 22392 KB Output is correct
95 Correct 164 ms 19692 KB Output is correct
96 Correct 350 ms 28396 KB Output is correct
97 Correct 369 ms 25976 KB Output is correct
98 Correct 362 ms 20344 KB Output is correct
99 Correct 443 ms 33128 KB Output is correct
100 Correct 435 ms 26764 KB Output is correct
101 Correct 325 ms 19700 KB Output is correct
102 Correct 364 ms 21752 KB Output is correct
103 Correct 370 ms 21112 KB Output is correct
104 Correct 351 ms 20856 KB Output is correct
105 Correct 241 ms 19696 KB Output is correct
106 Correct 407 ms 27636 KB Output is correct
107 Correct 362 ms 27760 KB Output is correct
108 Correct 390 ms 24312 KB Output is correct
109 Correct 157 ms 20396 KB Output is correct
110 Correct 356 ms 29164 KB Output is correct
111 Correct 368 ms 26740 KB Output is correct