oj.uz

Submission #121603

# Submission time Handle Problem Language Result Execution time Memory
121603 2019-06-26T20:27:48 Z Sorting Highway Tolls (IOI18_highway) C++14
51 / 100
 333 ms 17804 KB 
#include <bits/stdc++.h>
#include "highway.h"
 
using namespace std;
 
const long long MAXN = 1e5 + 7;
 
long long ask(const vector<int> &w);
void answer(int s, int t);
 
mt19937 mt(1);
 
long long n, m;
vector<int> adj[MAXN], idx[MAXN], w;
bool used[MAXN];

long long a, b;
long long sm;

queue<long long> q;
vector<int> temp;

vector<pair<long long, long long> > bfs(long long x){
	for(long long i = 0; i < n; i++){
		used[i] = false;
	}
 
	q.push(x);
	
	vector<pair<long long, long long> > v;
 
	while(!q.empty()){
		long long u = q.front();
		q.pop();
 
		if(used[u]){
			continue;
		}
		used[u] = true;

		
		temp.clear();
		for(int i = 0; i < (int)adj[u].size(); i++){
			temp.push_back(i);
		}

		for(int i = 0; i < (int)adj[u].size(); i++){
			int x = mt() % adj[u].size();
			int y = mt() % adj[u].size();

			swap(temp[x], temp[y]);
		}
 
		for(long long i = 0; i < adj[u].size(); i++){
			long long to = adj[u][i];
			long long j = idx[u][i];
 
			if(!used[to]){
				q.push(to);
			}
		}

		for(long long i = 0; i < adj[u].size(); i++){
			long long to = adj[u][temp[i]];
			long long j = idx[u][temp[i]];
 
			if(!used[to]){
				v.push_back({j, to});
			}
		}
	}
 
	return v;
}

long long away(int x, const vector<int> &U, const vector<int> &V){
	vector<pair<long long, long long> > v = bfs(x);
 
	while((long long)v.size() != m);

	long long l = 0, r = (long long)v.size() - 1;
 
	while(l != r){
		long long mid = (l + r) >> 1;
		 
		for(long long i = 0; i < m; i++){
			w[i] = 0;
		}

		for(long long i = 0; i <= mid; i++){
			w[ v[i].first ] = 1;
		}

		long long score = ask(w); 

		if(score == (sm / a) * b){
			r = mid;
		}
		else{
			l = mid + 1;
		}
	}

	return v[l].second;
}
 
void find_pair(int N, vector<int> U, vector<int> V, int A, int B){
	srand(time(NULL));

	n = N;
	m = U.size();
 
	for(long long i = 0; i < m; i++){
		adj[V[i]].push_back(U[i]);
		adj[U[i]].push_back(V[i]);
 
		idx[V[i]].push_back(i);
		idx[U[i]].push_back(i);
		w.push_back(0);
	}
 
	sm = ask(w);
	a = A;
	b = B;
 
	long long l = 0, r = m - 1;
 
	while(l != r){
		long long mid = (l + r) / 2;
 
		for(long long i = 0; i < m; i++){
			w[i] = 0; 
		}
		for(long long i = mid + 1; i <= r; i++){
			w[i] = 1;
		}
 
		long long score = ask(w);
		score -= sm;
 
		if(score){
			l = mid + 1;
		}
		else{
			r = mid;
		}
	}
 
	long long x, y;
 
	x = away(U[l], U, V);
 
	y = away(x, U, V);
 
	answer(x, y);
}
/*
9 1 2
4 8
4 2
8 0
2 5
2 7
2 3
0 1
0 6
*/

Compilation message

highway.cpp: In function 'std::vector<std::pair<long long int, long long int> > bfs(long long int)':
highway.cpp:54:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(long long i = 0; i < adj[u].size(); i++){
                        ~~^~~~~~~~~~~~~~~
highway.cpp:56:14: warning: unused variable 'j' [-Wunused-variable]
    long long j = idx[u][i];
              ^
highway.cpp:63:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(long long i = 0; i < adj[u].size(); i++){
                        ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5032 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 5020 KB Output is correct
4 Correct 6 ms 5032 KB Output is correct
5 Correct 7 ms 4932 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 6 ms 5028 KB Output is correct
8 Correct 6 ms 5024 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5028 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5104 KB Output is correct
2 Correct 33 ms 6248 KB Output is correct
3 Correct 309 ms 16220 KB Output is correct
4 Correct 319 ms 16228 KB Output is correct
5 Correct 313 ms 16336 KB Output is correct
6 Correct 279 ms 16220 KB Output is correct
7 Correct 256 ms 16240 KB Output is correct
8 Correct 271 ms 16220 KB Output is correct
9 Correct 286 ms 16236 KB Output is correct
10 Correct 259 ms 16224 KB Output is correct
11 Correct 247 ms 15992 KB Output is correct
12 Correct 296 ms 16016 KB Output is correct
13 Correct 292 ms 16084 KB Output is correct
14 Correct 281 ms 16000 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 6216 KB Output is correct
2 Correct 77 ms 7516 KB Output is correct
3 Correct 74 ms 8436 KB Output is correct
4 Correct 200 ms 16016 KB Output is correct
5 Correct 186 ms 15988 KB Output is correct
6 Correct 170 ms 16004 KB Output is correct
7 Correct 193 ms 15988 KB Output is correct
8 Correct 167 ms 16004 KB Output is correct
9 Correct 190 ms 16104 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5104 KB Output is correct
2 Correct 27 ms 6260 KB Output is correct
3 Correct 216 ms 14204 KB Output is correct
4 Correct 273 ms 16336 KB Output is correct
5 Correct 249 ms 16228 KB Output is correct
6 Correct 282 ms 16212 KB Output is correct
7 Correct 241 ms 16288 KB Output is correct
8 Correct 311 ms 16208 KB Output is correct
9 Correct 305 ms 16232 KB Output is correct
10 Correct 282 ms 16236 KB Output is correct
11 Correct 317 ms 15992 KB Output is correct
12 Correct 286 ms 16000 KB Output is correct
13 Correct 298 ms 15988 KB Output is correct
14 Correct 271 ms 15996 KB Output is correct
15 Correct 254 ms 16312 KB Output is correct
16 Correct 264 ms 16276 KB Output is correct
17 Correct 311 ms 16008 KB Output is correct
18 Correct 333 ms 16016 KB Output is correct
19 Correct 254 ms 16216 KB Output is correct
20 Correct 261 ms 16052 KB Output is correct
21 Correct 285 ms 17800 KB Output is correct
22 Correct 232 ms 17804 KB Output is correct
23 Correct 223 ms 17272 KB Output is correct
24 Correct 281 ms 17196 KB Output is correct
25 Correct 262 ms 16188 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 60 ms 6348 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 Incorrect 32 ms 6296 KB Output is incorrect: {s, t} is wrong.
2 Halted 0 ms 0 KB -