oj.uz

Submission #84008

# Submission time Handle Problem Language Result Execution time Memory
84008 2018-11-12T10:27:33 Z Linst90 Triumphal arch (POI13_luk) C++11
0 / 100
 284 ms 18652 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
using namespace::std;
int delay[300005]={0};
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[v[i][a]]&&v[i][a]!=1){
            DFS(v[i][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]<<' '<<delay[i]<<'\n';
        maxn=max(maxn,(int)(v[i].end()-v[i].begin()-delay[i]));
    }
    cout<<maxn<<'\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1092 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 6476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 185 ms 12652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 269 ms 18652 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 284 ms 18652 KB Output isn't correct
2 Halted 0 ms 0 KB -