oj.uz

답안 #1058120

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058120 2024-08-14T08:35:04 Z ReLice 통행료 (IOI18_highway) C++17
90 / 100
 137 ms 28404 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9816 KB Output is correct
2 Correct 2 ms 9816 KB Output is correct
3 Correct 2 ms 9816 KB Output is correct
4 Correct 3 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 2 ms 9816 KB Output is correct
10 Correct 2 ms 9816 KB Output is correct
11 Correct 2 ms 9812 KB Output is correct
12 Correct 3 ms 9816 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9816 KB Output is correct
2 Correct 11 ms 11480 KB Output is correct
3 Correct 85 ms 24192 KB Output is correct
4 Correct 89 ms 24160 KB Output is correct
5 Correct 97 ms 24000 KB Output is correct
6 Correct 85 ms 23968 KB Output is correct
7 Correct 81 ms 24052 KB Output is correct
8 Correct 88 ms 24284 KB Output is correct
9 Correct 82 ms 24032 KB Output is correct
10 Correct 83 ms 24028 KB Output is correct
11 Correct 84 ms 24252 KB Output is correct
12 Correct 88 ms 24640 KB Output is correct
13 Correct 85 ms 24284 KB Output is correct
14 Correct 87 ms 24300 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11608 KB Output is correct
2 Correct 16 ms 13460 KB Output is correct
3 Correct 23 ms 14872 KB Output is correct
4 Correct 65 ms 24620 KB Output is correct
5 Correct 64 ms 24544 KB Output is correct
6 Correct 67 ms 25380 KB Output is correct
7 Correct 65 ms 25580 KB Output is correct
8 Correct 68 ms 24832 KB Output is correct
9 Correct 67 ms 24952 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 10 ms 11440 KB Output is correct
3 Correct 61 ms 21180 KB Output is correct
4 Correct 95 ms 24124 KB Output is correct
5 Correct 73 ms 24128 KB Output is correct
6 Correct 77 ms 24104 KB Output is correct
7 Correct 78 ms 24012 KB Output is correct
8 Correct 70 ms 24084 KB Output is correct
9 Correct 85 ms 24132 KB Output is correct
10 Correct 85 ms 24460 KB Output is correct
11 Correct 94 ms 24560 KB Output is correct
12 Correct 102 ms 24400 KB Output is correct
13 Correct 100 ms 24392 KB Output is correct
14 Correct 84 ms 24492 KB Output is correct
15 Correct 70 ms 24096 KB Output is correct
16 Correct 70 ms 24096 KB Output is correct
17 Correct 96 ms 24520 KB Output is correct
18 Correct 88 ms 24544 KB Output is correct
19 Correct 86 ms 24392 KB Output is correct
20 Correct 80 ms 24528 KB Output is correct
21 Correct 72 ms 24648 KB Output is correct
22 Correct 79 ms 24896 KB Output is correct
23 Correct 79 ms 24532 KB Output is correct
24 Correct 91 ms 24552 KB Output is correct
25 Correct 89 ms 26260 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11352 KB Output is correct
2 Correct 11 ms 11608 KB Output is correct
3 Correct 91 ms 25400 KB Output is correct
4 Correct 107 ms 26324 KB Output is correct
5 Correct 108 ms 28092 KB Output is correct
6 Correct 116 ms 28160 KB Output is correct
7 Correct 125 ms 28148 KB Output is correct
8 Correct 117 ms 28404 KB Output is correct
9 Correct 104 ms 21964 KB Output is correct
10 Correct 94 ms 22804 KB Output is correct
11 Correct 106 ms 24244 KB Output is correct
12 Correct 115 ms 26784 KB Output is correct
13 Correct 117 ms 27768 KB Output is correct
14 Correct 121 ms 28148 KB Output is correct
15 Correct 113 ms 28080 KB Output is correct
16 Correct 106 ms 24296 KB Output is correct
17 Correct 81 ms 24520 KB Output is correct
18 Correct 88 ms 25096 KB Output is correct
19 Correct 99 ms 24380 KB Output is correct
20 Correct 95 ms 24552 KB Output is correct
21 Correct 109 ms 28304 KB Output is correct

Subtask #6
21.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 11352 KB Output is correct
2 Correct 11 ms 11688 KB Output is correct
3 Correct 89 ms 25164 KB Output is correct
4 Correct 100 ms 26024 KB Output is correct
5 Partially correct 108 ms 26436 KB Output is partially correct
6 Correct 122 ms 28080 KB Output is correct
7 Correct 84 ms 25184 KB Output is correct
8 Correct 90 ms 26052 KB Output is correct
9 Correct 98 ms 27012 KB Output is correct
10 Correct 107 ms 28180 KB Output is correct
11 Correct 117 ms 28140 KB Output is correct
12 Correct 106 ms 28152 KB Output is correct
13 Correct 103 ms 24284 KB Output is correct
14 Correct 94 ms 22680 KB Output is correct
15 Correct 113 ms 24240 KB Output is correct
16 Correct 98 ms 22836 KB Output is correct
17 Correct 101 ms 24212 KB Output is correct
18 Correct 101 ms 22692 KB Output is correct
19 Correct 133 ms 26892 KB Output is correct
20 Correct 121 ms 27536 KB Output is correct
21 Correct 106 ms 28080 KB Output is correct
22 Correct 133 ms 28176 KB Output is correct
23 Correct 104 ms 28172 KB Output is correct
24 Correct 121 ms 28116 KB Output is correct
25 Correct 126 ms 28136 KB Output is correct
26 Correct 118 ms 28180 KB Output is correct
27 Correct 84 ms 24452 KB Output is correct
28 Correct 84 ms 24272 KB Output is correct
29 Partially correct 89 ms 25096 KB Output is partially correct
30 Correct 81 ms 24424 KB Output is correct
31 Partially correct 94 ms 24352 KB Output is partially correct
32 Correct 86 ms 24680 KB Output is correct
33 Correct 84 ms 25060 KB Output is correct
34 Correct 78 ms 24756 KB Output is correct
35 Correct 88 ms 24640 KB Output is correct
36 Correct 77 ms 24240 KB Output is correct
37 Correct 77 ms 24976 KB Output is correct
38 Partially correct 106 ms 25108 KB Output is partially correct
39 Correct 111 ms 28056 KB Output is correct
40 Correct 112 ms 27808 KB Output is correct
41 Partially correct 132 ms 28072 KB Output is partially correct
42 Correct 137 ms 28024 KB Output is correct