oj.uz

Submission #914912

# Submission time Handle Problem Language Result Execution time Memory
914912 2024-01-22T21:04:26 Z alexander707070 Meetings 2 (JOI21_meetings2) C++14
100 / 100
 602 ms 190544 KB 
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;

struct dude{
    int h,l;
};

int n,a,b,sz[MAXN],root,parent[MAXN],pt[MAXN],ans[MAXN];
int dist[MAXN],maxs,dep[MAXN],from,to,diameter,curr;
vector<int> v[MAXN];
vector<int> rem[MAXN],s;
bool used[MAXN],in[MAXN];

queue<int> q[MAXN];

void dfs(int x,int p,int d){
    sz[x]=1; parent[x]=p; dep[x]=d;

    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p)continue;
        dfs(v[x][i],x,d+1);
        sz[x]+=sz[v[x][i]];
    }
}

int dp[MAXN][20];
bool li[MAXN][20];

int ff(int x,int p){
    if(p==0)return parent[x];
    if(x==0)return 0;

    if(li[x][p])return dp[x][p];
    li[x][p]=true;

    dp[x][p]=ff(ff(x,p-1),p-1);
    return dp[x][p];
}

int getdist(int x,int y){
    int res=0;

    if(dep[x]<dep[y])swap(x,y);

    for(int i=19;i>=0;i--){
        if((1<<i)<=dep[x]-dep[y]){
            x=ff(x,i);
            res+=(1<<i);
        }
    }

    for(int i=19;i>=0;i--){
        if(ff(x,i)!=0 and ff(y,i)!=0 and ff(x,i)!=ff(y,i)){
            res+=2*(1<<i);
            x=ff(x,i); y=ff(y,i);
        }
    }

    if(x!=y)res+=2;

    return res;
}

int centroid(int x,int p){
    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p)continue;
        if(sz[v[x][i]]>n/2){
            return centroid(v[x][i],x);
        }
    }

    return x;
}

void dfs1(int x,int p,int d){
    diameter=max(diameter,d);

    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p or !in[v[x][i]])continue;
        dfs1(v[x][i],x,d+1);
    }
}

void add(int x){
    in[x]=true;

    if(from==0){
        from=to=x;
        diameter=0;
        return;
    }

    for(int i=0;i<v[x].size();i++){
        if(in[v[x][i]]){

            curr=getdist(x,from);
            if(curr>diameter){
                diameter=curr;
                to=x;
            }

            curr=getdist(x,to);
            if(curr>diameter){
                diameter=curr;
                from=x;
            }
        }
    }
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n;
    for(int i=1;i<=n-1;i++){
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }

    dfs(1,0,0);
    root=centroid(1,0);
    dfs(root,0,0);

    for(int i=1;i<=n;i++){
        pt[i]=i; 
        if(v[i].size()==1){
            q[1].push(i);
        }
    }

    for(int k=1;k<=n/2;k++){
        while(!q[k-1].empty()){
            curr=q[k-1].front();

            if(used[curr]){
                q[k-1].pop();
                continue;
            }

            rem[k].push_back(curr);
            used[curr]=true;

            q[sz[parent[curr]]].push(parent[curr]);

            q[k-1].pop();
        }

        reverse(rem[k].begin(),rem[k].end());
    }

    add(root);
    for(int i=1;i<=n;i++){
        if(!used[i] and i!=root){
            add(i);
        }
    }

    for(int k=n/2;k>=1;k--){

        ans[2*k]=diameter+1;

        for(int f:rem[k]){
            add(f);
        }
    }

    for(int i=1;i<=n;i++){
        if(i%2==1)cout<<"1\n";
        else cout<<ans[i]<<"\n";
    }

    return 0;
}

Compilation message

meetings2.cpp: In function 'void dfs(int, int, int)':
meetings2.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
meetings2.cpp: In function 'int centroid(int, int)':
meetings2.cpp:66:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
meetings2.cpp: In function 'void dfs1(int, int, int)':
meetings2.cpp:79:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
meetings2.cpp: In function 'void add(int)':
meetings2.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=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 150096 KB Output is correct
2 Correct 75 ms 152144 KB Output is correct
3 Correct 77 ms 152144 KB Output is correct
4 Correct 74 ms 152256 KB Output is correct
5 Correct 76 ms 152144 KB Output is correct
6 Correct 76 ms 152280 KB Output is correct
7 Correct 76 ms 152148 KB Output is correct
8 Correct 77 ms 152220 KB Output is correct
9 Correct 77 ms 152148 KB Output is correct
10 Correct 77 ms 152144 KB Output is correct
11 Correct 79 ms 152144 KB Output is correct
12 Correct 75 ms 152144 KB Output is correct
13 Correct 77 ms 152148 KB Output is correct
14 Correct 74 ms 152148 KB Output is correct
15 Correct 76 ms 152012 KB Output is correct
16 Correct 77 ms 152260 KB Output is correct
17 Correct 75 ms 152400 KB Output is correct
18 Correct 75 ms 152144 KB Output is correct
19 Correct 77 ms 152148 KB Output is correct
20 Correct 80 ms 152148 KB Output is correct
21 Correct 76 ms 152152 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 150096 KB Output is correct
2 Correct 75 ms 152144 KB Output is correct
3 Correct 77 ms 152144 KB Output is correct
4 Correct 74 ms 152256 KB Output is correct
5 Correct 76 ms 152144 KB Output is correct
6 Correct 76 ms 152280 KB Output is correct
7 Correct 76 ms 152148 KB Output is correct
8 Correct 77 ms 152220 KB Output is correct
9 Correct 77 ms 152148 KB Output is correct
10 Correct 77 ms 152144 KB Output is correct
11 Correct 79 ms 152144 KB Output is correct
12 Correct 75 ms 152144 KB Output is correct
13 Correct 77 ms 152148 KB Output is correct
14 Correct 74 ms 152148 KB Output is correct
15 Correct 76 ms 152012 KB Output is correct
16 Correct 77 ms 152260 KB Output is correct
17 Correct 75 ms 152400 KB Output is correct
18 Correct 75 ms 152144 KB Output is correct
19 Correct 77 ms 152148 KB Output is correct
20 Correct 80 ms 152148 KB Output is correct
21 Correct 76 ms 152152 KB Output is correct
22 Correct 78 ms 152536 KB Output is correct
23 Correct 81 ms 152400 KB Output is correct
24 Correct 80 ms 152400 KB Output is correct
25 Correct 79 ms 152404 KB Output is correct
26 Correct 82 ms 152404 KB Output is correct
27 Correct 80 ms 152400 KB Output is correct
28 Correct 81 ms 152400 KB Output is correct
29 Correct 80 ms 152380 KB Output is correct
30 Correct 82 ms 152540 KB Output is correct
31 Correct 79 ms 152400 KB Output is correct
32 Correct 79 ms 152656 KB Output is correct
33 Correct 84 ms 152916 KB Output is correct
34 Correct 87 ms 152484 KB Output is correct
35 Correct 88 ms 152404 KB Output is correct
36 Correct 87 ms 152412 KB Output is correct
37 Correct 84 ms 152404 KB Output is correct
38 Correct 77 ms 152400 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 150096 KB Output is correct
2 Correct 75 ms 152144 KB Output is correct
3 Correct 77 ms 152144 KB Output is correct
4 Correct 74 ms 152256 KB Output is correct
5 Correct 76 ms 152144 KB Output is correct
6 Correct 76 ms 152280 KB Output is correct
7 Correct 76 ms 152148 KB Output is correct
8 Correct 77 ms 152220 KB Output is correct
9 Correct 77 ms 152148 KB Output is correct
10 Correct 77 ms 152144 KB Output is correct
11 Correct 79 ms 152144 KB Output is correct
12 Correct 75 ms 152144 KB Output is correct
13 Correct 77 ms 152148 KB Output is correct
14 Correct 74 ms 152148 KB Output is correct
15 Correct 76 ms 152012 KB Output is correct
16 Correct 77 ms 152260 KB Output is correct
17 Correct 75 ms 152400 KB Output is correct
18 Correct 75 ms 152144 KB Output is correct
19 Correct 77 ms 152148 KB Output is correct
20 Correct 80 ms 152148 KB Output is correct
21 Correct 76 ms 152152 KB Output is correct
22 Correct 78 ms 152536 KB Output is correct
23 Correct 81 ms 152400 KB Output is correct
24 Correct 80 ms 152400 KB Output is correct
25 Correct 79 ms 152404 KB Output is correct
26 Correct 82 ms 152404 KB Output is correct
27 Correct 80 ms 152400 KB Output is correct
28 Correct 81 ms 152400 KB Output is correct
29 Correct 80 ms 152380 KB Output is correct
30 Correct 82 ms 152540 KB Output is correct
31 Correct 79 ms 152400 KB Output is correct
32 Correct 79 ms 152656 KB Output is correct
33 Correct 84 ms 152916 KB Output is correct
34 Correct 87 ms 152484 KB Output is correct
35 Correct 88 ms 152404 KB Output is correct
36 Correct 87 ms 152412 KB Output is correct
37 Correct 84 ms 152404 KB Output is correct
38 Correct 77 ms 152400 KB Output is correct
39 Correct 308 ms 177856 KB Output is correct
40 Correct 309 ms 176924 KB Output is correct
41 Correct 337 ms 177100 KB Output is correct
42 Correct 311 ms 177520 KB Output is correct
43 Correct 312 ms 177108 KB Output is correct
44 Correct 314 ms 177360 KB Output is correct
45 Correct 602 ms 184916 KB Output is correct
46 Correct 437 ms 190544 KB Output is correct
47 Correct 229 ms 180300 KB Output is correct
48 Correct 206 ms 180588 KB Output is correct
49 Correct 363 ms 180428 KB Output is correct
50 Correct 210 ms 181232 KB Output is correct
51 Correct 330 ms 188768 KB Output is correct