Submission #96748

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
96748	2019-02-11T17:21:11 Z	figter001	Dreaming (IOI13_dreaming)	C++14	14 / 100	77 ms	10236 KB

dreaming

#include "dreaming.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int maxn = 1e5;

vector<pair<int,int>> g[maxn];
vector<int> C;
int mx,to,cst[maxn],t,best,mn,vis[maxn],c;

void path(int u,int cost){
	vis[u] = c;
	if(cost > mx){
		mx = cost;
		to = u;
	}
	for(pair<int,int> cur : g[u]){
		int v = cur.first;
		int w = cur.second;
		if(vis[v] == c)continue;
		path(v,cost + w);
	}
}

void dfs(int u,int cost){
	vis[u] = c;
	if(t == 1){
		cst[u] = max(cst[u],cost);
		if(cst[u] < mn){
			mn = cst[u];
			best = u;
		}
	}else cst[u] = cost;
	for(pair<int,int> cur : g[u]){
		int v = cur.first;
		int w = cur.second;
		if(vis[v] == c)continue;
		dfs(v,cost + w);
	}	
}

void find(int s){
	mn = 2e9;
	mx = 0;
	c++;
	path(s,0);
	int a = to;
	c++;
	mx = 0;
	path(a,0);
	int b = to;
	t = 0;
	c++;
	dfs(a,0);
	t = 1;
	c++;
	dfs(b,0);
	C.push_back(best);
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	for(int i=0;i<M;i++){
		g[A[i]].push_back({B[i],T[i]});
		g[B[i]].push_back({A[i],T[i]});
	}
	for(int i=0;i<N;i++)
		if(!vis[i])
			find(i);
	for(int i=1;i<C.size();i++){
		g[C[i]].push_back({C[0],L});
		g[C[0]].push_back({C[i],L});
	}
	c++;
	mx = 0;
	path(0,0);
	c++;
	mx = 0;
	path(to,0);
    return mx;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:71:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<C.size();i++){
              ~^~~~~~~~~

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	10104 KB	Output is correct
2	Correct	75 ms	10236 KB	Output is correct
3	Correct	43 ms	7544 KB	Output is correct
4	Correct	12 ms	3712 KB	Output is correct
5	Correct	11 ms	3328 KB	Output is correct
6	Correct	20 ms	4352 KB	Output is correct
7	Correct	3 ms	2688 KB	Output is correct
8	Correct	38 ms	5404 KB	Output is correct
9	Correct	45 ms	6400 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	66 ms	7672 KB	Output is correct
12	Correct	77 ms	9000 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	10104 KB	Output is correct
2	Correct	75 ms	10236 KB	Output is correct
3	Correct	43 ms	7544 KB	Output is correct
4	Correct	12 ms	3712 KB	Output is correct
5	Correct	11 ms	3328 KB	Output is correct
6	Correct	20 ms	4352 KB	Output is correct
7	Correct	3 ms	2688 KB	Output is correct
8	Correct	38 ms	5404 KB	Output is correct
9	Correct	45 ms	6400 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	66 ms	7672 KB	Output is correct
12	Correct	77 ms	9000 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct
14	Correct	4 ms	2688 KB	Output is correct
15	Correct	3 ms	2688 KB	Output is correct
16	Correct	4 ms	2688 KB	Output is correct
17	Correct	3 ms	2688 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	4 ms	2688 KB	Output is correct
20	Correct	4 ms	2688 KB	Output is correct
21	Correct	4 ms	2688 KB	Output is correct
22	Correct	4 ms	2688 KB	Output is correct
23	Correct	4 ms	2688 KB	Output is correct
24	Correct	4 ms	2700 KB	Output is correct
25	Correct	3 ms	2688 KB	Output is correct
26	Correct	4 ms	2688 KB	Output is correct
27	Correct	4 ms	2748 KB	Output is correct
28	Incorrect	3 ms	2688 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	10104 KB	Output is correct
2	Correct	75 ms	10236 KB	Output is correct
3	Correct	43 ms	7544 KB	Output is correct
4	Correct	12 ms	3712 KB	Output is correct
5	Correct	11 ms	3328 KB	Output is correct
6	Correct	20 ms	4352 KB	Output is correct
7	Correct	3 ms	2688 KB	Output is correct
8	Correct	38 ms	5404 KB	Output is correct
9	Correct	45 ms	6400 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	66 ms	7672 KB	Output is correct
12	Correct	77 ms	9000 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct
14	Correct	4 ms	2688 KB	Output is correct
15	Correct	3 ms	2688 KB	Output is correct
16	Correct	4 ms	2688 KB	Output is correct
17	Correct	3 ms	2688 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	4 ms	2688 KB	Output is correct
20	Correct	4 ms	2688 KB	Output is correct
21	Correct	4 ms	2688 KB	Output is correct
22	Correct	4 ms	2688 KB	Output is correct
23	Correct	4 ms	2688 KB	Output is correct
24	Correct	4 ms	2700 KB	Output is correct
25	Correct	3 ms	2688 KB	Output is correct
26	Correct	4 ms	2688 KB	Output is correct
27	Correct	4 ms	2748 KB	Output is correct
28	Incorrect	3 ms	2688 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	10104 KB	Output is correct
2	Correct	75 ms	10236 KB	Output is correct
3	Correct	43 ms	7544 KB	Output is correct
4	Correct	12 ms	3712 KB	Output is correct
5	Correct	11 ms	3328 KB	Output is correct
6	Correct	20 ms	4352 KB	Output is correct
7	Correct	3 ms	2688 KB	Output is correct
8	Correct	38 ms	5404 KB	Output is correct
9	Correct	45 ms	6400 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	66 ms	7672 KB	Output is correct
12	Correct	77 ms	9000 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct
14	Correct	4 ms	2816 KB	Output is correct
15	Correct	4 ms	2816 KB	Output is correct
16	Correct	4 ms	2816 KB	Output is correct
17	Incorrect	4 ms	2688 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #6
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	63 ms	10104 KB	Output is correct
2	Correct	75 ms	10236 KB	Output is correct
3	Correct	43 ms	7544 KB	Output is correct
4	Correct	12 ms	3712 KB	Output is correct
5	Correct	11 ms	3328 KB	Output is correct
6	Correct	20 ms	4352 KB	Output is correct
7	Correct	3 ms	2688 KB	Output is correct
8	Correct	38 ms	5404 KB	Output is correct
9	Correct	45 ms	6400 KB	Output is correct
10	Correct	4 ms	2688 KB	Output is correct
11	Correct	66 ms	7672 KB	Output is correct
12	Correct	77 ms	9000 KB	Output is correct
13	Correct	4 ms	2688 KB	Output is correct
14	Correct	4 ms	2688 KB	Output is correct
15	Correct	3 ms	2688 KB	Output is correct
16	Correct	4 ms	2688 KB	Output is correct
17	Correct	3 ms	2688 KB	Output is correct
18	Correct	4 ms	2688 KB	Output is correct
19	Correct	4 ms	2688 KB	Output is correct
20	Correct	4 ms	2688 KB	Output is correct
21	Correct	4 ms	2688 KB	Output is correct
22	Correct	4 ms	2688 KB	Output is correct
23	Correct	4 ms	2688 KB	Output is correct
24	Correct	4 ms	2700 KB	Output is correct
25	Correct	3 ms	2688 KB	Output is correct
26	Correct	4 ms	2688 KB	Output is correct
27	Correct	4 ms	2748 KB	Output is correct
28	Incorrect	3 ms	2688 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Submission #96748

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 0 / 10.0

Subtask #3 0 / 23.0

Subtask #4 0 / 18.0

Subtask #5 0 / 12.0

Subtask #6 0 / 23.0

Subtask #1
14.0 / 14.0

Subtask #2
0 / 10.0

Subtask #3
0 / 23.0

Subtask #4
0 / 18.0

Subtask #5
0 / 12.0

Subtask #6
0 / 23.0