oj.uz

답안 #787114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787114 2023-07-18T20:28:25 Z APROHACK 통행료 (IOI18_highway) C++17
51 / 100
 130 ms 16320 KB 
#include "highway.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
ll m, n, a, b, largo;
vector<int>adj[100000];
vector<int>idx[100000];


void llenar(int dd, int ht, int v, vector<int>&w){
	for(int i = dd ; i <= ht ; i ++)w[i] = v;
}

void find_edje(int &ejeMedio, vector<int>&w){
	int li = 0, ls = m-1, pos;
	pos = (li + ls)/2;
	ll tried[130003];
	for(int i = 0 ; i < m ; i ++)tried[i] = -1;
	while(li + 1 < ls){
		llenar(0, m-1, 0, w);
		llenar(0, pos, 1, w);
		ll res = ask(w);
		tried[pos] = res;
		if(res > largo*a){
			ls = pos;
		}else{
			li = pos + 1;
		}
		pos = (li + ls ) / 2 ;
	}
	if(tried[li] == -1){
		llenar(0, m-1, 0, w);
		llenar(0, pos, 1, w);
		tried[li] = ask(w);
	}
	if(tried[li] > largo*a){
		ejeMedio = li;
	}else ejeMedio = ls;
}

vector<int>getEdjes(int dd, int banned, vector<int>&dist, vector<int>&nodes){
	queue<int>cola;
	dist.clear();
	nodes.clear();
	vector<int>ans;
	for(int i = 0 ; i < n ; i ++)dist.pb(INT_MAX);
	cola.push(dd);
	dist[dd] = 0;
	bool vis[n+1];
	memset(vis, false, sizeof vis);
	vis[dd] = true;
	while(!cola.empty()){
		int cur = cola.front();
		cola.pop();
		for(int i = 0 ; i < adj[cur].size() ; i ++){
			if(idx[cur][i] == banned)continue;
			if(vis[adj[cur][i]])continue;
			vis[adj[cur][i]] = true;
			dist[adj[cur][i]] = dist[cur] + 1;
			cola.push(adj[cur][i]);
			ans.pb(idx[cur][i]);
			nodes.pb(adj[cur][i]);
		}
	}
	
	return ans;
}

int cualAfecta(vector<int>&nodos, vector<int>&ejes, vector<int>&w){
	int li = 0, ls = ejes.size()-1;
	int pos = (li + ls)/2;
	while(li + 1 < ls){
		llenar(0, m-1, 0, w);
		for(int i = li ; i <= pos ; i ++)w[ejes[i]] = 1;
		if(ask(w) > largo*a){
			ls = pos;
		}else{
			li = pos + 1;
		}
		pos = (li + ls)/2;
	}
	if(li == ls)return nodos[li];
	llenar(0, m-1, 0, w);
	w[ejes[li]] = 1;
	if(ask(w) > largo * a)return nodos[li];
	else return nodos[ls];
}

void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	n = N;
	m = U.size();
	a = A;
	b = B;
	vector<int>w;
	for(int i = 0 ; i < m ; i ++){
		adj[U[i]].pb(V[i]);
		adj[V[i]].pb(U[i]);
		idx[U[i]].pb(i);
		idx[V[i]].pb(i);
		w.pb(0);
	}
	largo = ask(w)/a;
	int ejeMedio;
	find_edje(ejeMedio, w);
	//cout << ejeMedio << endl;
	//cout << U[ejeMedio] << " " << V[ejeMedio] << endl;
	
	
	vector<int>distancias, nodos, ejes;
	ejes = getEdjes(V[ejeMedio], ejeMedio, distancias, nodos);
	llenar(0, m-1, 0, w);
	for(auto i : ejes)w[i] = 1;
	ll distkt = (ask(w)-largo*a)/(b-a);
	//cout << "dist " << V[ejeMedio] << " = " << distkt << endl;
	int s, t;
	if(distkt == 0){
		t = V[ejeMedio];
	}else{
		vector<int>tempNodos, tempEje;
		for(int i = 0 ; i < nodos.size() ; i ++){
			if(distancias[nodos[i]] == distkt){
				tempNodos.pb(nodos[i]);
				tempEje.pb(ejes[i]);
			}
		}
		//cout << " opciones " ;
		//for(auto i : tempNodos)cout << i << " " ;
		//cout << endl;
		
		t = cualAfecta(tempNodos, tempEje, w);
	}
	ejes = getEdjes(U[ejeMedio], ejeMedio, distancias, nodos);
	llenar(0, m-1, 0, w);
	for(auto i : ejes)w[i] = 1;
	distkt = (ask(w)-largo*a)/(b-a);
	//cout << "dist " << U[ejeMedio] << " = " << distkt << endl;
	
	if(distkt == 0){
		s = U[ejeMedio];
	}else{
		vector<int>tempNodos, tempEje;
		for(int i = 0 ; i < nodos.size() ; i ++){
			if(distancias[nodos[i]] == distkt){
				tempNodos.pb(nodos[i]);
				tempEje.pb(ejes[i]);
			}
		}
		
		s = cualAfecta(tempNodos, tempEje, w);
	}
	
	//cout << s << " " << t << endl;
	answer(s, t);
	

}

Compilation message

highway.cpp: In function 'std::vector<int> getEdjes(int, int, std::vector<int>&, std::vector<int>&)':
highway.cpp:58:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i = 0 ; i < adj[cur].size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~~~~
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:123:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |   for(int i = 0 ; i < nodos.size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~
highway.cpp:145:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |   for(int i = 0 ; i < nodos.size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5968 KB Output is correct
2 Correct 3 ms 5900 KB Output is correct
3 Correct 3 ms 5968 KB Output is correct
4 Correct 2 ms 5968 KB Output is correct
5 Correct 3 ms 5904 KB Output is correct
6 Correct 3 ms 5968 KB Output is correct
7 Correct 3 ms 5952 KB Output is correct
8 Correct 3 ms 5968 KB Output is correct
9 Correct 3 ms 5968 KB Output is correct
10 Correct 3 ms 5968 KB Output is correct
11 Correct 4 ms 5968 KB Output is correct
12 Correct 3 ms 5968 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6096 KB Output is correct
2 Correct 12 ms 6964 KB Output is correct
3 Correct 98 ms 15268 KB Output is correct
4 Correct 112 ms 15264 KB Output is correct
5 Correct 102 ms 15096 KB Output is correct
6 Correct 86 ms 15332 KB Output is correct
7 Correct 106 ms 15108 KB Output is correct
8 Correct 82 ms 15264 KB Output is correct
9 Correct 84 ms 15264 KB Output is correct
10 Correct 117 ms 15284 KB Output is correct
11 Correct 93 ms 14624 KB Output is correct
12 Correct 87 ms 15184 KB Output is correct
13 Correct 100 ms 14948 KB Output is correct
14 Correct 100 ms 14852 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6976 KB Output is correct
2 Correct 25 ms 7880 KB Output is correct
3 Correct 31 ms 8848 KB Output is correct
4 Correct 89 ms 14680 KB Output is correct
5 Correct 68 ms 14688 KB Output is correct
6 Correct 71 ms 14856 KB Output is correct
7 Correct 108 ms 14820 KB Output is correct
8 Correct 97 ms 14544 KB Output is correct
9 Correct 65 ms 15304 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6096 KB Output is correct
2 Correct 11 ms 6972 KB Output is correct
3 Correct 70 ms 13192 KB Output is correct
4 Correct 130 ms 15400 KB Output is correct
5 Correct 108 ms 15400 KB Output is correct
6 Correct 72 ms 15276 KB Output is correct
7 Correct 78 ms 15272 KB Output is correct
8 Correct 79 ms 15268 KB Output is correct
9 Correct 122 ms 15156 KB Output is correct
10 Correct 105 ms 15376 KB Output is correct
11 Correct 100 ms 14916 KB Output is correct
12 Correct 103 ms 14924 KB Output is correct
13 Correct 100 ms 15184 KB Output is correct
14 Correct 110 ms 14764 KB Output is correct
15 Correct 107 ms 15328 KB Output is correct
16 Correct 100 ms 15284 KB Output is correct
17 Correct 128 ms 14824 KB Output is correct
18 Correct 100 ms 14776 KB Output is correct
19 Correct 116 ms 15268 KB Output is correct
20 Correct 89 ms 14936 KB Output is correct
21 Correct 127 ms 16320 KB Output is correct
22 Correct 77 ms 16296 KB Output is correct
23 Correct 101 ms 15672 KB Output is correct
24 Correct 108 ms 15592 KB Output is correct
25 Correct 107 ms 15052 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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