답안 #93151 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
93151	2019-01-06T15:32:15 Z	Vardanyan	Hard route (IZhO17_road)	C++14	19 / 100	2000 ms	47512 KB

road

#include <bits/stdc++.h>
using namespace std;
const int N = 500*1000+5;
vector<int> g[N];
int dist[N];
int par[N];
void dfs(int v,int p = -1){
    par[v] = p;
    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);
    }
}
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);
   }
    for(int i = 0;i<g[v].size();i++){
        int to = g[v][i];
        if(to == p) continue;
        int h = -1;
        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(par,0,sizeof par);
            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:9: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:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<g[v].size();i++){
                   ~^~~~~~~~~~~~
road.cpp:33:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j = 0;j<g[v].size();j++){
                           ~^~~~~~~~~~~~

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	15992 KB	Output is correct
2	Correct	15 ms	15992 KB	Output is correct
3	Correct	16 ms	15988 KB	Output is correct
4	Correct	15 ms	15992 KB	Output is correct
5	Correct	15 ms	15992 KB	Output is correct
6	Correct	16 ms	16024 KB	Output is correct
7	Correct	20 ms	15992 KB	Output is correct
8	Correct	19 ms	15992 KB	Output is correct
9	Correct	20 ms	15992 KB	Output is correct
10	Correct	20 ms	15992 KB	Output is correct
11	Correct	25 ms	16052 KB	Output is correct
12	Correct	25 ms	15992 KB	Output is correct
13	Correct	26 ms	15992 KB	Output is correct
14	Correct	24 ms	15992 KB	Output is correct
15	Correct	16 ms	15992 KB	Output is correct
16	Correct	17 ms	16020 KB	Output is correct
17	Correct	16 ms	15992 KB	Output is correct
18	Correct	14 ms	15992 KB	Output is correct
19	Correct	15 ms	15992 KB	Output is correct
20	Correct	15 ms	15992 KB	Output is correct
21	Correct	15 ms	15992 KB	Output is correct
22	Correct	16 ms	15992 KB	Output is correct
23	Correct	17 ms	15996 KB	Output is correct
24	Correct	37 ms	15992 KB	Output is correct

Subtask #2
0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	15992 KB	Output is correct
2	Correct	15 ms	15992 KB	Output is correct
3	Correct	16 ms	15988 KB	Output is correct
4	Correct	15 ms	15992 KB	Output is correct
5	Correct	15 ms	15992 KB	Output is correct
6	Correct	16 ms	16024 KB	Output is correct
7	Correct	20 ms	15992 KB	Output is correct
8	Correct	19 ms	15992 KB	Output is correct
9	Correct	20 ms	15992 KB	Output is correct
10	Correct	20 ms	15992 KB	Output is correct
11	Correct	25 ms	16052 KB	Output is correct
12	Correct	25 ms	15992 KB	Output is correct
13	Correct	26 ms	15992 KB	Output is correct
14	Correct	24 ms	15992 KB	Output is correct
15	Correct	16 ms	15992 KB	Output is correct
16	Correct	17 ms	16020 KB	Output is correct
17	Correct	16 ms	15992 KB	Output is correct
18	Correct	14 ms	15992 KB	Output is correct
19	Correct	15 ms	15992 KB	Output is correct
20	Correct	15 ms	15992 KB	Output is correct
21	Correct	15 ms	15992 KB	Output is correct
22	Correct	16 ms	15992 KB	Output is correct
23	Correct	17 ms	15996 KB	Output is correct
24	Correct	37 ms	15992 KB	Output is correct
25	Correct	557 ms	16504 KB	Output is correct
26	Correct	559 ms	16504 KB	Output is correct
27	Correct	566 ms	16440 KB	Output is correct
28	Correct	545 ms	16376 KB	Output is correct
29	Execution timed out	2035 ms	47512 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #3
0 / 48.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	15992 KB	Output is correct
2	Correct	15 ms	15992 KB	Output is correct
3	Correct	16 ms	15988 KB	Output is correct
4	Correct	15 ms	15992 KB	Output is correct
5	Correct	15 ms	15992 KB	Output is correct
6	Correct	16 ms	16024 KB	Output is correct
7	Correct	20 ms	15992 KB	Output is correct
8	Correct	19 ms	15992 KB	Output is correct
9	Correct	20 ms	15992 KB	Output is correct
10	Correct	20 ms	15992 KB	Output is correct
11	Correct	25 ms	16052 KB	Output is correct
12	Correct	25 ms	15992 KB	Output is correct
13	Correct	26 ms	15992 KB	Output is correct
14	Correct	24 ms	15992 KB	Output is correct
15	Correct	16 ms	15992 KB	Output is correct
16	Correct	17 ms	16020 KB	Output is correct
17	Correct	16 ms	15992 KB	Output is correct
18	Correct	14 ms	15992 KB	Output is correct
19	Correct	15 ms	15992 KB	Output is correct
20	Correct	15 ms	15992 KB	Output is correct
21	Correct	15 ms	15992 KB	Output is correct
22	Correct	16 ms	15992 KB	Output is correct
23	Correct	17 ms	15996 KB	Output is correct
24	Correct	37 ms	15992 KB	Output is correct
25	Correct	557 ms	16504 KB	Output is correct
26	Correct	559 ms	16504 KB	Output is correct
27	Correct	566 ms	16440 KB	Output is correct
28	Correct	545 ms	16376 KB	Output is correct
29	Execution timed out	2035 ms	47512 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

답안 #93151

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 0 / 33.0

Subtask #3 0 / 48.0

Subtask #1
19.0 / 19.0

Subtask #2
0 / 33.0

Subtask #3
0 / 48.0