답안 #96746 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96746	2019-02-11T16:57:27 Z	figter001	꿈 (IOI13_dreaming)	C++14	14 / 100	1000 ms	10488 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];
bool vis[maxn],idx[maxn];
vector<int> c;
int sz[maxn],mx,to,used[maxn],cst[maxn][2],t,best,mn;

void path(int u,int cost){
	idx[u] = vis[u] = 1;
	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])continue;
		path(v,cost + w);
	}
}

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

void find(int s){
	mn = 2e9;
	mx = 0;
	memset(vis,0,sizeof(vis));
	path(s,0);
	t = 0;
	memset(vis,0,sizeof(vis));
	dfs(to,0);
	memset(vis,0,sizeof(vis));
	mx = 0;
	path(to,0);
	t = 1;
	memset(vis,0,sizeof(vis));
	dfs(to,0);
	s = best;
	c.push_back(s);
}

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(!idx[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});
	}
	memset(vis,0,sizeof(vis));
	mx = 0;
	path(0,0);
	memset(vis,0,sizeof(vis));
	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

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	10488 KB	Output is correct
2	Correct	70 ms	10392 KB	Output is correct
3	Correct	43 ms	7808 KB	Output is correct
4	Correct	13 ms	3968 KB	Output is correct
5	Correct	11 ms	3428 KB	Output is correct
6	Correct	20 ms	4480 KB	Output is correct
7	Correct	4 ms	2816 KB	Output is correct
8	Correct	37 ms	5632 KB	Output is correct
9	Correct	44 ms	6648 KB	Output is correct
10	Correct	4 ms	2816 KB	Output is correct
11	Correct	63 ms	7932 KB	Output is correct
12	Correct	71 ms	9080 KB	Output is correct
13	Correct	4 ms	2944 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	10488 KB	Output is correct
2	Correct	70 ms	10392 KB	Output is correct
3	Correct	43 ms	7808 KB	Output is correct
4	Correct	13 ms	3968 KB	Output is correct
5	Correct	11 ms	3428 KB	Output is correct
6	Correct	20 ms	4480 KB	Output is correct
7	Correct	4 ms	2816 KB	Output is correct
8	Correct	37 ms	5632 KB	Output is correct
9	Correct	44 ms	6648 KB	Output is correct
10	Correct	4 ms	2816 KB	Output is correct
11	Correct	63 ms	7932 KB	Output is correct
12	Correct	71 ms	9080 KB	Output is correct
13	Correct	4 ms	2944 KB	Output is correct
14	Correct	5 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	Correct	4 ms	2816 KB	Output is correct
18	Correct	4 ms	2816 KB	Output is correct
19	Correct	4 ms	2816 KB	Output is correct
20	Correct	4 ms	2816 KB	Output is correct
21	Correct	4 ms	2816 KB	Output is correct
22	Correct	4 ms	2816 KB	Output is correct
23	Correct	4 ms	2816 KB	Output is correct
24	Correct	4 ms	2892 KB	Output is correct
25	Correct	4 ms	2816 KB	Output is correct
26	Correct	4 ms	2812 KB	Output is correct
27	Correct	4 ms	2816 KB	Output is correct
28	Incorrect	3 ms	2816 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #3
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	10488 KB	Output is correct
2	Correct	70 ms	10392 KB	Output is correct
3	Correct	43 ms	7808 KB	Output is correct
4	Correct	13 ms	3968 KB	Output is correct
5	Correct	11 ms	3428 KB	Output is correct
6	Correct	20 ms	4480 KB	Output is correct
7	Correct	4 ms	2816 KB	Output is correct
8	Correct	37 ms	5632 KB	Output is correct
9	Correct	44 ms	6648 KB	Output is correct
10	Correct	4 ms	2816 KB	Output is correct
11	Correct	63 ms	7932 KB	Output is correct
12	Correct	71 ms	9080 KB	Output is correct
13	Correct	4 ms	2944 KB	Output is correct
14	Correct	5 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	Correct	4 ms	2816 KB	Output is correct
18	Correct	4 ms	2816 KB	Output is correct
19	Correct	4 ms	2816 KB	Output is correct
20	Correct	4 ms	2816 KB	Output is correct
21	Correct	4 ms	2816 KB	Output is correct
22	Correct	4 ms	2816 KB	Output is correct
23	Correct	4 ms	2816 KB	Output is correct
24	Correct	4 ms	2892 KB	Output is correct
25	Correct	4 ms	2816 KB	Output is correct
26	Correct	4 ms	2812 KB	Output is correct
27	Correct	4 ms	2816 KB	Output is correct
28	Incorrect	3 ms	2816 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #4
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1082 ms	7328 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	10488 KB	Output is correct
2	Correct	70 ms	10392 KB	Output is correct
3	Correct	43 ms	7808 KB	Output is correct
4	Correct	13 ms	3968 KB	Output is correct
5	Correct	11 ms	3428 KB	Output is correct
6	Correct	20 ms	4480 KB	Output is correct
7	Correct	4 ms	2816 KB	Output is correct
8	Correct	37 ms	5632 KB	Output is correct
9	Correct	44 ms	6648 KB	Output is correct
10	Correct	4 ms	2816 KB	Output is correct
11	Correct	63 ms	7932 KB	Output is correct
12	Correct	71 ms	9080 KB	Output is correct
13	Correct	4 ms	2944 KB	Output is correct
14	Correct	7 ms	2816 KB	Output is correct
15	Correct	10 ms	2944 KB	Output is correct
16	Correct	14 ms	3008 KB	Output is correct
17	Incorrect	7 ms	2944 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #6
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	69 ms	10488 KB	Output is correct
2	Correct	70 ms	10392 KB	Output is correct
3	Correct	43 ms	7808 KB	Output is correct
4	Correct	13 ms	3968 KB	Output is correct
5	Correct	11 ms	3428 KB	Output is correct
6	Correct	20 ms	4480 KB	Output is correct
7	Correct	4 ms	2816 KB	Output is correct
8	Correct	37 ms	5632 KB	Output is correct
9	Correct	44 ms	6648 KB	Output is correct
10	Correct	4 ms	2816 KB	Output is correct
11	Correct	63 ms	7932 KB	Output is correct
12	Correct	71 ms	9080 KB	Output is correct
13	Correct	4 ms	2944 KB	Output is correct
14	Correct	5 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	Correct	4 ms	2816 KB	Output is correct
18	Correct	4 ms	2816 KB	Output is correct
19	Correct	4 ms	2816 KB	Output is correct
20	Correct	4 ms	2816 KB	Output is correct
21	Correct	4 ms	2816 KB	Output is correct
22	Correct	4 ms	2816 KB	Output is correct
23	Correct	4 ms	2816 KB	Output is correct
24	Correct	4 ms	2892 KB	Output is correct
25	Correct	4 ms	2816 KB	Output is correct
26	Correct	4 ms	2812 KB	Output is correct
27	Correct	4 ms	2816 KB	Output is correct
28	Incorrect	3 ms	2816 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

답안 #96746

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