oj.uz

답안 #800382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800382 2023-08-01T13:58:38 Z 1075508020060209tc Unique Cities (JOI19_ho_t5) C++14
100 / 100
 557 ms 40404 KB 
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include <bits/stdc++.h>
using namespace std;
//#define int long long

int n;int M;
vector<int>e[200005];
int D;
int rt1;int rt2;
int dph[200005];
int dp[200005];
int fa[200005];

void dpdfs(int nw,int pa){
fa[nw]=pa;
dph[nw]=dph[pa]+1;
dp[nw]=nw;
for(int i=0;i<e[nw].size();i++){
    int v=e[nw][i];
    if(v==pa){continue;}
    dpdfs(v,nw);
    if(dph[dp[v]]>dph[dp[nw]]){
        dp[nw]=dp[v];
    }
}
}

void finrt(){
dpdfs(1,0);
rt1=dp[1];
//cout<<rt1<<" ";
dpdfs(rt1,0);
rt2=dp[rt1];
//cout<<rt2<<endl;
D=dph[rt2];
}

void srtlng(int rt){
dpdfs(rt,0);
for(int nw=1;nw<=n;nw++){
    for(int i=0;i<e[nw].size();i++){
        int v=e[nw][i];
        if(v==fa[nw]){continue;}
        if(e[nw][0]==fa[nw]||dph[dp[v]]>dph[dp[e[nw][0]]]){
            swap(e[nw][i],e[nw][0]);
        }
    }
    for(int i=1;i<e[nw].size();i++){
        int v=e[nw][i];
        if(v==fa[nw]){continue;}
        if(e[nw][1]==fa[nw]||dph[dp[v]]>dph[dp[e[nw][1]]]){
            swap(e[nw][i],e[nw][1]);
        }
    }
}
}
int ar[200005];
int buc[200005];
int bcnt;
void add(int v){
    buc[v]++;
    if(buc[v]==1){bcnt++;}
    //cout<<v<<" "<<bcnt<<endl;
}
void del(int v){
    buc[v]--;
    if(buc[v]==0){bcnt--;}
   // cout<<v<<" "<<bcnt<<endl;
}
stack<int>stk;


int ans[200005];
void dfs(int nw,int pa){
if(e[nw].size()==1&&pa){
    ans[nw]=max(ans[nw],bcnt);
    return;
}
int d=0;
if(e[nw].size()>=2&&e[nw][1]!=pa){
    d=dph[dp[e[nw][1]]]-dph[nw];
}
while(stk.size()&&dph[stk.top()]>=dph[nw]-d){del(ar[stk.top()]);stk.pop();}
add(ar[nw]);
stk.push(nw);
dfs(e[nw][0],nw);
if(stk.size()&&stk.top()==nw){stk.pop();del(ar[nw]);}
d=dph[dp[e[nw][0]]]-dph[nw];
while(stk.size()&&dph[stk.top()]>=dph[nw]-d){del(ar[stk.top()]);stk.pop();}
ans[nw]=max(ans[nw],bcnt);
for(int i=1;i<e[nw].size();i++){
    int v=e[nw][i];
    if(v==pa){continue;}
    add(ar[nw]);
    stk.push(nw);
    dfs(e[nw][i],nw);
    if(stk.size()&&stk.top()==nw){stk.pop();del(ar[nw]);}
}
}

void solve(int rt){
bcnt=0;
while(stk.size()){stk.pop();}
for(int i=1;i<=n;i++){
    buc[i]=0;
}
dpdfs(rt,0);
srtlng(rt);
dfs(rt,0);
}


signed main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
cin>>n>>M;
for(int i=1;i<=n-1;i++){
    int a;int b;
    cin>>a>>b;
    e[a].push_back(b);
    e[b].push_back(a);
}
for(int i=1;i<=n;i++){cin>>ar[i];}
finrt();
//cout<<rt1<<endl;
solve(rt1);
//cout<<endl;

//cout<<rt2<<endl;
solve(rt2);
//cout<<rt1<<" "<<rt2<<endl;
for(int i=1;i<=n;i++){
    cout<<ans[i]<<endl;
}
}

Compilation message

joi2019_ho_t5.cpp:22:39: warning: bad option '-fwhole-program' to pragma 'optimize' [-Wpragmas]
   22 | #pragma GCC optimize("-fwhole-program")
      |                                       ^
joi2019_ho_t5.cpp:29:41: warning: bad option '-fstrict-overflow' to pragma 'optimize' [-Wpragmas]
   29 | #pragma GCC optimize("-fstrict-overflow")
      |                                         ^
joi2019_ho_t5.cpp:31:41: warning: bad option '-fcse-skip-blocks' to pragma 'optimize' [-Wpragmas]
   31 | #pragma GCC optimize("-fcse-skip-blocks")
      |                                         ^
joi2019_ho_t5.cpp:45:51: warning: bad option '-funsafe-loop-optimizations' to pragma 'optimize' [-Wpragmas]
   45 | #pragma GCC optimize("-funsafe-loop-optimizations")
      |                                                   ^
joi2019_ho_t5.cpp:60:25: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
   60 | void dpdfs(int nw,int pa){
      |                         ^
joi2019_ho_t5.cpp:60:25: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:60:25: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:60:25: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp: In function 'void dpdfs(int, int)':
joi2019_ho_t5.cpp:64:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp: At global scope:
joi2019_ho_t5.cpp:74:12: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
   74 | void finrt(){
      |            ^
joi2019_ho_t5.cpp:74:12: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:74:12: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:74:12: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:84:19: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
   84 | void srtlng(int rt){
      |                   ^
joi2019_ho_t5.cpp:84:19: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:84:19: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:84:19: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp: In function 'void srtlng(int)':
joi2019_ho_t5.cpp:87:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp:94:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for(int i=1;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp: At global scope:
joi2019_ho_t5.cpp:106:15: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
  106 | void add(int v){
      |               ^
joi2019_ho_t5.cpp:106:15: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:106:15: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:106:15: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:111:15: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
  111 | void del(int v){
      |               ^
joi2019_ho_t5.cpp:111:15: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:111:15: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:111:15: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:120:23: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
  120 | void dfs(int nw,int pa){
      |                       ^
joi2019_ho_t5.cpp:120:23: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:120:23: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:120:23: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp: In function 'void dfs(int, int)':
joi2019_ho_t5.cpp:137:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 | for(int i=1;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
joi2019_ho_t5.cpp: At global scope:
joi2019_ho_t5.cpp:147:18: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
  147 | void solve(int rt){
      |                  ^
joi2019_ho_t5.cpp:147:18: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:147:18: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:147:18: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:159:13: warning: bad option '-fwhole-program' to attribute 'optimize' [-Wattributes]
  159 | signed main(){
      |             ^
joi2019_ho_t5.cpp:159:13: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:159:13: warning: bad option '-fcse-skip-blocks' to attribute 'optimize' [-Wattributes]
joi2019_ho_t5.cpp:159:13: warning: bad option '-funsafe-loop-optimizations' to attribute 'optimize' [-Wattributes]

Subtask #1
4.0 / 4.0

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

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 13164 KB Output is correct
2 Correct 228 ms 24464 KB Output is correct
3 Correct 48 ms 8276 KB Output is correct
4 Correct 382 ms 19276 KB Output is correct
5 Correct 551 ms 38648 KB Output is correct
6 Correct 557 ms 28920 KB Output is correct
7 Correct 373 ms 19376 KB Output is correct
8 Correct 406 ms 21236 KB Output is correct
9 Correct 413 ms 20672 KB Output is correct
10 Correct 415 ms 20608 KB Output is correct
11 Correct 285 ms 20028 KB Output is correct
12 Correct 506 ms 31288 KB Output is correct
13 Correct 429 ms 28804 KB Output is correct
14 Correct 461 ms 28232 KB Output is correct
15 Correct 275 ms 19900 KB Output is correct
16 Correct 454 ms 32648 KB Output is correct
17 Correct 457 ms 29104 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 280 ms 17012 KB Output is correct
2 Correct 502 ms 38844 KB Output is correct
3 Correct 54 ms 8908 KB Output is correct
4 Correct 406 ms 20248 KB Output is correct
5 Correct 552 ms 40404 KB Output is correct
6 Correct 515 ms 30148 KB Output is correct
7 Correct 391 ms 20184 KB Output is correct
8 Correct 445 ms 24360 KB Output is correct
9 Correct 472 ms 22872 KB Output is correct
10 Correct 427 ms 21744 KB Output is correct
11 Correct 360 ms 20628 KB Output is correct
12 Correct 522 ms 36404 KB Output is correct
13 Correct 462 ms 28840 KB Output is correct
14 Correct 456 ms 28852 KB Output is correct
15 Correct 286 ms 21024 KB Output is correct
16 Correct 457 ms 33972 KB Output is correct
17 Correct 463 ms 30108 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5032 KB Output is correct
2 Correct 6 ms 5076 KB Output is correct
3 Correct 4 ms 5076 KB Output is correct
4 Correct 6 ms 5204 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5332 KB Output is correct
7 Correct 5 ms 5152 KB Output is correct
8 Correct 6 ms 5164 KB Output is correct
9 Correct 6 ms 5180 KB Output is correct
10 Correct 5 ms 5076 KB Output is correct
11 Correct 6 ms 5168 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 6 ms 5332 KB Output is correct
14 Correct 5 ms 5212 KB Output is correct
15 Correct 5 ms 5204 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 6 ms 5204 KB Output is correct
19 Correct 5 ms 5068 KB Output is correct
20 Correct 5 ms 5300 KB Output is correct
21 Correct 5 ms 5204 KB Output is correct
22 Correct 5 ms 5172 KB Output is correct
23 Correct 5 ms 5204 KB Output is correct
24 Correct 6 ms 5172 KB Output is correct
25 Correct 6 ms 5076 KB Output is correct
26 Correct 5 ms 5076 KB Output is correct
27 Correct 6 ms 5332 KB Output is correct
28 Correct 5 ms 5204 KB Output is correct
29 Correct 6 ms 5204 KB Output is correct
30 Correct 5 ms 5076 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 6 ms 5168 KB Output is correct
33 Correct 200 ms 13164 KB Output is correct
34 Correct 228 ms 24464 KB Output is correct
35 Correct 48 ms 8276 KB Output is correct
36 Correct 382 ms 19276 KB Output is correct
37 Correct 551 ms 38648 KB Output is correct
38 Correct 557 ms 28920 KB Output is correct
39 Correct 373 ms 19376 KB Output is correct
40 Correct 406 ms 21236 KB Output is correct
41 Correct 413 ms 20672 KB Output is correct
42 Correct 415 ms 20608 KB Output is correct
43 Correct 285 ms 20028 KB Output is correct
44 Correct 506 ms 31288 KB Output is correct
45 Correct 429 ms 28804 KB Output is correct
46 Correct 461 ms 28232 KB Output is correct
47 Correct 275 ms 19900 KB Output is correct
48 Correct 454 ms 32648 KB Output is correct
49 Correct 457 ms 29104 KB Output is correct
50 Correct 280 ms 17012 KB Output is correct
51 Correct 502 ms 38844 KB Output is correct
52 Correct 54 ms 8908 KB Output is correct
53 Correct 406 ms 20248 KB Output is correct
54 Correct 552 ms 40404 KB Output is correct
55 Correct 515 ms 30148 KB Output is correct
56 Correct 391 ms 20184 KB Output is correct
57 Correct 445 ms 24360 KB Output is correct
58 Correct 472 ms 22872 KB Output is correct
59 Correct 427 ms 21744 KB Output is correct
60 Correct 360 ms 20628 KB Output is correct
61 Correct 522 ms 36404 KB Output is correct
62 Correct 462 ms 28840 KB Output is correct
63 Correct 456 ms 28852 KB Output is correct
64 Correct 286 ms 21024 KB Output is correct
65 Correct 457 ms 33972 KB Output is correct
66 Correct 463 ms 30108 KB Output is correct
67 Correct 45 ms 7000 KB Output is correct
68 Correct 164 ms 20168 KB Output is correct
69 Correct 230 ms 20340 KB Output is correct
70 Correct 383 ms 19296 KB Output is correct
71 Correct 556 ms 38568 KB Output is correct
72 Correct 500 ms 28932 KB Output is correct
73 Correct 375 ms 19404 KB Output is correct
74 Correct 435 ms 23040 KB Output is correct
75 Correct 393 ms 21012 KB Output is correct
76 Correct 400 ms 20864 KB Output is correct
77 Correct 328 ms 19608 KB Output is correct
78 Correct 552 ms 33284 KB Output is correct
79 Correct 476 ms 31120 KB Output is correct
80 Correct 436 ms 27080 KB Output is correct
81 Correct 283 ms 19776 KB Output is correct
82 Correct 447 ms 32600 KB Output is correct
83 Correct 440 ms 29000 KB Output is correct
84 Correct 376 ms 19604 KB Output is correct
85 Correct 536 ms 39220 KB Output is correct
86 Correct 508 ms 29328 KB Output is correct
87 Correct 382 ms 19628 KB Output is correct
88 Correct 447 ms 23716 KB Output is correct
89 Correct 400 ms 21800 KB Output is correct
90 Correct 384 ms 21196 KB Output is correct
91 Correct 336 ms 20032 KB Output is correct
92 Correct 511 ms 38660 KB Output is correct
93 Correct 446 ms 26420 KB Output is correct
94 Correct 428 ms 24648 KB Output is correct
95 Correct 286 ms 20304 KB Output is correct
96 Correct 440 ms 33096 KB Output is correct
97 Correct 500 ms 29520 KB Output is correct
98 Correct 420 ms 20220 KB Output is correct
99 Correct 518 ms 39696 KB Output is correct
100 Correct 480 ms 29960 KB Output is correct
101 Correct 377 ms 20152 KB Output is correct
102 Correct 412 ms 23304 KB Output is correct
103 Correct 429 ms 21976 KB Output is correct
104 Correct 399 ms 21580 KB Output is correct
105 Correct 342 ms 20456 KB Output is correct
106 Correct 480 ms 31320 KB Output is correct
107 Correct 434 ms 31908 KB Output is correct
108 Correct 426 ms 26188 KB Output is correct
109 Correct 288 ms 20844 KB Output is correct
110 Correct 460 ms 33864 KB Output is correct
111 Correct 460 ms 30056 KB Output is correct