oj.uz

답안 #120905

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120905 2019-06-25T17:19:08 Z Sorting 통행료 (IOI18_highway) C++14
51 / 100
 363 ms 14972 KB 
#include <bits/stdc++.h>
#include "highway.h"
 
using namespace std;
 
const int MAXN = 1e5 + 7;
 
long long ask(const vector<int> &w);
void answer(int s, int t);
 
mt19937 mt();
 
long long n, m;
vector<int> adj[MAXN], idx[MAXN], w;
bool used[MAXN];

long long a, b;
long long sm;
 
vector<pair<int, int> > bfs(int x){
	queue<int> q;
 
	for(int i = 0; i < n; i++){
		used[i] = false;
	}
 
	q.push(x);
	
	vector<pair<int, int> > v;
 
	while(!q.empty()){
		int u = q.front();
		q.pop();
 
		if(used[u]){
			continue;
		}
		used[u] = true;
 
		for(int i = 0; i < adj[u].size(); i++){
			int to = adj[u][i];
			int j = idx[u][i];
 
			if(!used[to]){
				q.push(to);
				v.push_back({j, to});
			}
		}
	}
 
	return v;
}
 
int away(int x, const vector<int> &U, const vector<int> &V){
	vector<pair<int, int> > v = bfs(x);
 
	while((int)v.size() != m);

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

		for(int 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){
	n = N;
	m = U.size();
 
	for(int 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;
 
	int l = 0, r = m - 1;
 
	while(l != r){
		int mid = (l + r) / 2;
 
		for(int i = 0; i < m; i++){
			w[i] = 0; 
		}
		for(int i = mid + 1; i <= r; i++){
			w[i] = 1;
		}
 
		long long score = ask(w);
		score -= sm;
 
		if(score){
			l = mid + 1;
		}
		else{
			r = mid;
		}
	}
 
	int 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<int, int> > bfs(int)':
highway.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < adj[u].size(); i++){
                  ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5104 KB Output is correct
2 Correct 7 ms 5020 KB Output is correct
3 Correct 6 ms 5024 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 7 ms 5028 KB Output is correct
6 Correct 7 ms 5020 KB Output is correct
7 Correct 7 ms 5024 KB Output is correct
8 Correct 7 ms 5028 KB Output is correct
9 Correct 7 ms 5020 KB Output is correct
10 Correct 7 ms 5028 KB Output is correct
11 Correct 7 ms 5104 KB Output is correct
12 Correct 6 ms 5024 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5100 KB Output is correct
2 Correct 41 ms 6024 KB Output is correct
3 Correct 287 ms 14480 KB Output is correct
4 Correct 321 ms 14468 KB Output is correct
5 Correct 289 ms 14572 KB Output is correct
6 Correct 313 ms 14464 KB Output is correct
7 Correct 323 ms 14460 KB Output is correct
8 Correct 268 ms 14464 KB Output is correct
9 Correct 262 ms 14460 KB Output is correct
10 Correct 305 ms 14448 KB Output is correct
11 Correct 337 ms 14260 KB Output is correct
12 Correct 341 ms 14252 KB Output is correct
13 Correct 307 ms 14256 KB Output is correct
14 Correct 347 ms 14284 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 6056 KB Output is correct
2 Correct 52 ms 7084 KB Output is correct
3 Correct 101 ms 7928 KB Output is correct
4 Correct 279 ms 14268 KB Output is correct
5 Correct 189 ms 14256 KB Output is correct
6 Correct 199 ms 14268 KB Output is correct
7 Correct 175 ms 14192 KB Output is correct
8 Correct 153 ms 14272 KB Output is correct
9 Correct 138 ms 14260 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5096 KB Output is correct
2 Correct 28 ms 6016 KB Output is correct
3 Correct 250 ms 12604 KB Output is correct
4 Correct 340 ms 14460 KB Output is correct
5 Correct 223 ms 14464 KB Output is correct
6 Correct 221 ms 14472 KB Output is correct
7 Correct 205 ms 14448 KB Output is correct
8 Correct 291 ms 14444 KB Output is correct
9 Correct 282 ms 14460 KB Output is correct
10 Correct 269 ms 14448 KB Output is correct
11 Correct 236 ms 14260 KB Output is correct
12 Correct 361 ms 14256 KB Output is correct
13 Correct 354 ms 14252 KB Output is correct
14 Correct 363 ms 14272 KB Output is correct
15 Correct 215 ms 14452 KB Output is correct
16 Correct 229 ms 14460 KB Output is correct
17 Correct 304 ms 14256 KB Output is correct
18 Correct 194 ms 14280 KB Output is correct
19 Correct 306 ms 14464 KB Output is correct
20 Correct 311 ms 14260 KB Output is correct
21 Correct 313 ms 14964 KB Output is correct
22 Correct 188 ms 14972 KB Output is correct
23 Correct 264 ms 14964 KB Output is correct
24 Correct 350 ms 14924 KB Output is correct
25 Correct 315 ms 14356 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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