oj.uz

답안 #815837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815837 2023-08-09T00:53:59 Z Lobo 통행료 (IOI18_highway) C++17
51 / 100
 193 ms 17940 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);

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

		for(int i = mid; i < Dt.size(); 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*B) {
			t = Dt[mid].sc;
			lbs = mid+1;
		}
		else {
			rbs = 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:160:22: 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]
  160 |   for(int i = mid; i < Dt.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 2 ms 4432 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 2 ms 4432 KB Output is correct
6 Correct 3 ms 4544 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 3 ms 4432 KB Output is correct
10 Correct 2 ms 4432 KB Output is correct
11 Correct 3 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 4588 KB Output is correct
2 Correct 11 ms 6048 KB Output is correct
3 Correct 117 ms 17028 KB Output is correct
4 Correct 156 ms 17040 KB Output is correct
5 Correct 140 ms 17144 KB Output is correct
6 Correct 139 ms 17060 KB Output is correct
7 Correct 160 ms 17124 KB Output is correct
8 Correct 161 ms 17108 KB Output is correct
9 Correct 109 ms 17048 KB Output is correct
10 Correct 117 ms 17120 KB Output is correct
11 Correct 143 ms 16760 KB Output is correct
12 Correct 139 ms 16496 KB Output is correct
13 Correct 117 ms 16536 KB Output is correct
14 Correct 124 ms 16500 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 5968 KB Output is correct
2 Correct 18 ms 7184 KB Output is correct
3 Correct 25 ms 8412 KB Output is correct
4 Correct 130 ms 16476 KB Output is correct
5 Correct 104 ms 16392 KB Output is correct
6 Correct 77 ms 16872 KB Output is correct
7 Correct 77 ms 16544 KB Output is correct
8 Correct 104 ms 15944 KB Output is correct
9 Correct 69 ms 16628 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4560 KB Output is correct
2 Correct 16 ms 5968 KB Output is correct
3 Correct 84 ms 14792 KB Output is correct
4 Correct 112 ms 17048 KB Output is correct
5 Correct 128 ms 17024 KB Output is correct
6 Correct 139 ms 17048 KB Output is correct
7 Correct 114 ms 17052 KB Output is correct
8 Correct 92 ms 17112 KB Output is correct
9 Correct 193 ms 17116 KB Output is correct
10 Correct 155 ms 17116 KB Output is correct
11 Correct 114 ms 16496 KB Output is correct
12 Correct 107 ms 16756 KB Output is correct
13 Correct 142 ms 16476 KB Output is correct
14 Correct 152 ms 16508 KB Output is correct
15 Correct 131 ms 17024 KB Output is correct
16 Correct 143 ms 17128 KB Output is correct
17 Correct 131 ms 16500 KB Output is correct
18 Correct 112 ms 16480 KB Output is correct
19 Correct 108 ms 17056 KB Output is correct
20 Correct 164 ms 16600 KB Output is correct
21 Correct 123 ms 17940 KB Output is correct
22 Correct 94 ms 17920 KB Output is correct
23 Correct 141 ms 17616 KB Output is correct
24 Correct 117 ms 17648 KB Output is correct
25 Correct 121 ms 16788 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 5952 KB Output is correct
2 Incorrect 13 ms 6124 KB Output is incorrect: {s, t} is wrong.
3 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 5892 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -