Submission #93023

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
93023	2019-01-06T10:02:30 Z	davitmarg	Hard route (IZhO17_road)	C++17	19 / 100	2000 ms	142480 KB

road

/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <cassert>
#include <fstream>  
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

const int N = 5003;

int n,used[N][N],st;
vector<int> g[N];
pair<LL, LL> dp[N][N];
LL  best;
map<LL, int> u;
void dfsinit(int v)
{
	used[st][v] = 1;
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[st][to] == 1)
			continue;
		dfsinit(to);
		if (dp[st][to].first + 1 >= dp[st][v].first)
		{
			dp[st][v].second = dp[st][v].first;
			dp[st][v].first = dp[st][to].first + 1;
		}
		else if (dp[st][to].first + 1 >= dp[st][v].second)
			dp[st][v].second = dp[st][to].first + 1;
	}
}

void dfs(int v, LL d = 0, LL h = 0)
{
	used[st][v] = 2;
	if (g[v].size() == 1 && st!=v)
	{
		best = max(best, h*d);
		u[h*d]++;
	}
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[st][to]==2)
			continue;
		LL H;
		if (dp[st][to].first + 1 == dp[st][v].first)
			H = max(h,dp[st][v].second);
		else
			H = max(h, dp[st][v].first);
		dfs(to,d+1,H);
	}
}

int main()
{
	cin >> n;
	for (int i = 0; i < n-1; i++)
	{
		int a, b;
		//cin >> a >> b;
		scanf("%d%d",&a,&b);
		g[a].PB(b);
		g[b].PB(a);
	}
	for (st = 1; st <= n; st++)
		if(g[st].size()==1)
		{
			dfsinit(st);
			dfs(st);
		}
	cout << best << " " << u[best] / 2 << endl;
	return 0;
}

/*


*/

Compilation message

road.cpp: In function 'void dfsinit(int)':
road.cpp:38: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 dfs(int, long long int, long long int)':
road.cpp:62:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
road.cpp: In function 'int main()':
road.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&a,&b);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	476 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	708 KB	Output is correct
8	Correct	2 ms	760 KB	Output is correct
9	Correct	2 ms	760 KB	Output is correct
10	Correct	2 ms	760 KB	Output is correct
11	Correct	2 ms	1016 KB	Output is correct
12	Correct	3 ms	988 KB	Output is correct
13	Correct	3 ms	892 KB	Output is correct
14	Correct	3 ms	1016 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	476 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	476 KB	Output is correct
22	Correct	2 ms	504 KB	Output is correct
23	Correct	2 ms	632 KB	Output is correct
24	Correct	3 ms	1272 KB	Output is correct

Subtask #2
0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	476 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	708 KB	Output is correct
8	Correct	2 ms	760 KB	Output is correct
9	Correct	2 ms	760 KB	Output is correct
10	Correct	2 ms	760 KB	Output is correct
11	Correct	2 ms	1016 KB	Output is correct
12	Correct	3 ms	988 KB	Output is correct
13	Correct	3 ms	892 KB	Output is correct
14	Correct	3 ms	1016 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	476 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	476 KB	Output is correct
22	Correct	2 ms	504 KB	Output is correct
23	Correct	2 ms	632 KB	Output is correct
24	Correct	3 ms	1272 KB	Output is correct
25	Correct	513 ms	130504 KB	Output is correct
26	Correct	513 ms	129712 KB	Output is correct
27	Correct	524 ms	131080 KB	Output is correct
28	Correct	547 ms	130076 KB	Output is correct
29	Execution timed out	2061 ms	142480 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #3
0 / 48.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	504 KB	Output is correct
2	Correct	2 ms	476 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	2 ms	504 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	2 ms	708 KB	Output is correct
8	Correct	2 ms	760 KB	Output is correct
9	Correct	2 ms	760 KB	Output is correct
10	Correct	2 ms	760 KB	Output is correct
11	Correct	2 ms	1016 KB	Output is correct
12	Correct	3 ms	988 KB	Output is correct
13	Correct	3 ms	892 KB	Output is correct
14	Correct	3 ms	1016 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	504 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	2 ms	504 KB	Output is correct
19	Correct	2 ms	476 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	476 KB	Output is correct
22	Correct	2 ms	504 KB	Output is correct
23	Correct	2 ms	632 KB	Output is correct
24	Correct	3 ms	1272 KB	Output is correct
25	Correct	513 ms	130504 KB	Output is correct
26	Correct	513 ms	129712 KB	Output is correct
27	Correct	524 ms	131080 KB	Output is correct
28	Correct	547 ms	130076 KB	Output is correct
29	Execution timed out	2061 ms	142480 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Submission #93023

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