oj.uz

Submission #93154

# Submission time Handle Problem Language Result Execution time Memory
93154 2019-01-06T16:02:05 Z Vardanyan Hard route (IZhO17_road) C++14
19 / 100
 2000 ms 38920 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500*1000+5;
vector<int> g[N];
int dist[N];
void dfs(int v,int p = -1){
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        dfs(to,v);
        dist[v] = max(dist[v],dist[to]+1);
    }
}
unordered_map<long long,int> H;
long long mx = 0;
int n;
void calc(int v,int hard = 0,int d = 0,int p = -1){
    if((g[v].size() == 1 && d+1 == n)){
        hard = min(hard,dist[v]);
    }
   if(g[v].size() == 1 && p!=-1){
        long long now = (long long)hard*(long long)d;
        H[now]++;
        mx = max(mx,now);
   }
   int mx1,mx2;
   mx1 = mx2 = 0;
   for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        if(dist[to]+1>mx1){
            mx1 = dist[to]+1;
        }
        else if(dist[to]+1>mx2){
            mx2 = dist[to]+1;
        }
   }
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        int h = -1;
        if(dist[to]+1 == mx1) h = mx2;
        else h = mx1;/*
        if(dist[v]>hard){
            for(int j = 0;j<g[v].size();j++){
                int too = g[v][j];
                if(too!=to && too!=p){
                    if(h == -1 || dist[too]+1>h) h = dist[too]+1;
                }
            }
        }*/
        int hardd = hard;
        if(h!=-1){
            hardd = max(hardd,h);
        }
        calc(to,hardd,d+1,v);
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin>>n;
    for(int i = 1;i<=n-1;i++){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i = 1;i<=n;i++){
        if(g[i].size() == 1){
            memset(dist,0,sizeof dist);
            dfs(i);
            calc(i);
        }
    }
    //cout<<H[mx]<<endl;
    cout<<mx<<" "<<H[mx]/2<<endl;
	return 0;
}

Compilation message

road.cpp: In function 'void dfs(int, int)':
road.cpp:7:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<g[v].size();i++){
                   ~^~~~~~~~~~~~
road.cpp: In function 'void calc(int, int, int, int)':
road.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0;i<g[v].size();i++){
                  ~^~~~~~~~~~~~
road.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<g[v].size();i++){
                   ~^~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 12 ms 14072 KB Output is correct
3 Correct 12 ms 14072 KB Output is correct
4 Correct 11 ms 14072 KB Output is correct
5 Correct 11 ms 14072 KB Output is correct
6 Correct 12 ms 14072 KB Output is correct
7 Correct 14 ms 14072 KB Output is correct
8 Correct 13 ms 13964 KB Output is correct
9 Correct 14 ms 14072 KB Output is correct
10 Correct 14 ms 14072 KB Output is correct
11 Correct 19 ms 14072 KB Output is correct
12 Correct 19 ms 14072 KB Output is correct
13 Correct 16 ms 14072 KB Output is correct
14 Correct 16 ms 14072 KB Output is correct
15 Correct 14 ms 14072 KB Output is correct
16 Correct 14 ms 13992 KB Output is correct
17 Correct 15 ms 14072 KB Output is correct
18 Correct 14 ms 14072 KB Output is correct
19 Correct 11 ms 14072 KB Output is correct
20 Correct 12 ms 14072 KB Output is correct
21 Correct 12 ms 14072 KB Output is correct
22 Correct 12 ms 14072 KB Output is correct
23 Correct 15 ms 14072 KB Output is correct
24 Correct 21 ms 14072 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 12 ms 14072 KB Output is correct
3 Correct 12 ms 14072 KB Output is correct
4 Correct 11 ms 14072 KB Output is correct
5 Correct 11 ms 14072 KB Output is correct
6 Correct 12 ms 14072 KB Output is correct
7 Correct 14 ms 14072 KB Output is correct
8 Correct 13 ms 13964 KB Output is correct
9 Correct 14 ms 14072 KB Output is correct
10 Correct 14 ms 14072 KB Output is correct
11 Correct 19 ms 14072 KB Output is correct
12 Correct 19 ms 14072 KB Output is correct
13 Correct 16 ms 14072 KB Output is correct
14 Correct 16 ms 14072 KB Output is correct
15 Correct 14 ms 14072 KB Output is correct
16 Correct 14 ms 13992 KB Output is correct
17 Correct 15 ms 14072 KB Output is correct
18 Correct 14 ms 14072 KB Output is correct
19 Correct 11 ms 14072 KB Output is correct
20 Correct 12 ms 14072 KB Output is correct
21 Correct 12 ms 14072 KB Output is correct
22 Correct 12 ms 14072 KB Output is correct
23 Correct 15 ms 14072 KB Output is correct
24 Correct 21 ms 14072 KB Output is correct
25 Correct 438 ms 14520 KB Output is correct
26 Correct 428 ms 14456 KB Output is correct
27 Correct 423 ms 14460 KB Output is correct
28 Correct 432 ms 14584 KB Output is correct
29 Execution timed out 2055 ms 38920 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14072 KB Output is correct
2 Correct 12 ms 14072 KB Output is correct
3 Correct 12 ms 14072 KB Output is correct
4 Correct 11 ms 14072 KB Output is correct
5 Correct 11 ms 14072 KB Output is correct
6 Correct 12 ms 14072 KB Output is correct
7 Correct 14 ms 14072 KB Output is correct
8 Correct 13 ms 13964 KB Output is correct
9 Correct 14 ms 14072 KB Output is correct
10 Correct 14 ms 14072 KB Output is correct
11 Correct 19 ms 14072 KB Output is correct
12 Correct 19 ms 14072 KB Output is correct
13 Correct 16 ms 14072 KB Output is correct
14 Correct 16 ms 14072 KB Output is correct
15 Correct 14 ms 14072 KB Output is correct
16 Correct 14 ms 13992 KB Output is correct
17 Correct 15 ms 14072 KB Output is correct
18 Correct 14 ms 14072 KB Output is correct
19 Correct 11 ms 14072 KB Output is correct
20 Correct 12 ms 14072 KB Output is correct
21 Correct 12 ms 14072 KB Output is correct
22 Correct 12 ms 14072 KB Output is correct
23 Correct 15 ms 14072 KB Output is correct
24 Correct 21 ms 14072 KB Output is correct
25 Correct 438 ms 14520 KB Output is correct
26 Correct 428 ms 14456 KB Output is correct
27 Correct 423 ms 14460 KB Output is correct
28 Correct 432 ms 14584 KB Output is correct
29 Execution timed out 2055 ms 38920 KB Time limit exceeded
30 Halted 0 ms 0 KB -