oj.uz

Submission #72257

# Submission time Handle Problem Language Result Execution time Memory
72257 2018-08-26T06:28:01 Z nvmdava Dreaming (IOI13_dreaming) C++17
24 / 100
 213 ms 31920 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;

struct Path{
	int to, cost;
	Path(int _to, int _cost){
		to = _to;
		cost = _cost;
	}
};

struct Node{
	int p[20], d;
};
map<int, int> c[100001];
vector<Path> path[100001];
bool in[100001];
Node a[100001];
int mxdist, mxid;
int lol = 0;
void build(int v, int p){
	in[v] = 1;
	for(auto x : path[v]){
		if(x.to == p) continue;
		a[x.to].d = a[v].d + 1;
		memset(a[x.to].p, -1, sizeof(a[x.to].p));
		a[x.to].p[0] = v;
		for(int i = 1; i < 20; i++){
			int t = a[x.to].p[i - 1];
			if(t == -1) break;
			a[x.to].p[i] = a[t].p[i - 1];
		}
		build(x.to, v);
	}
}

int goUp(int v, int u){
	for(int i = 0; i < 20; i++){
		if(u & (1 << i)) v = a[v].p[i];
	}
	return v;
}

int lca(int v, int u){
	int l = 0;
	int r = min(a[v].d, a[u].d) + 1;
	int m;
	while(l + 1 != r){
		m = (l + r) >> 1;
		if(goUp(v, a[v].d - m) == goUp(u, a[u].d - m)) l = m;
		else r = m;
	}
	return goUp(v, a[v].d - l);
}

void dfs(int v, int p, int d){
	if(path[v].size() == 1 && p != -1){
		if(d > mxdist){
			mxdist = d;
			mxid = v;
		}
	}
	for(auto x : path[v]){
		if(x.to == p) continue;
		dfs(x.to, v, d + x.cost);
	}
}

int comp = 0;

int go(int v){
	if(path[v].size() == 0) return 0;
	if(in[v]) return 0;
	memset(a[v].p, -1, sizeof(a[v].p));
	comp++;
	a[v].d = 0;
	build(v, -1);
	
	mxdist = 0;
	mxid = v;
	dfs(v, -1, 0);
	mxdist = 0;
	v = mxid;
	dfs(v, -1, 0);
	int u = mxid;
	int o = lca(v, u);
	lol = max(lol, mxdist);
	int s = (mxdist + 1) >> 1;
	int q = 0;
	while(v != o){
		q += c[v][a[v].p[0]];
		if(q >= s){
			return min(q, mxdist - q + c[v][a[v].p[0]]);
		}
		v = a[v].p[0];
	}
	q = 0;
	while(u != o){
		q += c[u][a[u].p[0]];
		if(q >= s){
//			cout<<min(q, mxdist - q + c[u][a[u].p[0]])<<"\n";
			return min(q, mxdist - q + c[u][a[u].p[0]]);
		}
		u = a[u].p[0];
	}
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    
    for(int i = 0; i < M; i++){
    	path[A[i]].push_back(Path(B[i], T[i]));
    	path[B[i]].push_back(Path(A[i], T[i]));
    	c[A[i]][B[i]] = T[i];
    	c[B[i]][A[i]] = T[i];
	}
	int mx = 0;
	int mx2 = 0;
	int s;
	for(int i = 0; i < N; i++){
		s = go(i);
		if(s > mx){
			mx2 = mx;
			mx = s;
		} else if(s > mx2) mx2 = s;
	}
	if(comp == 1) return lol;
	return max(L + mx + mx2, lol);
}

Compilation message

dreaming.cpp: In function 'int go(int)':
dreaming.cpp:107:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 31736 KB Output is correct
2 Correct 198 ms 31736 KB Output is correct
3 Correct 92 ms 23288 KB Output is correct
4 Correct 21 ms 10880 KB Output is correct
5 Correct 17 ms 9856 KB Output is correct
6 Correct 39 ms 12664 KB Output is correct
7 Correct 8 ms 7424 KB Output is correct
8 Correct 76 ms 17272 KB Output is correct
9 Correct 82 ms 20216 KB Output is correct
10 Correct 8 ms 7552 KB Output is correct
11 Correct 149 ms 25064 KB Output is correct
12 Correct 209 ms 28232 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 31736 KB Output is correct
2 Correct 198 ms 31736 KB Output is correct
3 Correct 92 ms 23288 KB Output is correct
4 Correct 21 ms 10880 KB Output is correct
5 Correct 17 ms 9856 KB Output is correct
6 Correct 39 ms 12664 KB Output is correct
7 Correct 8 ms 7424 KB Output is correct
8 Correct 76 ms 17272 KB Output is correct
9 Correct 82 ms 20216 KB Output is correct
10 Correct 8 ms 7552 KB Output is correct
11 Correct 149 ms 25064 KB Output is correct
12 Correct 209 ms 28232 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 7 ms 7424 KB Output is correct
16 Correct 7 ms 7424 KB Output is correct
17 Correct 7 ms 7424 KB Output is correct
18 Correct 7 ms 7424 KB Output is correct
19 Correct 7 ms 7424 KB Output is correct
20 Correct 7 ms 7424 KB Output is correct
21 Correct 8 ms 7424 KB Output is correct
22 Correct 7 ms 7424 KB Output is correct
23 Correct 8 ms 7444 KB Output is correct
24 Correct 7 ms 7424 KB Output is correct
25 Correct 7 ms 7424 KB Output is correct
26 Correct 7 ms 7424 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 7 ms 7296 KB Output is correct
29 Correct 7 ms 7424 KB Output is correct
30 Correct 8 ms 7424 KB Output is correct
31 Correct 8 ms 7424 KB Output is correct
32 Correct 7 ms 7424 KB Output is correct
33 Correct 7 ms 7424 KB Output is correct
34 Correct 7 ms 7424 KB Output is correct
35 Correct 7 ms 7424 KB Output is correct
36 Correct 8 ms 7428 KB Output is correct
37 Correct 7 ms 7424 KB Output is correct
38 Correct 8 ms 7424 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 31736 KB Output is correct
2 Correct 198 ms 31736 KB Output is correct
3 Correct 92 ms 23288 KB Output is correct
4 Correct 21 ms 10880 KB Output is correct
5 Correct 17 ms 9856 KB Output is correct
6 Correct 39 ms 12664 KB Output is correct
7 Correct 8 ms 7424 KB Output is correct
8 Correct 76 ms 17272 KB Output is correct
9 Correct 82 ms 20216 KB Output is correct
10 Correct 8 ms 7552 KB Output is correct
11 Correct 149 ms 25064 KB Output is correct
12 Correct 209 ms 28232 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 7 ms 7424 KB Output is correct
16 Correct 7 ms 7424 KB Output is correct
17 Correct 7 ms 7424 KB Output is correct
18 Correct 7 ms 7424 KB Output is correct
19 Correct 7 ms 7424 KB Output is correct
20 Correct 7 ms 7424 KB Output is correct
21 Correct 8 ms 7424 KB Output is correct
22 Correct 7 ms 7424 KB Output is correct
23 Correct 8 ms 7444 KB Output is correct
24 Correct 7 ms 7424 KB Output is correct
25 Correct 7 ms 7424 KB Output is correct
26 Correct 7 ms 7424 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 7 ms 7296 KB Output is correct
29 Correct 7 ms 7424 KB Output is correct
30 Correct 8 ms 7424 KB Output is correct
31 Correct 8 ms 7424 KB Output is correct
32 Correct 7 ms 7424 KB Output is correct
33 Correct 7 ms 7424 KB Output is correct
34 Correct 7 ms 7424 KB Output is correct
35 Correct 7 ms 7424 KB Output is correct
36 Correct 8 ms 7428 KB Output is correct
37 Correct 7 ms 7424 KB Output is correct
38 Correct 8 ms 7424 KB Output is correct
39 Correct 171 ms 31920 KB Output is correct
40 Correct 156 ms 31736 KB Output is correct
41 Correct 102 ms 23284 KB Output is correct
42 Correct 21 ms 11028 KB Output is correct
43 Correct 7 ms 7424 KB Output is correct
44 Correct 7 ms 7424 KB Output is correct
45 Correct 8 ms 7416 KB Output is correct
46 Correct 7 ms 7424 KB Output is correct
47 Correct 7 ms 7424 KB Output is correct
48 Correct 7 ms 7424 KB Output is correct
49 Correct 7 ms 7424 KB Output is correct
50 Correct 7 ms 7424 KB Output is correct
51 Correct 7 ms 7424 KB Output is correct
52 Correct 7 ms 7424 KB Output is correct
53 Correct 8 ms 7424 KB Output is correct
54 Correct 7 ms 7424 KB Output is correct
55 Correct 8 ms 7552 KB Output is correct
56 Correct 7 ms 7424 KB Output is correct
57 Correct 194 ms 30228 KB Output is correct
58 Correct 193 ms 30200 KB Output is correct
59 Correct 208 ms 30328 KB Output is correct
60 Correct 196 ms 30200 KB Output is correct
61 Correct 199 ms 30072 KB Output is correct
62 Correct 213 ms 30072 KB Output is correct
63 Correct 203 ms 29944 KB Output is correct
64 Incorrect 206 ms 30076 KB Output isn't correct
65 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 20344 KB Output is correct
2 Incorrect 61 ms 20472 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 31736 KB Output is correct
2 Correct 198 ms 31736 KB Output is correct
3 Correct 92 ms 23288 KB Output is correct
4 Correct 21 ms 10880 KB Output is correct
5 Correct 17 ms 9856 KB Output is correct
6 Correct 39 ms 12664 KB Output is correct
7 Correct 8 ms 7424 KB Output is correct
8 Correct 76 ms 17272 KB Output is correct
9 Correct 82 ms 20216 KB Output is correct
10 Correct 8 ms 7552 KB Output is correct
11 Correct 149 ms 25064 KB Output is correct
12 Correct 209 ms 28232 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7552 KB Output is correct
15 Correct 8 ms 7808 KB Output is correct
16 Correct 9 ms 7936 KB Output is correct
17 Correct 8 ms 7552 KB Output is correct
18 Correct 9 ms 7808 KB Output is correct
19 Correct 9 ms 8064 KB Output is correct
20 Incorrect 8 ms 7552 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 31736 KB Output is correct
2 Correct 198 ms 31736 KB Output is correct
3 Correct 92 ms 23288 KB Output is correct
4 Correct 21 ms 10880 KB Output is correct
5 Correct 17 ms 9856 KB Output is correct
6 Correct 39 ms 12664 KB Output is correct
7 Correct 8 ms 7424 KB Output is correct
8 Correct 76 ms 17272 KB Output is correct
9 Correct 82 ms 20216 KB Output is correct
10 Correct 8 ms 7552 KB Output is correct
11 Correct 149 ms 25064 KB Output is correct
12 Correct 209 ms 28232 KB Output is correct
13 Correct 10 ms 7552 KB Output is correct
14 Correct 8 ms 7424 KB Output is correct
15 Correct 7 ms 7424 KB Output is correct
16 Correct 7 ms 7424 KB Output is correct
17 Correct 7 ms 7424 KB Output is correct
18 Correct 7 ms 7424 KB Output is correct
19 Correct 7 ms 7424 KB Output is correct
20 Correct 7 ms 7424 KB Output is correct
21 Correct 8 ms 7424 KB Output is correct
22 Correct 7 ms 7424 KB Output is correct
23 Correct 8 ms 7444 KB Output is correct
24 Correct 7 ms 7424 KB Output is correct
25 Correct 7 ms 7424 KB Output is correct
26 Correct 7 ms 7424 KB Output is correct
27 Correct 8 ms 7424 KB Output is correct
28 Correct 7 ms 7296 KB Output is correct
29 Correct 7 ms 7424 KB Output is correct
30 Correct 8 ms 7424 KB Output is correct
31 Correct 8 ms 7424 KB Output is correct
32 Correct 7 ms 7424 KB Output is correct
33 Correct 7 ms 7424 KB Output is correct
34 Correct 7 ms 7424 KB Output is correct
35 Correct 7 ms 7424 KB Output is correct
36 Correct 8 ms 7428 KB Output is correct
37 Correct 7 ms 7424 KB Output is correct
38 Correct 8 ms 7424 KB Output is correct
39 Correct 171 ms 31920 KB Output is correct
40 Correct 156 ms 31736 KB Output is correct
41 Correct 102 ms 23284 KB Output is correct
42 Correct 21 ms 11028 KB Output is correct
43 Correct 7 ms 7424 KB Output is correct
44 Correct 7 ms 7424 KB Output is correct
45 Correct 8 ms 7416 KB Output is correct
46 Correct 7 ms 7424 KB Output is correct
47 Correct 7 ms 7424 KB Output is correct
48 Correct 7 ms 7424 KB Output is correct
49 Correct 7 ms 7424 KB Output is correct
50 Correct 7 ms 7424 KB Output is correct
51 Correct 7 ms 7424 KB Output is correct
52 Correct 7 ms 7424 KB Output is correct
53 Correct 8 ms 7424 KB Output is correct
54 Correct 7 ms 7424 KB Output is correct
55 Correct 8 ms 7552 KB Output is correct
56 Correct 7 ms 7424 KB Output is correct
57 Correct 194 ms 30228 KB Output is correct
58 Correct 193 ms 30200 KB Output is correct
59 Correct 208 ms 30328 KB Output is correct
60 Correct 196 ms 30200 KB Output is correct
61 Correct 199 ms 30072 KB Output is correct
62 Correct 213 ms 30072 KB Output is correct
63 Correct 203 ms 29944 KB Output is correct
64 Incorrect 206 ms 30076 KB Output isn't correct
65 Halted 0 ms 0 KB -