oj.uz

Submission #807620

# Submission time Handle Problem Language Result Execution time Memory
807620 2023-08-04T20:35:48 Z Lobo Highway Tolls (IOI18_highway) C++17
51 / 100
 208 ms 19132 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);
			}
		}
	}

	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;
	while(lbs <= rbs) {
		int mid = (lbs+rbs)/2;

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

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

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

		int toll = ask(vectoll);

		if(toll == tudoa) {
			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 2 ms 4432 KB Output is correct
3 Correct 2 ms 4544 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 2 ms 4432 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 2 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 2 ms 4432 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4560 KB Output is correct
2 Correct 13 ms 6020 KB Output is correct
3 Correct 150 ms 17048 KB Output is correct
4 Correct 146 ms 17068 KB Output is correct
5 Correct 128 ms 17116 KB Output is correct
6 Correct 134 ms 17040 KB Output is correct
7 Correct 109 ms 17096 KB Output is correct
8 Correct 111 ms 17156 KB Output is correct
9 Correct 158 ms 17048 KB Output is correct
10 Correct 108 ms 17052 KB Output is correct
11 Correct 139 ms 16740 KB Output is correct
12 Correct 122 ms 16528 KB Output is correct
13 Correct 140 ms 16548 KB Output is correct
14 Correct 117 ms 16472 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 5968 KB Output is correct
2 Correct 16 ms 7176 KB Output is correct
3 Correct 29 ms 8460 KB Output is correct
4 Correct 109 ms 16452 KB Output is correct
5 Correct 87 ms 16380 KB Output is correct
6 Correct 94 ms 16820 KB Output is correct
7 Correct 95 ms 16512 KB Output is correct
8 Correct 94 ms 15936 KB Output is correct
9 Correct 123 ms 16560 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4688 KB Output is correct
2 Correct 11 ms 5920 KB Output is correct
3 Correct 83 ms 14780 KB Output is correct
4 Correct 112 ms 17044 KB Output is correct
5 Correct 145 ms 17036 KB Output is correct
6 Correct 150 ms 17192 KB Output is correct
7 Correct 118 ms 17088 KB Output is correct
8 Correct 119 ms 17112 KB Output is correct
9 Correct 111 ms 17060 KB Output is correct
10 Correct 112 ms 17056 KB Output is correct
11 Correct 117 ms 16492 KB Output is correct
12 Correct 105 ms 16696 KB Output is correct
13 Correct 136 ms 16528 KB Output is correct
14 Correct 126 ms 16320 KB Output is correct
15 Correct 139 ms 17116 KB Output is correct
16 Correct 97 ms 17052 KB Output is correct
17 Correct 122 ms 16536 KB Output is correct
18 Correct 121 ms 16508 KB Output is correct
19 Correct 128 ms 17052 KB Output is correct
20 Correct 135 ms 16736 KB Output is correct
21 Correct 126 ms 17948 KB Output is correct
22 Correct 87 ms 17984 KB Output is correct
23 Correct 110 ms 17700 KB Output is correct
24 Correct 116 ms 17524 KB Output is correct
25 Correct 115 ms 16584 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6024 KB Output is correct
2 Correct 16 ms 6148 KB Output is correct
3 Correct 111 ms 17516 KB Output is correct
4 Correct 183 ms 17916 KB Output is correct
5 Correct 208 ms 19132 KB Output is correct
6 Correct 187 ms 18176 KB Output is correct
7 Correct 189 ms 18704 KB Output is correct
8 Correct 200 ms 18916 KB Output is correct
9 Incorrect 122 ms 13040 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 5892 KB Output is correct
2 Correct 17 ms 6096 KB Output is correct
3 Correct 132 ms 17556 KB Output is correct
4 Correct 140 ms 17548 KB Output is correct
5 Correct 142 ms 17344 KB Output is correct
6 Correct 191 ms 18552 KB Output is correct
7 Correct 119 ms 17552 KB Output is correct
8 Correct 170 ms 17812 KB Output is correct
9 Incorrect 134 ms 17688 KB Output is incorrect: {s, t} is wrong.
10 Halted 0 ms 0 KB -