oj.uz

답안 #121487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121487 2019-06-26T14:35:38 Z Sorting 통행료 (IOI18_highway) C++14
51 / 100
 316 ms 16720 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();
 
long long n, m;
vector<int> adj[MAXN], idx[MAXN], w;
bool used[MAXN];

long long a, b;
long long sm;
 
vector<pair<long long, long long> > bfs(long long x){
	queue<long long> q;
 
	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;
 
		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);
				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:40: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

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5104 KB Output is correct
2 Correct 20 ms 6296 KB Output is correct
3 Correct 263 ms 16232 KB Output is correct
4 Correct 245 ms 16208 KB Output is correct
5 Correct 210 ms 16180 KB Output is correct
6 Correct 316 ms 16208 KB Output is correct
7 Correct 273 ms 16196 KB Output is correct
8 Correct 192 ms 16208 KB Output is correct
9 Correct 244 ms 16200 KB Output is correct
10 Correct 250 ms 16196 KB Output is correct
11 Correct 246 ms 16008 KB Output is correct
12 Correct 203 ms 15996 KB Output is correct
13 Correct 255 ms 16012 KB Output is correct
14 Correct 216 ms 16008 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 6216 KB Output is correct
2 Correct 58 ms 7476 KB Output is correct
3 Correct 65 ms 8424 KB Output is correct
4 Correct 204 ms 15992 KB Output is correct
5 Correct 185 ms 16096 KB Output is correct
6 Correct 184 ms 16004 KB Output is correct
7 Correct 111 ms 16008 KB Output is correct
8 Correct 206 ms 15992 KB Output is correct
9 Correct 134 ms 15988 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 18 ms 6264 KB Output is correct
3 Correct 161 ms 14192 KB Output is correct
4 Correct 259 ms 16184 KB Output is correct
5 Correct 213 ms 16184 KB Output is correct
6 Correct 206 ms 16188 KB Output is correct
7 Correct 230 ms 16196 KB Output is correct
8 Correct 240 ms 16192 KB Output is correct
9 Correct 288 ms 16216 KB Output is correct
10 Correct 252 ms 16212 KB Output is correct
11 Correct 283 ms 16060 KB Output is correct
12 Correct 238 ms 16108 KB Output is correct
13 Correct 272 ms 16092 KB Output is correct
14 Correct 262 ms 16004 KB Output is correct
15 Correct 219 ms 16196 KB Output is correct
16 Correct 228 ms 16220 KB Output is correct
17 Correct 277 ms 15996 KB Output is correct
18 Correct 194 ms 16116 KB Output is correct
19 Correct 234 ms 16212 KB Output is correct
20 Correct 235 ms 16116 KB Output is correct
21 Correct 210 ms 16708 KB Output is correct
22 Correct 201 ms 16708 KB Output is correct
23 Correct 197 ms 16720 KB Output is correct
24 Correct 219 ms 16648 KB Output is correct
25 Correct 234 ms 16092 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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