oj.uz

답안 #815840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815840 2023-08-09T00:56:10 Z Lobo 통행료 (IOI18_highway) C++17
90 / 100
 244 ms 19080 KB 
#include "highway.h"
#include<bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define int long long
const int inf = 1e18+10;
const int maxn = 9e4+10;

int n, m, par[maxn];
vector<int> parid[maxn];
vector<int> g[maxn];

void find_pair(int32_t N, std::vector<int32_t> U, std::vector<int32_t> V, int32_t A, int32_t B) {
	n = N;
	m = U.size();
	for(int i = 0; i < m; i++) {
		g[U[i]].pb(i);
		g[V[i]].pb(i);
	}
	vector<int32_t> vectudoa(m,0);
	int tudoa = ask(vectudoa);
	int path = tudoa/A;

	int edgein = -1;
	int lbs,rbs;
	vector<int32_t> vectoll(m,0);
	lbs = 0;
	rbs = m-1;
	while(lbs <= rbs) {
		int mid = (lbs+rbs)/2;
		vectoll.clear(); vectoll.resize(m,0);
		for(int i = 0; i <= mid; i++) {
			vectoll[i] = 1;
		}

		int toll = ask(vectoll);

		if(toll != tudoa) {
			edgein = mid;
			rbs = mid-1;
		}
		else {
			lbs = mid+1;
		}
	}

	assert(edgein != -1);

	int ss = U[edgein];
	int tt = V[edgein];

	vector<pair<int,int>> d(n+10,mp(inf,0));
	d[ss] = mp(0,ss); par[ss] = -1;
	d[tt] = mp(0,tt); par[tt] = -1;

	queue<int> q; q.push(ss); q.push(tt);
	while(q.size()) {
		int u = q.front(); q.pop();

		for(auto id : g[u]) {
			int v = U[id]+V[id]-u;
			if(d[v].fr > d[u].fr+1) {
				d[v] = mp(d[u].fr+1,d[u].sc);
				par[v] = u;
				parid[v].clear(); parid[v].pb(id);
				q.push(v);
			}
			else if(d[v].fr == d[u].fr+1 && d[v].sc != d[u].sc) {
				parid[v].pb(id);
				d[v].sc = -1;
			}
			else if(d[v].fr == d[u].fr+1) {
				parid[v].pb(id);
			}
		}
	}

	int toll0;

	vector<pair<int,int>> Ds;
	for(int i = 0; i < n; i++) {
		if(d[i].sc == ss) {
			Ds.pb(mp(d[i].fr,i));
		}
	}
	vector<pair<int,int>> Dt;
	for(int i = 0; i < n; i++) {
		if(d[i].sc == tt) {
			Dt.pb(mp(d[i].fr,i));
		}
	}
	sort(all(Dt));
	sort(all(Ds));
	lbs = 0;
	rbs = (int) Ds.size()-1;
	int32_t s = ss;

	vectoll.clear(); vectoll.resize(m,1);
	for(int i = 0; i < (int) Ds.size(); i++) {
		for(auto id : parid[Ds[i].sc]) vectoll[id] = 0;
		// if(parid[Ds[i].sc] != -1) vectoll[parid[Ds[i].sc]] = 1;
	}
	toll0 = ask(vectoll);

	while(lbs <= rbs) {
		int mid = (lbs+rbs)/2;

		vectoll.clear(); vectoll.resize(m,1);

		// for(int i = 0; i <= mid; i++) {
		// 	if(parid[Ds[i].sc] != -1) vectoll[parid[Ds[i].sc]] = 0;
		// }

		vectoll[edgein] = 0;
		for(int i = 0; i < Dt.size(); i++) {
			for(auto id : parid[Dt[i].sc]) vectoll[id] = 0;
		}

		for(int i = 0; i <= mid; i++) {
			for(auto id : parid[Ds[i].sc]) vectoll[id] = 0;
			// if(parid[Ds[i].sc] != -1) vectoll[parid[Ds[i].sc]] = 1;
		}

		int toll = ask(vectoll);

		if(toll == path*A) {
			s = Ds[mid].sc;
			rbs = mid-1;
		}
		else {
			lbs = mid+1;
		}
	}

	
	lbs = 0;
	rbs = (int) Dt.size()-1;
	int32_t t = tt;

	vectoll.clear(); vectoll.resize(m,1);
	for(int i = 0; i < (int) Dt.size(); i++) {
		for(auto id : parid[Dt[i].sc]) vectoll[id] = 0;
		// if(parid[Ds[i].sc] != -1) vectoll[parid[Ds[i].sc]] = 1;
	}
	toll0 = ask(vectoll);

	while(lbs <= rbs) {
		int mid = (lbs+rbs)/2;

		vectoll.clear(); vectoll.resize(m,1);

		vectoll[edgein] = 0;
		for(int i = 0; i < Ds.size(); i++) {
			for(auto id : parid[Ds[i].sc]) vectoll[id] = 0;
		}

		for(int i = 0; i <= mid; i++) {
			for(auto id : parid[Dt[i].sc]) vectoll[id] = 0;
			// if(parid[Dt[i].sc] != -1) vectoll[parid[Dt[i].sc]] = 1;
		}

		int toll = ask(vectoll);

		if(toll == path*A) {
			t = Dt[mid].sc;
			rbs = mid-1;
		}
		else {
			lbs = mid+1;
		}
	}

	// cout << ss << " " << tt << endl;
	// cout << s << " " << t << endl;
	answer(s,t);
}

Compilation message

highway.cpp: In function 'void find_pair(int32_t, std::vector<int>, std::vector<int>, int32_t, int32_t)':
highway.cpp:119:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |   for(int i = 0; i < Dt.size(); i++) {
      |                  ~~^~~~~~~~~~~
highway.cpp:157:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |   for(int i = 0; i < Ds.size(); i++) {
      |                  ~~^~~~~~~~~~~
highway.cpp:82:6: warning: variable 'toll0' set but not used [-Wunused-but-set-variable]
   82 |  int toll0;
      |      ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 3 ms 4512 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 4540 KB Output is correct
5 Correct 2 ms 4432 KB Output is correct
6 Correct 3 ms 4476 KB Output is correct
7 Correct 3 ms 4548 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 2 ms 4544 KB Output is correct
10 Correct 2 ms 4432 KB Output is correct
11 Correct 2 ms 4432 KB Output is correct
12 Correct 2 ms 4432 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4608 KB Output is correct
2 Correct 11 ms 6096 KB Output is correct
3 Correct 120 ms 17112 KB Output is correct
4 Correct 135 ms 17108 KB Output is correct
5 Correct 136 ms 17064 KB Output is correct
6 Correct 161 ms 17112 KB Output is correct
7 Correct 175 ms 17080 KB Output is correct
8 Correct 126 ms 17044 KB Output is correct
9 Correct 106 ms 17084 KB Output is correct
10 Correct 140 ms 17136 KB Output is correct
11 Correct 134 ms 16692 KB Output is correct
12 Correct 126 ms 16464 KB Output is correct
13 Correct 110 ms 16612 KB Output is correct
14 Correct 132 ms 16492 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 5992 KB Output is correct
2 Correct 18 ms 7232 KB Output is correct
3 Correct 24 ms 8408 KB Output is correct
4 Correct 75 ms 16352 KB Output is correct
5 Correct 73 ms 16360 KB Output is correct
6 Correct 76 ms 16852 KB Output is correct
7 Correct 70 ms 16540 KB Output is correct
8 Correct 71 ms 15972 KB Output is correct
9 Correct 75 ms 16604 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4560 KB Output is correct
2 Correct 12 ms 5920 KB Output is correct
3 Correct 75 ms 14788 KB Output is correct
4 Correct 136 ms 17116 KB Output is correct
5 Correct 116 ms 17012 KB Output is correct
6 Correct 133 ms 17108 KB Output is correct
7 Correct 117 ms 17244 KB Output is correct
8 Correct 108 ms 17044 KB Output is correct
9 Correct 130 ms 17108 KB Output is correct
10 Correct 141 ms 17048 KB Output is correct
11 Correct 145 ms 16496 KB Output is correct
12 Correct 122 ms 16752 KB Output is correct
13 Correct 135 ms 16476 KB Output is correct
14 Correct 149 ms 16336 KB Output is correct
15 Correct 97 ms 17092 KB Output is correct
16 Correct 115 ms 17164 KB Output is correct
17 Correct 116 ms 16564 KB Output is correct
18 Correct 149 ms 16544 KB Output is correct
19 Correct 158 ms 17132 KB Output is correct
20 Correct 110 ms 16624 KB Output is correct
21 Correct 108 ms 17956 KB Output is correct
22 Correct 108 ms 18028 KB Output is correct
23 Correct 117 ms 17588 KB Output is correct
24 Correct 124 ms 17652 KB Output is correct
25 Correct 117 ms 16588 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 6020 KB Output is correct
2 Correct 19 ms 6096 KB Output is correct
3 Correct 149 ms 17576 KB Output is correct
4 Correct 203 ms 17528 KB Output is correct
5 Correct 178 ms 18864 KB Output is correct
6 Correct 167 ms 17944 KB Output is correct
7 Correct 205 ms 18020 KB Output is correct
8 Correct 173 ms 18192 KB Output is correct
9 Correct 133 ms 13044 KB Output is correct
10 Correct 101 ms 13132 KB Output is correct
11 Correct 128 ms 14736 KB Output is correct
12 Correct 176 ms 16288 KB Output is correct
13 Correct 172 ms 17432 KB Output is correct
14 Correct 244 ms 18076 KB Output is correct
15 Correct 200 ms 18000 KB Output is correct
16 Correct 202 ms 14144 KB Output is correct
17 Correct 124 ms 17948 KB Output is correct
18 Correct 127 ms 18304 KB Output is correct
19 Correct 134 ms 18156 KB Output is correct
20 Correct 154 ms 18228 KB Output is correct
21 Correct 211 ms 18948 KB Output is correct

Subtask #6
21.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 5960 KB Output is correct
2 Correct 15 ms 6124 KB Output is correct
3 Correct 134 ms 16908 KB Output is correct
4 Correct 137 ms 16984 KB Output is correct
5 Correct 202 ms 17112 KB Output is correct
6 Correct 206 ms 18208 KB Output is correct
7 Correct 116 ms 17524 KB Output is correct
8 Correct 137 ms 17776 KB Output is correct
9 Correct 146 ms 17492 KB Output is correct
10 Correct 186 ms 18128 KB Output is correct
11 Correct 198 ms 18664 KB Output is correct
12 Correct 208 ms 18204 KB Output is correct
13 Correct 115 ms 14600 KB Output is correct
14 Correct 157 ms 13068 KB Output is correct
15 Correct 137 ms 14688 KB Output is correct
16 Correct 98 ms 13116 KB Output is correct
17 Correct 158 ms 14716 KB Output is correct
18 Correct 160 ms 13036 KB Output is correct
19 Correct 157 ms 16480 KB Output is correct
20 Correct 169 ms 17276 KB Output is correct
21 Partially correct 174 ms 17936 KB Output is partially correct
22 Partially correct 161 ms 18056 KB Output is partially correct
23 Correct 213 ms 18608 KB Output is correct
24 Correct 189 ms 18072 KB Output is correct
25 Correct 178 ms 18192 KB Output is correct
26 Correct 170 ms 18184 KB Output is correct
27 Correct 116 ms 18096 KB Output is correct
28 Correct 127 ms 18088 KB Output is correct
29 Correct 122 ms 18288 KB Output is correct
30 Correct 118 ms 18160 KB Output is correct
31 Correct 125 ms 18148 KB Output is correct
32 Correct 115 ms 18016 KB Output is correct
33 Correct 116 ms 18308 KB Output is correct
34 Correct 139 ms 18164 KB Output is correct
35 Correct 96 ms 18096 KB Output is correct
36 Correct 147 ms 18028 KB Output is correct
37 Correct 127 ms 18248 KB Output is correct
38 Correct 121 ms 18180 KB Output is correct
39 Partially correct 230 ms 19080 KB Output is partially correct
40 Partially correct 206 ms 18688 KB Output is partially correct
41 Correct 177 ms 18688 KB Output is correct
42 Partially correct 199 ms 18512 KB Output is partially correct