oj.uz

Submission #376093

# Submission time Handle Problem Language Result Execution time Memory
376093 2021-03-10T23:36:43 Z SavicS Dreaming (IOI13_dreaming) C++14
47 / 100
 1000 ms 18748 KB 
#include"dreaming.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m, L;

vector<pii> g[maxn];

int pref[maxn];
int br = 0;
int d[maxn];
pii last[maxn];
int used[maxn];
int was[maxn];
int bfs(int s){
	queue<int> q;
	q.push(s);
	used[s] = br;
	while(!q.empty()){
		int v = q.front(); q.pop();
		for(auto c : g[v]){
			int u = c.fi;
			int w = c.se;
			if(!used[u]){
				used[u] = br;
				d[u] = d[v] + w;
				q.push(u);
			}
		}
	}
	int a = 0;
	int mx = 0;
	ff(i,1,n){
		if(used[i] != br)continue;
		if(d[i] > mx){
			mx = d[i];
			a = i;
		}
	}
	was[a] = br;
	d[a] = 0;
	q.push(a);
	while(!q.empty()){
		int v = q.front(); q.pop();
		for(auto c : g[v]){
			int u = c.fi;
			int w = c.se;
			if(!was[u]){
				was[u] = br;
				d[u] = d[v] + w;
				last[u] = {v, w}; 
				q.push(u);
			}
		}
	}
	int dia = 0;
	int b = 0;
	ff(i,1,n){
		if(was[i] != br)continue;
		if(d[i] > dia){
			dia = d[i];
			b = i;
		}
	}
	int x = b;
	vector<pii> put;
	while(x != a){
		pii z = last[x];
		put.pb(z);
		x = z.fi;
	}
	put.pb({b, 0});
	ff(i,0,sz(put) - 1){
		if(i == 0)pref[i] = put[i].se;
		else pref[i] = pref[i - 1] + put[i].se;
	}
//	for(auto c : put)cout << c.fi << " " << c.se << endl;
//	ff(i,0,sz(put) - 1)cout << pref[i] << " ";
//	cout << endl;
	int rez = inf;
	int ko = 0;
	ff(i,0,sz(put) - 1){
		int mx = max(pref[i], pref[sz(put) - 1] - pref[i]);
		if(mx < rez){
			rez = mx;
			ko = put[i].fi;
		}
	}
	if(ko == 0)ko = s;
	return ko;
}

int dia = 0;
int dfs(int v, int p, int duz){
	int best = duz;	
	for(auto c : g[v]){
		int u = c.fi;
		int w = c.se;
		if(u != p){
			int dist = dfs(u, v, duz + w);
			dia = max(dia, best + dist - 2 * duz);
			best = max(best, dist);
		}
	}
	return best;
}

int travelTime(int N, int M, int L1, int A[], int B[], int T[]){
	n = N;
	m = M;
	L = L1;
	ff(i,0,m - 1){
		int u = A[i] + 1;
		int v = B[i] + 1;
		int w = T[i];
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
	vector<int> vec;
	ff(i,1,n){
		if(!used[i]){
			br += 1;
			int x = bfs(i);
			vec.pb(x);
		}
	}
	ff(i,1,sz(vec) - 1){
		g[vec[0]].pb({vec[i], L});
		g[vec[i]].pb({vec[0], L});
	}
	dfs(1, -1, 0);
	return dia;
}
//int main()
//{
//   	ios::sync_with_stdio(false);
//   	cout.tie(nullptr);
//  	cin.tie(nullptr);
//	cin >> n >> m >> L;
//	ff(i,1,m){
//		int u, v, w;
//		cin >> u >> v >> w;
//		g[u].pb({v, w});
//		g[v].pb({u, w});
//	}
//   	return 0;
//}
/**

12 8 2
1 9 4
9 3 2
3 8 4
12 6 3
6 2 7
10 2 5
2 4 1
7 11 3

// probati bojenje sahovski ili slicno

**/

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 13976 KB Output is correct
2 Correct 61 ms 13724 KB Output is correct
3 Correct 41 ms 11792 KB Output is correct
4 Correct 10 ms 4480 KB Output is correct
5 Correct 8 ms 3820 KB Output is correct
6 Correct 15 ms 5332 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 33 ms 7340 KB Output is correct
9 Correct 40 ms 9900 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct
11 Correct 66 ms 11512 KB Output is correct
12 Correct 76 ms 12620 KB Output is correct
13 Correct 3 ms 2796 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 2 ms 2668 KB Output is correct
24 Correct 2 ms 2668 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 13976 KB Output is correct
2 Correct 61 ms 13724 KB Output is correct
3 Correct 41 ms 11792 KB Output is correct
4 Correct 10 ms 4480 KB Output is correct
5 Correct 8 ms 3820 KB Output is correct
6 Correct 15 ms 5332 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 33 ms 7340 KB Output is correct
9 Correct 40 ms 9900 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct
11 Correct 66 ms 11512 KB Output is correct
12 Correct 76 ms 12620 KB Output is correct
13 Correct 3 ms 2796 KB Output is correct
14 Correct 3 ms 2668 KB Output is correct
15 Correct 3 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2796 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 2 ms 2668 KB Output is correct
24 Correct 2 ms 2668 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 2 ms 2668 KB Output is correct
27 Correct 2 ms 2668 KB Output is correct
28 Correct 2 ms 2668 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2668 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 2 ms 2668 KB Output is correct
34 Correct 2 ms 2668 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 2 ms 2668 KB Output is correct
37 Correct 2 ms 2668 KB Output is correct
38 Correct 2 ms 2668 KB Output is correct
39 Correct 61 ms 14104 KB Output is correct
40 Correct 61 ms 14024 KB Output is correct
41 Correct 38 ms 11792 KB Output is correct
42 Correct 9 ms 4480 KB Output is correct
43 Correct 2 ms 2668 KB Output is correct
44 Correct 3 ms 2668 KB Output is correct
45 Correct 2 ms 2668 KB Output is correct
46 Correct 2 ms 2668 KB Output is correct
47 Correct 2 ms 2668 KB Output is correct
48 Correct 2 ms 2668 KB Output is correct
49 Correct 2 ms 2668 KB Output is correct
50 Correct 3 ms 2668 KB Output is correct
51 Correct 2 ms 2668 KB Output is correct
52 Correct 2 ms 2668 KB Output is correct
53 Correct 2 ms 2688 KB Output is correct
54 Correct 2 ms 2668 KB Output is correct
55 Correct 2 ms 2668 KB Output is correct
56 Correct 2 ms 2668 KB Output is correct
57 Correct 98 ms 11244 KB Output is correct
58 Correct 96 ms 11116 KB Output is correct
59 Correct 94 ms 11116 KB Output is correct
60 Correct 95 ms 11116 KB Output is correct
61 Correct 84 ms 11116 KB Output is correct
62 Correct 87 ms 11116 KB Output is correct
63 Correct 83 ms 10860 KB Output is correct
64 Correct 80 ms 10860 KB Output is correct
65 Correct 87 ms 11116 KB Output is correct
66 Correct 83 ms 11116 KB Output is correct
67 Correct 93 ms 11116 KB Output is correct
68 Correct 93 ms 11116 KB Output is correct
69 Correct 96 ms 11372 KB Output is correct
70 Correct 95 ms 11372 KB Output is correct
71 Correct 2 ms 2668 KB Output is correct
72 Correct 4 ms 2924 KB Output is correct
73 Correct 4 ms 2924 KB Output is correct
74 Correct 4 ms 2924 KB Output is correct
75 Correct 4 ms 2924 KB Output is correct
76 Correct 4 ms 2924 KB Output is correct
77 Correct 4 ms 2924 KB Output is correct
78 Correct 4 ms 2924 KB Output is correct
79 Correct 4 ms 2924 KB Output is correct
80 Correct 116 ms 11116 KB Output is correct
81 Correct 106 ms 11032 KB Output is correct
82 Correct 87 ms 11116 KB Output is correct
83 Correct 89 ms 11244 KB Output is correct
84 Correct 3 ms 2924 KB Output is correct
85 Correct 3 ms 2924 KB Output is correct
86 Correct 3 ms 2924 KB Output is correct
87 Correct 3 ms 2924 KB Output is correct
88 Correct 3 ms 2924 KB Output is correct
89 Correct 4 ms 2944 KB Output is correct
90 Correct 3 ms 2924 KB Output is correct
91 Correct 4 ms 2924 KB Output is correct
92 Correct 4 ms 2924 KB Output is correct
93 Correct 4 ms 2924 KB Output is correct
94 Correct 2 ms 2668 KB Output is correct
95 Correct 2 ms 2668 KB Output is correct
96 Correct 2 ms 2668 KB Output is correct
97 Correct 2 ms 2668 KB Output is correct
98 Correct 2 ms 2668 KB Output is correct
99 Correct 2 ms 2668 KB Output is correct
100 Correct 2 ms 2668 KB Output is correct
101 Correct 2 ms 2668 KB Output is correct
102 Correct 2 ms 2668 KB Output is correct
103 Correct 2 ms 2668 KB Output is correct
104 Correct 8 ms 3820 KB Output is correct
105 Correct 15 ms 5332 KB Output is correct
106 Correct 2 ms 2668 KB Output is correct
107 Correct 28 ms 7340 KB Output is correct
108 Correct 39 ms 9900 KB Output is correct
109 Correct 3 ms 2796 KB Output is correct
110 Correct 64 ms 11384 KB Output is correct
111 Correct 75 ms 12620 KB Output is correct
112 Correct 3 ms 2924 KB Output is correct
113 Correct 111 ms 18748 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 6764 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2668 KB Output is correct
2 Correct 3 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 2 ms 2668 KB Output is correct
24 Correct 2 ms 2668 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 4 ms 2796 KB Output is correct
27 Correct 4 ms 2796 KB Output is correct
28 Correct 6 ms 2924 KB Output is correct
29 Incorrect 3 ms 2796 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 13976 KB Output is correct
2 Correct 61 ms 13724 KB Output is correct
3 Correct 41 ms 11792 KB Output is correct
4 Correct 10 ms 4480 KB Output is correct
5 Correct 8 ms 3820 KB Output is correct
6 Correct 15 ms 5332 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 33 ms 7340 KB Output is correct
9 Correct 40 ms 9900 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct
11 Correct 66 ms 11512 KB Output is correct
12 Correct 76 ms 12620 KB Output is correct
13 Correct 3 ms 2796 KB Output is correct
14 Correct 3 ms 2668 KB Output is correct
15 Correct 3 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2796 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 2 ms 2668 KB Output is correct
24 Correct 2 ms 2668 KB Output is correct
25 Correct 2 ms 2668 KB Output is correct
26 Correct 2 ms 2668 KB Output is correct
27 Correct 2 ms 2668 KB Output is correct
28 Correct 2 ms 2668 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2668 KB Output is correct
31 Correct 2 ms 2668 KB Output is correct
32 Correct 2 ms 2668 KB Output is correct
33 Correct 2 ms 2668 KB Output is correct
34 Correct 2 ms 2668 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 2 ms 2668 KB Output is correct
37 Correct 2 ms 2668 KB Output is correct
38 Correct 2 ms 2668 KB Output is correct
39 Correct 61 ms 14104 KB Output is correct
40 Correct 61 ms 14024 KB Output is correct
41 Correct 38 ms 11792 KB Output is correct
42 Correct 9 ms 4480 KB Output is correct
43 Correct 2 ms 2668 KB Output is correct
44 Correct 3 ms 2668 KB Output is correct
45 Correct 2 ms 2668 KB Output is correct
46 Correct 2 ms 2668 KB Output is correct
47 Correct 2 ms 2668 KB Output is correct
48 Correct 2 ms 2668 KB Output is correct
49 Correct 2 ms 2668 KB Output is correct
50 Correct 3 ms 2668 KB Output is correct
51 Correct 2 ms 2668 KB Output is correct
52 Correct 2 ms 2668 KB Output is correct
53 Correct 2 ms 2688 KB Output is correct
54 Correct 2 ms 2668 KB Output is correct
55 Correct 2 ms 2668 KB Output is correct
56 Correct 2 ms 2668 KB Output is correct
57 Correct 98 ms 11244 KB Output is correct
58 Correct 96 ms 11116 KB Output is correct
59 Correct 94 ms 11116 KB Output is correct
60 Correct 95 ms 11116 KB Output is correct
61 Correct 84 ms 11116 KB Output is correct
62 Correct 87 ms 11116 KB Output is correct
63 Correct 83 ms 10860 KB Output is correct
64 Correct 80 ms 10860 KB Output is correct
65 Correct 87 ms 11116 KB Output is correct
66 Correct 83 ms 11116 KB Output is correct
67 Correct 93 ms 11116 KB Output is correct
68 Correct 93 ms 11116 KB Output is correct
69 Correct 96 ms 11372 KB Output is correct
70 Correct 95 ms 11372 KB Output is correct
71 Correct 2 ms 2668 KB Output is correct
72 Correct 4 ms 2924 KB Output is correct
73 Correct 4 ms 2924 KB Output is correct
74 Correct 4 ms 2924 KB Output is correct
75 Correct 4 ms 2924 KB Output is correct
76 Correct 4 ms 2924 KB Output is correct
77 Correct 4 ms 2924 KB Output is correct
78 Correct 4 ms 2924 KB Output is correct
79 Correct 4 ms 2924 KB Output is correct
80 Correct 116 ms 11116 KB Output is correct
81 Correct 106 ms 11032 KB Output is correct
82 Correct 87 ms 11116 KB Output is correct
83 Correct 89 ms 11244 KB Output is correct
84 Correct 3 ms 2924 KB Output is correct
85 Correct 3 ms 2924 KB Output is correct
86 Correct 3 ms 2924 KB Output is correct
87 Correct 3 ms 2924 KB Output is correct
88 Correct 3 ms 2924 KB Output is correct
89 Correct 4 ms 2944 KB Output is correct
90 Correct 3 ms 2924 KB Output is correct
91 Correct 4 ms 2924 KB Output is correct
92 Correct 4 ms 2924 KB Output is correct
93 Correct 4 ms 2924 KB Output is correct
94 Correct 2 ms 2668 KB Output is correct
95 Correct 2 ms 2668 KB Output is correct
96 Correct 2 ms 2668 KB Output is correct
97 Correct 2 ms 2668 KB Output is correct
98 Correct 2 ms 2668 KB Output is correct
99 Correct 2 ms 2668 KB Output is correct
100 Correct 2 ms 2668 KB Output is correct
101 Correct 2 ms 2668 KB Output is correct
102 Correct 2 ms 2668 KB Output is correct
103 Correct 2 ms 2668 KB Output is correct
104 Correct 8 ms 3820 KB Output is correct
105 Correct 15 ms 5332 KB Output is correct
106 Correct 2 ms 2668 KB Output is correct
107 Correct 28 ms 7340 KB Output is correct
108 Correct 39 ms 9900 KB Output is correct
109 Correct 3 ms 2796 KB Output is correct
110 Correct 64 ms 11384 KB Output is correct
111 Correct 75 ms 12620 KB Output is correct
112 Correct 3 ms 2924 KB Output is correct
113 Correct 111 ms 18748 KB Output is correct
114 Execution timed out 1062 ms 6764 KB Time limit exceeded
115 Halted 0 ms 0 KB -