oj.uz

답안 #121613

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121613 2019-06-26T20:40:43 Z Sorting 통행료 (IOI18_highway) C++14
51 / 100
 322 ms 16968 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;

		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(V[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:41: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 5024 KB Output is correct
2 Correct 6 ms 5028 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5028 KB Output is correct
5 Correct 6 ms 5028 KB Output is correct
6 Correct 6 ms 5116 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5032 KB Output is correct
10 Correct 6 ms 5024 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5108 KB Output is correct
2 Correct 25 ms 6284 KB Output is correct
3 Correct 246 ms 16212 KB Output is correct
4 Correct 264 ms 16324 KB Output is correct
5 Correct 256 ms 16212 KB Output is correct
6 Correct 262 ms 16220 KB Output is correct
7 Correct 246 ms 16272 KB Output is correct
8 Correct 314 ms 16232 KB Output is correct
9 Correct 280 ms 16228 KB Output is correct
10 Correct 267 ms 16360 KB Output is correct
11 Correct 257 ms 16004 KB Output is correct
12 Correct 322 ms 15980 KB Output is correct
13 Correct 259 ms 16004 KB Output is correct
14 Correct 281 ms 15992 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 6248 KB Output is correct
2 Correct 49 ms 7536 KB Output is correct
3 Correct 67 ms 8440 KB Output is correct
4 Correct 182 ms 16000 KB Output is correct
5 Correct 213 ms 15992 KB Output is correct
6 Correct 183 ms 16016 KB Output is correct
7 Correct 163 ms 16008 KB Output is correct
8 Correct 229 ms 16020 KB Output is correct
9 Correct 162 ms 15988 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5032 KB Output is correct
2 Correct 23 ms 6272 KB Output is correct
3 Correct 192 ms 14164 KB Output is correct
4 Correct 259 ms 16208 KB Output is correct
5 Correct 252 ms 16228 KB Output is correct
6 Correct 254 ms 16212 KB Output is correct
7 Correct 240 ms 16224 KB Output is correct
8 Correct 234 ms 16192 KB Output is correct
9 Correct 241 ms 16228 KB Output is correct
10 Correct 232 ms 16248 KB Output is correct
11 Correct 251 ms 16092 KB Output is correct
12 Correct 252 ms 16000 KB Output is correct
13 Correct 252 ms 16052 KB Output is correct
14 Correct 228 ms 15992 KB Output is correct
15 Correct 214 ms 16224 KB Output is correct
16 Correct 245 ms 16236 KB Output is correct
17 Correct 257 ms 16012 KB Output is correct
18 Correct 211 ms 16084 KB Output is correct
19 Correct 235 ms 16232 KB Output is correct
20 Correct 242 ms 16104 KB Output is correct
21 Correct 205 ms 16940 KB Output is correct
22 Correct 215 ms 16944 KB Output is correct
23 Correct 218 ms 16968 KB Output is correct
24 Correct 209 ms 16724 KB Output is correct
25 Correct 285 ms 16108 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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