Submission #96747

# Submission time Handle Problem Language Result Execution time Memory
96747 2019-02-11T17:06:56 Z figter001 Dreaming (IOI13_dreaming) C++14
14 / 100
115 ms 10616 KB
#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 idx[maxn];
vector<int> C;
int sz[maxn],mx,to,used[maxn],cst[maxn][2],t,best,mn,vis[maxn],c;

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

void find(int s){
	mn = 2e9;
	mx = 0;
	c++;
	path(s,0);
	t = 0;
	c++;
	dfs(to,0);
	c++;
	mx = 0;
	path(to,0);
	t = 1;
	c++;
	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});
	}
	c++;
	mx = 0;
	path(0,0);
	c++;
	mx = 0;
	path(to,0);
    return mx;
}

Compilation message

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~
dreaming.cpp: In function 'void path(int, int)':
dreaming.cpp:15:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  idx[u] = vis[u] = c;
           ~~~~~~~^~~
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++){
              ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 64 ms 10616 KB Output is correct
2 Correct 76 ms 10616 KB Output is correct
3 Correct 44 ms 7928 KB Output is correct
4 Correct 12 ms 3832 KB Output is correct
5 Correct 11 ms 3320 KB Output is correct
6 Correct 23 ms 4472 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 36 ms 5752 KB Output is correct
9 Correct 47 ms 6776 KB Output is correct
10 Correct 4 ms 2740 KB Output is correct
11 Correct 70 ms 8056 KB Output is correct
12 Correct 112 ms 9336 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2808 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 9 ms 2680 KB Output is correct
14 Correct 4 ms 2684 KB Output is correct
15 Incorrect 4 ms 2684 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 72 ms 10564 KB Output is correct
2 Correct 66 ms 10572 KB Output is correct
3 Correct 44 ms 7928 KB Output is correct
4 Correct 12 ms 3832 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2656 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 115 ms 9080 KB Output is correct
20 Correct 103 ms 9132 KB Output is correct
21 Correct 91 ms 8952 KB Output is correct
22 Correct 99 ms 9048 KB Output is correct
23 Correct 82 ms 8924 KB Output is correct
24 Correct 82 ms 8952 KB Output is correct
25 Correct 86 ms 8824 KB Output is correct
26 Incorrect 91 ms 8824 KB Output isn't correct
27 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 7408 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 5 ms 2936 KB Output is correct
4 Incorrect 4 ms 2808 KB Output isn't correct
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2808 KB Output is correct
2 Correct 5 ms 2808 KB Output is correct
3 Correct 5 ms 2936 KB Output is correct
4 Correct 61 ms 7756 KB Output is correct
5 Correct 62 ms 9080 KB Output is correct
6 Incorrect 4 ms 2808 KB Output isn't correct
7 Halted 0 ms 0 KB -