oj.uz

답안 #787127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787127 2023-07-18T20:53:40 Z APROHACK 통행료 (IOI18_highway) C++17
51 / 100
 124 ms 16408 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];
int keepBanned;


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, keepBanned-1, 1, 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 other, int ban, 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(other);
	cola.push(dd);
	dist[dd] = 0;
	bool vis[n+1];
	bool search[n+1];
	bool banned[m+1];
	memset(vis, false, sizeof vis);
	memset(search, false, sizeof search);
	memset(banned, false, sizeof banned);
	banned[ban] = true;
	vis[dd] = true;
	vis[other] = true;
	search[dd] = true;
	while(!cola.empty()){
		int cur = cola.front();
		cola.pop();
		for(int i = 0 ; i < adj[cur].size() ; i ++){
			if(banned[idx[cur][i]] )continue;
			if(vis[adj[cur][i]])continue;
			vis[adj[cur][i]] = true;
			if(search[cur]){
				search[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]);
			}else{
				cola.push(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);
		llenar(0, keepBanned -1 , 1, 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);
	keepBanned = ejeMedio;
	//cout << ejeMedio << endl;
	//cout << U[ejeMedio] << " " << V[ejeMedio] << endl;
	
	
	vector<int>distancias, nodos, ejes;
	ejes = getEdjes(V[ejeMedio], U[ejeMedio], ejeMedio, distancias, nodos);
	llenar(0, m-1, 0, w);
	llenar(0, keepBanned-1, 1, 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], V[ejeMedio], ejeMedio, distancias, nodos);
	llenar(0, m-1, 0, w);
	//llenar(0, keepBanned-1, 1, 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, int, std::vector<int>&, std::vector<int>&)':
highway.cpp:68:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   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:141:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |   for(int i = 0 ; i < nodos.size() ; i ++){
      |                   ~~^~~~~~~~~~~~~~
highway.cpp:164:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |   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 5968 KB Output is correct
3 Correct 2 ms 5900 KB Output is correct
4 Correct 3 ms 5968 KB Output is correct
5 Correct 3 ms 5904 KB Output is correct
6 Correct 2 ms 5968 KB Output is correct
7 Correct 3 ms 5968 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 3 ms 5968 KB Output is correct
12 Correct 4 ms 5968 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6112 KB Output is correct
2 Correct 14 ms 6992 KB Output is correct
3 Correct 116 ms 15268 KB Output is correct
4 Correct 102 ms 15304 KB Output is correct
5 Correct 114 ms 15284 KB Output is correct
6 Correct 114 ms 15272 KB Output is correct
7 Correct 83 ms 15272 KB Output is correct
8 Correct 104 ms 15268 KB Output is correct
9 Correct 102 ms 14996 KB Output is correct
10 Correct 123 ms 15320 KB Output is correct
11 Correct 122 ms 14680 KB Output is correct
12 Correct 103 ms 15320 KB Output is correct
13 Correct 104 ms 14952 KB Output is correct
14 Correct 118 ms 14888 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 6988 KB Output is correct
2 Correct 23 ms 7964 KB Output is correct
3 Correct 28 ms 8860 KB Output is correct
4 Correct 71 ms 14560 KB Output is correct
5 Correct 110 ms 14680 KB Output is correct
6 Correct 63 ms 14872 KB Output is correct
7 Correct 90 ms 14816 KB Output is correct
8 Correct 80 ms 14556 KB Output is correct
9 Correct 75 ms 15236 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6108 KB Output is correct
2 Correct 13 ms 6992 KB Output is correct
3 Correct 81 ms 13200 KB Output is correct
4 Correct 124 ms 15276 KB Output is correct
5 Correct 84 ms 15104 KB Output is correct
6 Correct 97 ms 15288 KB Output is correct
7 Correct 79 ms 15276 KB Output is correct
8 Correct 100 ms 15100 KB Output is correct
9 Correct 112 ms 15152 KB Output is correct
10 Correct 110 ms 15112 KB Output is correct
11 Correct 116 ms 15028 KB Output is correct
12 Correct 82 ms 14824 KB Output is correct
13 Correct 114 ms 15256 KB Output is correct
14 Correct 109 ms 14744 KB Output is correct
15 Correct 82 ms 15284 KB Output is correct
16 Correct 95 ms 15304 KB Output is correct
17 Correct 89 ms 14860 KB Output is correct
18 Correct 115 ms 14944 KB Output is correct
19 Correct 110 ms 15124 KB Output is correct
20 Correct 93 ms 14884 KB Output is correct
21 Correct 73 ms 16396 KB Output is correct
22 Correct 93 ms 16408 KB Output is correct
23 Correct 89 ms 15632 KB Output is correct
24 Correct 86 ms 15736 KB Output is correct
25 Correct 100 ms 14964 KB Output is correct

Subtask #5
0 / 18.0

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

Subtask #6
0 / 31.0

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