oj.uz

Submission #807625

# Submission time Handle Problem Language Result Execution time Memory
807625 2023-08-04T20:42:17 Z Lobo Highway Tolls (IOI18_highway) C++17
51 / 100
 183 ms 18648 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) {
	// int M = U.size();
	// for (int j = 0; j < 50; ++j) {
	//   std::vector<int> w(M);
	//   for (int i = 0; i < M; ++i) {
	//     w[i] = 0;
	//   }
	//   long long toll = ask(w);
	// }
	// answer(0, N - 1);


	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) {
				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));
		}
	}
	sort(all(Ds));
	lbs = 0;
	rbs = (int) Ds.size()-1;
	int32_t s = -1;

	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;
		// }

		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 == toll0) {
			s = Ds[mid].sc;
			rbs = mid-1;
		}
		else {
			lbs = mid+1;
		}
	}

	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));
	lbs = 0;
	rbs = (int) Dt.size()-1;
	int32_t t = -1;
	while(lbs <= rbs) {
		int mid = (lbs+rbs)/2;

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

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

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

		int toll = ask(vectoll);

		if(toll == tudoa) {
			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:37:6: warning: unused variable 'path' [-Wunused-variable]
   37 |  int path = tudoa/A;
      |      ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4432 KB Output is correct
2 Correct 3 ms 4432 KB Output is correct
3 Correct 2 ms 4432 KB Output is correct
4 Correct 3 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 4488 KB Output is correct
8 Correct 2 ms 4544 KB Output is correct
9 Correct 2 ms 4492 KB Output is correct
10 Correct 3 ms 4432 KB Output is correct
11 Correct 3 ms 4432 KB Output is correct
12 Correct 3 ms 4432 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4560 KB Output is correct
2 Correct 13 ms 6000 KB Output is correct
3 Correct 155 ms 17072 KB Output is correct
4 Correct 111 ms 17056 KB Output is correct
5 Correct 113 ms 17044 KB Output is correct
6 Correct 98 ms 17216 KB Output is correct
7 Correct 135 ms 17148 KB Output is correct
8 Correct 151 ms 17104 KB Output is correct
9 Correct 140 ms 17104 KB Output is correct
10 Correct 137 ms 17056 KB Output is correct
11 Correct 118 ms 16752 KB Output is correct
12 Correct 135 ms 16476 KB Output is correct
13 Correct 137 ms 16612 KB Output is correct
14 Correct 156 ms 16512 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5968 KB Output is correct
2 Correct 21 ms 7172 KB Output is correct
3 Correct 35 ms 8456 KB Output is correct
4 Correct 76 ms 16380 KB Output is correct
5 Correct 99 ms 16632 KB Output is correct
6 Correct 101 ms 16768 KB Output is correct
7 Correct 71 ms 16488 KB Output is correct
8 Correct 83 ms 16128 KB Output is correct
9 Correct 86 ms 16508 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4592 KB Output is correct
2 Correct 14 ms 5916 KB Output is correct
3 Correct 108 ms 14800 KB Output is correct
4 Correct 136 ms 17068 KB Output is correct
5 Correct 124 ms 17036 KB Output is correct
6 Correct 144 ms 17240 KB Output is correct
7 Correct 145 ms 17048 KB Output is correct
8 Correct 118 ms 17056 KB Output is correct
9 Correct 143 ms 17048 KB Output is correct
10 Correct 124 ms 17116 KB Output is correct
11 Correct 124 ms 16492 KB Output is correct
12 Correct 134 ms 16772 KB Output is correct
13 Correct 151 ms 16496 KB Output is correct
14 Correct 148 ms 16428 KB Output is correct
15 Correct 109 ms 17104 KB Output is correct
16 Correct 123 ms 17056 KB Output is correct
17 Correct 125 ms 16496 KB Output is correct
18 Correct 124 ms 16472 KB Output is correct
19 Correct 103 ms 17064 KB Output is correct
20 Correct 139 ms 16652 KB Output is correct
21 Correct 133 ms 17928 KB Output is correct
22 Correct 123 ms 17932 KB Output is correct
23 Correct 118 ms 17688 KB Output is correct
24 Correct 135 ms 17616 KB Output is correct
25 Correct 118 ms 16588 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 5980 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 5956 KB Output is correct
2 Correct 18 ms 6152 KB Output is correct
3 Correct 169 ms 17484 KB Output is correct
4 Correct 153 ms 17532 KB Output is correct
5 Correct 152 ms 17344 KB Output is correct
6 Correct 183 ms 18648 KB Output is correct
7 Correct 164 ms 17460 KB Output is correct
8 Incorrect 181 ms 17828 KB Output is incorrect: {s, t} is wrong.
9 Halted 0 ms 0 KB -