oj.uz

답안 #773604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
773604 2023-07-05T07:10:59 Z 1bin Unique Cities (JOI19_ho_t5) C++14
100 / 100
 307 ms 38848 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 2e5 + 5;
int n, m, C[NMAX], D[NMAX], a, b, mxd, ix, r1, r2, ans[NMAX], cur, cnt[NMAX], mx[NMAX][2], idx[NMAX][2];
vector<int> adj[NMAX];
 
void dfs2(int x, int p, int d){
    if(d > mxd) mxd = d, ix = x;
    for(int&nx : adj[x])
        if(nx != p) dfs2(nx, x, d + 1);
    return;
}
 
void go(int x, int p){
    mx[x][0] = mx[x][1] = 0;
    for(int& nx : adj[x])
        if(nx != p){
            go(nx, x);
            if(mx[nx][0] + 1 > mx[x][1]) mx[x][1] = mx[nx][0] + 1, idx[x][1] = nx;
            if(mx[x][0] < mx[x][1]){
                swap(mx[x][0], mx[x][1]);
                swap(idx[x][0], idx[x][1]);
            }
        }
    return;
}
 
void f(int x, int add){
    if(add){
        if(++cnt[C[x]] == 1) cur++;
    }
    else{
        if(--cnt[C[x]] == 0) cur--;
    }
    return;
}
 
stack<int> st;
void dfs(int x, int p, int d){
    D[d] = x;
    
    auto calc = [&] (int mxd){
        while(st.size() && st.top() >= mxd){
            f(D[st.top()], 0); st.pop();
        }
    };
    if(mx[x][0]){
        int nx = idx[x][0];
        if(mx[x][1]) calc(d - mx[x][1]);
        st.emplace(d); f(x, 1);
        dfs(nx, x, d + 1);
        
        calc(d - mx[x][0]);
        ans[x] = max(ans[x], cur);
        for(int& nx : adj[x])
            if(nx != p && nx != idx[x][0]){
                if(st.empty() || st.top() != d) st.emplace(d), f(x, 1);
                dfs(nx, x, d + 1);
            }
        if(st.size() && st.top() == d) st.pop(), f(x, 0);
    }
    else ans[x] = max(ans[x], cur);
    return;
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m;
    for(int i = 1; i < n; i++){
        cin >> a >> b;
        adj[a].emplace_back(b);
        adj[b].emplace_back(a);
    }    
    for(int i = 1; i <= n; i++) cin >> C[i];
    dfs2(1, -1, 0);
    r1 = ix;
    mxd = 0; dfs2(r1, -1, 0);
    r2 = ix;
    
    go(r1, -1); dfs(r1, -1, 0);
    go(r2, -1); dfs(r2, -1, 0);
    for(int i = 1; i <= n; i++) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5168 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 4 ms 5332 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5204 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5332 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5188 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5204 KB Output is correct
28 Correct 4 ms 5204 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 11832 KB Output is correct
2 Correct 141 ms 21484 KB Output is correct
3 Correct 18 ms 8148 KB Output is correct
4 Correct 251 ms 19416 KB Output is correct
5 Correct 275 ms 36300 KB Output is correct
6 Correct 274 ms 27740 KB Output is correct
7 Correct 194 ms 19452 KB Output is correct
8 Correct 208 ms 21020 KB Output is correct
9 Correct 263 ms 20532 KB Output is correct
10 Correct 194 ms 20396 KB Output is correct
11 Correct 120 ms 20100 KB Output is correct
12 Correct 292 ms 29788 KB Output is correct
13 Correct 203 ms 27696 KB Output is correct
14 Correct 229 ms 27160 KB Output is correct
15 Correct 71 ms 18444 KB Output is correct
16 Correct 185 ms 31084 KB Output is correct
17 Correct 185 ms 27860 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 14920 KB Output is correct
2 Correct 307 ms 33724 KB Output is correct
3 Correct 21 ms 8780 KB Output is correct
4 Correct 171 ms 21044 KB Output is correct
5 Correct 257 ms 38848 KB Output is correct
6 Correct 230 ms 29652 KB Output is correct
7 Correct 152 ms 21032 KB Output is correct
8 Correct 178 ms 24708 KB Output is correct
9 Correct 170 ms 23376 KB Output is correct
10 Correct 228 ms 22368 KB Output is correct
11 Correct 134 ms 21332 KB Output is correct
12 Correct 230 ms 35280 KB Output is correct
13 Correct 183 ms 28740 KB Output is correct
14 Correct 194 ms 28692 KB Output is correct
15 Correct 71 ms 19480 KB Output is correct
16 Correct 185 ms 33288 KB Output is correct
17 Correct 196 ms 29844 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5168 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 4 ms 5332 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 3 ms 5332 KB Output is correct
14 Correct 3 ms 5204 KB Output is correct
15 Correct 3 ms 5204 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5204 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5332 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5188 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5204 KB Output is correct
28 Correct 4 ms 5204 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 4 ms 5200 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 94 ms 11832 KB Output is correct
34 Correct 141 ms 21484 KB Output is correct
35 Correct 18 ms 8148 KB Output is correct
36 Correct 251 ms 19416 KB Output is correct
37 Correct 275 ms 36300 KB Output is correct
38 Correct 274 ms 27740 KB Output is correct
39 Correct 194 ms 19452 KB Output is correct
40 Correct 208 ms 21020 KB Output is correct
41 Correct 263 ms 20532 KB Output is correct
42 Correct 194 ms 20396 KB Output is correct
43 Correct 120 ms 20100 KB Output is correct
44 Correct 292 ms 29788 KB Output is correct
45 Correct 203 ms 27696 KB Output is correct
46 Correct 229 ms 27160 KB Output is correct
47 Correct 71 ms 18444 KB Output is correct
48 Correct 185 ms 31084 KB Output is correct
49 Correct 185 ms 27860 KB Output is correct
50 Correct 153 ms 14920 KB Output is correct
51 Correct 307 ms 33724 KB Output is correct
52 Correct 21 ms 8780 KB Output is correct
53 Correct 171 ms 21044 KB Output is correct
54 Correct 257 ms 38848 KB Output is correct
55 Correct 230 ms 29652 KB Output is correct
56 Correct 152 ms 21032 KB Output is correct
57 Correct 178 ms 24708 KB Output is correct
58 Correct 170 ms 23376 KB Output is correct
59 Correct 228 ms 22368 KB Output is correct
60 Correct 134 ms 21332 KB Output is correct
61 Correct 230 ms 35280 KB Output is correct
62 Correct 183 ms 28740 KB Output is correct
63 Correct 194 ms 28692 KB Output is correct
64 Correct 71 ms 19480 KB Output is correct
65 Correct 185 ms 33288 KB Output is correct
66 Correct 196 ms 29844 KB Output is correct
67 Correct 16 ms 7072 KB Output is correct
68 Correct 59 ms 19256 KB Output is correct
69 Correct 97 ms 19664 KB Output is correct
70 Correct 215 ms 19416 KB Output is correct
71 Correct 210 ms 36200 KB Output is correct
72 Correct 254 ms 27612 KB Output is correct
73 Correct 169 ms 19416 KB Output is correct
74 Correct 162 ms 22480 KB Output is correct
75 Correct 202 ms 20880 KB Output is correct
76 Correct 184 ms 20636 KB Output is correct
77 Correct 128 ms 19652 KB Output is correct
78 Correct 278 ms 31620 KB Output is correct
79 Correct 204 ms 29820 KB Output is correct
80 Correct 232 ms 26100 KB Output is correct
81 Correct 65 ms 18216 KB Output is correct
82 Correct 178 ms 31036 KB Output is correct
83 Correct 225 ms 27836 KB Output is correct
84 Correct 186 ms 19668 KB Output is correct
85 Correct 298 ms 36908 KB Output is correct
86 Correct 233 ms 28176 KB Output is correct
87 Correct 173 ms 19660 KB Output is correct
88 Correct 214 ms 23284 KB Output is correct
89 Correct 264 ms 21500 KB Output is correct
90 Correct 206 ms 21068 KB Output is correct
91 Correct 126 ms 20040 KB Output is correct
92 Correct 274 ms 36468 KB Output is correct
93 Correct 194 ms 25672 KB Output is correct
94 Correct 190 ms 24064 KB Output is correct
95 Correct 78 ms 18708 KB Output is correct
96 Correct 212 ms 31536 KB Output is correct
97 Correct 210 ms 28384 KB Output is correct
98 Correct 185 ms 21016 KB Output is correct
99 Correct 247 ms 37352 KB Output is correct
100 Correct 293 ms 29284 KB Output is correct
101 Correct 141 ms 20296 KB Output is correct
102 Correct 191 ms 23056 KB Output is correct
103 Correct 188 ms 22044 KB Output is correct
104 Correct 219 ms 21632 KB Output is correct
105 Correct 136 ms 20496 KB Output is correct
106 Correct 274 ms 30360 KB Output is correct
107 Correct 174 ms 30632 KB Output is correct
108 Correct 196 ms 26176 KB Output is correct
109 Correct 70 ms 19372 KB Output is correct
110 Correct 176 ms 32464 KB Output is correct
111 Correct 240 ms 29336 KB Output is correct