oj.uz

Submission #1058207

# Submission time Handle Problem Language Result Execution time Memory
1058207 2024-08-14T08:55:52 Z ReLice Highway Tolls (IOI18_highway) C++17
90 / 100
 131 ms 28548 KB 
    #include "highway.h"
    #include <bits/stdc++.h>
    #define ll long long
    #define vll vector<ll>
    #define pb push_back
    #define pf push_front
    #define sz size()
    #define bc back()
    #define pob pop_back()
    #define pof pop_front()
    #define fr first
    #define sc second
    using namespace std;
    const ll N=2e5+7;
    const ll inf=1e18;
    vector<vector<array<ll,2>>> g(N), g2(N);
    void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
    	ll M = V.sz;
    	ll s, t, rt;
    	ll n = N;
    	vll v, u;
    	ll i;
    	
    	for(auto i : V) v.pb(i);
    	for(auto i : U) u.pb(i);
    	
    	vector<int> w(M, 0);
    	
    	ll x = ask(w);
    	
    	for(i=0;i<M;i++){
    		g[v[i]].pb({u[i], i});
    		g[u[i]].pb({v[i], i});
    	}
    	
    	{//getting vertex on the path
    		ll l = 0, r = n;
    		while(l + 1 < r){
    			ll m = (l + r) / 2;
    			
    			if(r - l > 60000) m = 60000;
    			
    			w.assign(M, 0);
    			
    			for(i=0;i<m;i++){
    				for(auto [to, r] : g[i]) w[r] = 1;
    			}
    			
    			ll y = ask(w);
    			
    			if(y == x) l = m;
    			else r = m;
    		}
    		
    		rt = r - 1;
    	}
    	
    	vll p(n), d(n);
    	vll pr(n), tour;
    	vector<vll> dd(n);
    	
    	auto bfs = [&](ll s){
    		for(i=0;i<n;i++){
    			dd[i].clear();
    			d[i] = inf;
    			pr[i] = p[i] = -1;
    		}
    		
    		queue<ll> q;
    		q.push(s);
    		d[s] = 0;
    		
    		while(q.size()){
    			ll x = q.front();
    			q.pop();
    			
    			dd[d[x]].pb(x);
    			
    			for(auto [to, r] : g[x]){
    				if(d[to] > d[x] + 1){
    					d[to] = d[x] + 1 ;
    					pr[to] = r;
    					p[to] = x;
    					q.push(to);
    				}
    			}
    		}
    		
    		tour.clear();
    		for(i=0;i<n;i++){
    			for(auto j : dd[i]) tour.pb(j);
    		}
    	};
    	
    	vll path;
    	auto calc = [&](ll N){
    		ll l = 0, r = N;
    		while(l + 1 < r){
    			ll m = (l + r) / 2;
    			
    			if(r - l > 60000) m = 60000;
    			
    			w.assign(M, 1);
    			
    			for(auto i : path) w[i] =0;
    			
    			//~ cout<<m<<endl;
    			for(i=1;i<m;i++) {
    				w[pr[tour[i]]] = 0;
    				//~ cout<<v[pr[tour[i]]]<<' '<<u[pr[tour[i]]]<<endl;
    			}
    			
    			ll y = ask(w);
    				
    			if(x == y) r = m;
    			else l = m;
    		}
    		
    		return r - 1;
    	};
    	
    	bfs(rt);
    	
    	ll k = calc(n);
    	s = tour[k];
    	
    	{
    		ll x = s;
    		while(x != rt){
    			path.pb(pr[x]);
    			x = p[x];
    		}
    	}
    	
    	t = tour[calc(k)];
    	
    	answer(s, t);
    }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 3 ms 9816 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 2 ms 9816 KB Output is correct
5 Correct 2 ms 9816 KB Output is correct
6 Correct 2 ms 9816 KB Output is correct
7 Correct 2 ms 9816 KB Output is correct
8 Correct 2 ms 9816 KB Output is correct
9 Correct 4 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 9816 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 10 ms 11508 KB Output is correct
3 Correct 89 ms 24208 KB Output is correct
4 Correct 88 ms 24040 KB Output is correct
5 Correct 109 ms 24240 KB Output is correct
6 Correct 87 ms 24152 KB Output is correct
7 Correct 83 ms 24264 KB Output is correct
8 Correct 98 ms 24220 KB Output is correct
9 Correct 79 ms 24272 KB Output is correct
10 Correct 91 ms 24104 KB Output is correct
11 Correct 95 ms 24324 KB Output is correct
12 Correct 101 ms 24612 KB Output is correct
13 Correct 95 ms 24520 KB Output is correct
14 Correct 102 ms 24392 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11608 KB Output is correct
2 Correct 18 ms 13316 KB Output is correct
3 Correct 30 ms 14844 KB Output is correct
4 Correct 69 ms 24492 KB Output is correct
5 Correct 61 ms 24636 KB Output is correct
6 Correct 69 ms 25388 KB Output is correct
7 Correct 73 ms 25568 KB Output is correct
8 Correct 82 ms 24792 KB Output is correct
9 Correct 67 ms 24856 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 11 ms 11516 KB Output is correct
3 Correct 64 ms 21184 KB Output is correct
4 Correct 93 ms 24164 KB Output is correct
5 Correct 74 ms 24060 KB Output is correct
6 Correct 83 ms 24272 KB Output is correct
7 Correct 77 ms 24124 KB Output is correct
8 Correct 78 ms 24088 KB Output is correct
9 Correct 92 ms 24004 KB Output is correct
10 Correct 93 ms 24224 KB Output is correct
11 Correct 100 ms 24396 KB Output is correct
12 Correct 101 ms 24404 KB Output is correct
13 Correct 90 ms 24512 KB Output is correct
14 Correct 95 ms 24496 KB Output is correct
15 Correct 70 ms 24120 KB Output is correct
16 Correct 90 ms 24124 KB Output is correct
17 Correct 92 ms 24404 KB Output is correct
18 Correct 96 ms 24480 KB Output is correct
19 Correct 74 ms 24172 KB Output is correct
20 Correct 76 ms 24980 KB Output is correct
21 Correct 74 ms 24664 KB Output is correct
22 Correct 82 ms 24660 KB Output is correct
23 Correct 79 ms 24536 KB Output is correct
24 Correct 78 ms 24552 KB Output is correct
25 Correct 122 ms 26272 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 11352 KB Output is correct
2 Correct 11 ms 11608 KB Output is correct
3 Correct 98 ms 25564 KB Output is correct
4 Correct 122 ms 26332 KB Output is correct
5 Correct 117 ms 28084 KB Output is correct
6 Correct 115 ms 28156 KB Output is correct
7 Correct 131 ms 28148 KB Output is correct
8 Correct 108 ms 28188 KB Output is correct
9 Correct 97 ms 21968 KB Output is correct
10 Correct 93 ms 22820 KB Output is correct
11 Correct 97 ms 24232 KB Output is correct
12 Correct 115 ms 26784 KB Output is correct
13 Correct 108 ms 27464 KB Output is correct
14 Correct 111 ms 28148 KB Output is correct
15 Correct 107 ms 28088 KB Output is correct
16 Correct 95 ms 24292 KB Output is correct
17 Correct 75 ms 24520 KB Output is correct
18 Correct 79 ms 24784 KB Output is correct
19 Correct 77 ms 24380 KB Output is correct
20 Correct 78 ms 24560 KB Output is correct
21 Correct 105 ms 28040 KB Output is correct

Subtask #6
21.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11352 KB Output is correct
2 Correct 13 ms 11608 KB Output is correct
3 Correct 88 ms 25176 KB Output is correct
4 Correct 109 ms 25852 KB Output is correct
5 Partially correct 105 ms 26428 KB Output is partially correct
6 Correct 120 ms 28048 KB Output is correct
7 Correct 87 ms 25096 KB Output is correct
8 Correct 95 ms 25876 KB Output is correct
9 Correct 95 ms 26340 KB Output is correct
10 Correct 104 ms 28256 KB Output is correct
11 Correct 113 ms 28152 KB Output is correct
12 Correct 106 ms 28144 KB Output is correct
13 Correct 102 ms 24276 KB Output is correct
14 Correct 107 ms 22684 KB Output is correct
15 Correct 109 ms 24252 KB Output is correct
16 Correct 92 ms 22812 KB Output is correct
17 Correct 98 ms 24212 KB Output is correct
18 Correct 102 ms 22692 KB Output is correct
19 Correct 118 ms 26884 KB Output is correct
20 Correct 118 ms 27500 KB Output is correct
21 Correct 121 ms 28072 KB Output is correct
22 Correct 119 ms 28168 KB Output is correct
23 Correct 113 ms 28548 KB Output is correct
24 Correct 120 ms 28124 KB Output is correct
25 Correct 117 ms 28152 KB Output is correct
26 Correct 111 ms 28108 KB Output is correct
27 Correct 77 ms 24452 KB Output is correct
28 Correct 82 ms 24384 KB Output is correct
29 Partially correct 81 ms 24876 KB Output is partially correct
30 Correct 75 ms 24428 KB Output is correct
31 Partially correct 79 ms 24352 KB Output is partially correct
32 Correct 85 ms 24284 KB Output is correct
33 Correct 99 ms 25056 KB Output is correct
34 Correct 77 ms 24756 KB Output is correct
35 Correct 72 ms 24712 KB Output is correct
36 Correct 76 ms 24232 KB Output is correct
37 Correct 81 ms 24796 KB Output is correct
38 Partially correct 86 ms 24640 KB Output is partially correct
39 Correct 112 ms 27928 KB Output is correct
40 Correct 108 ms 27800 KB Output is correct
41 Partially correct 127 ms 28076 KB Output is partially correct
42 Correct 109 ms 28048 KB Output is correct