Submission #83998

#	Time	Username	Problem	Language	Result	Execution time	Memory
83998		Linst90	Triumphal arch (POI13_luk)	C++11	0 / 100	270 ms	17620 KiB

luk

#include<iostream>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
using namespace::std;
int delay[300005];
vector<vector<int>> v;

void DFS(int i,int d){
    //cout<<i<<'\n';
    delay[i]=d;
    for(int a=0;a<v[i].end()-v[i].begin();a++){
        //cout<<a<<'\n';
        if(delay[a]==-1){
            DFS(a,d+1);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("input.txt","r",stdin);
    int n;
    cin>>n;
    for(int i=0;i<n+1;i++){
        vector<int> t;
        v.push_back(t);
    }
    for(int i=0,l,r;i<n-1;i++){
        cin>>l>>r;
        //delay[i+1]=-1;
        v[l].push_back(r);
        v[r].push_back(l);
    }
    //delay[n]=-1;
    DFS(1,0);
    int maxn=0;
    for(int i=1;i<=n;i++){
        //cout<<i<<' '<<v[i].end()-v[i].begin()-delay[i]<<'\n';
        maxn=max(maxn,(int)(v[i].end()-v[i].begin()-delay[i])-1);
    }
    cout<<maxn<<'\n';
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10