oj.uz

답안 #813710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813710 2023-08-08T02:23:08 Z 1075508020060209tc Cat in a tree (BOI17_catinatree) C++14
100 / 100
 347 ms 55624 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define X first
#define Y second
int n;
vector<int>e[200005];
int vis[200005];
int fa[25][200005];
int dis[25][200005];
int dph[200005];
int sbsz[200005];
int lvl[200005];
void dfssz(int nw,int pa){
sbsz[nw]=1;
for(int i=0;i<e[nw].size();i++){
    int v=e[nw][i];
    if(vis[v]||v==pa){continue;}
    dfssz(v,nw);
    sbsz[nw]+=sbsz[v];
}
}
int fincen(int nw,int pa,int tot){
for(int i=0;i<e[nw].size();i++){
    int v=e[nw][i];
    if(vis[v]||v==pa){continue;}
    int vl=fincen(v,nw,tot);
    if(vl){return vl;}
}
if(sbsz[nw]*2>=tot){
    return nw;
}return 0;
}
void dfsdph(int nw,int pa,int flv,int cfa){
dph[nw]=dph[pa]+1;
for(int i=0;i<e[nw].size();i++){
    int v=e[nw][i];
    if(v==pa||vis[v]){continue;}
    dfsdph(v,nw,flv,cfa);
}
dis[flv][nw]=dph[nw]-1;
fa[flv][nw]=cfa;
}

void decompose(int rt,int lv){
dfssz(rt,0);
int cen=fincen(rt,0,sbsz[rt]);
lvl[cen]=lv;
dfsdph(cen,0,lv,cen);
vis[cen]=1;
for(int i=0;i<e[cen].size();i++){
    int v=e[cen][i];
    if(vis[v]){continue;}
    decompose(v,lv+1);
}
}
int mnd[200005];
void upd(int v){
mnd[v]=0;
int nw=v;
for(int i=lvl[v]-1;i>=1;i--){
    nw=fa[i][v];
    int d=dis[i][v];
    mnd[nw]=min(mnd[nw],d);
}
}
int qry(int v){
int ret=mnd[v];
int nw=v;
for(int i=lvl[v]-1;i>=1;i--){
    nw=fa[i][v];
    int d=dis[i][v];
    ret=min(ret,d+mnd[nw]);
}
return ret;
}

int D;
signed main() {
cin>>n>>D;
for(int i=2;i<=n;i++){
    int a;int b;
    cin>>a;
    a++;b=i;
    e[a].push_back(b);
    e[b].push_back(a);
}
decompose(1,1);
for(int i=1;i<=n;i++){
    vis[i]=0;
}
dfsdph(1,0,0,0);
for(int i=1;i<=n;i++){
    mnd[i]=1e9;
}
vector<pair<int,int>>vc;
for(int i=1;i<=n;i++){
    vc.push_back({-dph[i],i});
}
sort(vc.begin(),vc.end());
int ans=0;
for(int i=0;i<vc.size();i++){
    int v=vc[i].second;
    if(qry(v)<D){continue;}
    ans++;
    upd(v);
}
cout<<ans<<endl;

}

Compilation message

catinatree.cpp: In function 'void dfssz(int, int)':
catinatree.cpp:18:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
catinatree.cpp: In function 'int fincen(int, int, int)':
catinatree.cpp:26:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
catinatree.cpp: In function 'void dfsdph(int, int, int, int)':
catinatree.cpp:38:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
catinatree.cpp: In function 'void decompose(int, int)':
catinatree.cpp:53:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 | for(int i=0;i<e[cen].size();i++){
      |             ~^~~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:104:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 | for(int i=0;i<vc.size();i++){
      |             ~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 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 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4980 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 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 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4980 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 3 ms 5460 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5128 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 3 ms 5204 KB Output is correct
28 Correct 3 ms 5332 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5204 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5332 KB Output is correct
37 Correct 4 ms 5332 KB Output is correct
38 Correct 4 ms 5332 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct
40 Correct 3 ms 5460 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 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 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4980 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 2 ms 5076 KB Output is correct
21 Correct 3 ms 5460 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 3 ms 5128 KB Output is correct
25 Correct 3 ms 5204 KB Output is correct
26 Correct 3 ms 5204 KB Output is correct
27 Correct 3 ms 5204 KB Output is correct
28 Correct 3 ms 5332 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5204 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5332 KB Output is correct
37 Correct 4 ms 5332 KB Output is correct
38 Correct 4 ms 5332 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct
40 Correct 3 ms 5460 KB Output is correct
41 Correct 106 ms 25248 KB Output is correct
42 Correct 124 ms 23648 KB Output is correct
43 Correct 128 ms 23524 KB Output is correct
44 Correct 125 ms 23584 KB Output is correct
45 Correct 134 ms 23552 KB Output is correct
46 Correct 330 ms 41792 KB Output is correct
47 Correct 332 ms 42736 KB Output is correct
48 Correct 347 ms 42804 KB Output is correct
49 Correct 346 ms 42352 KB Output is correct
50 Correct 79 ms 20824 KB Output is correct
51 Correct 76 ms 21452 KB Output is correct
52 Correct 69 ms 20892 KB Output is correct
53 Correct 204 ms 36316 KB Output is correct
54 Correct 208 ms 36340 KB Output is correct
55 Correct 202 ms 36352 KB Output is correct
56 Correct 5 ms 5664 KB Output is correct
57 Correct 19 ms 11000 KB Output is correct
58 Correct 102 ms 33096 KB Output is correct
59 Correct 327 ms 55624 KB Output is correct
60 Correct 98 ms 27256 KB Output is correct
61 Correct 152 ms 32884 KB Output is correct