제출 #264866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
264866		RuDi24	통행료 (IOI18_highway)	C++14	0 / 100	26 ms	1736 KiB

highway

#include "highway.h"
#include <iostream>
#include <queue>
#include <map>
using namespace std;


void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
	int M = U.size();
	map <int,vector<int>> gr;
	for(int i = 0;i < M;i++){
		gr[U[i]].push_back(V[i]);
		gr[V[i]].push_back(U[i]);	
	}
	queue <int> qu;
	vector<int> dis(N);
	vector<int> vis(N);
	qu.push(0);
	int dist = 0;
	while(!qu.empty()) {
		int sz = qu.size();

		while(sz--){
		int t = qu.front();
		qu.pop();
		for(int i = 0;i < gr[t].size();i++) if(!vis[gr[t][i]]) {
			qu.push(gr[t][i]);
			vis[gr[t][i]] = 1;
			}
		dis[t] = dist;
		}
		dist++;
	}
	vector<int> w(M,1);

	int b = ask(w);
	for(int i = 0;i < M;i++) w[i] = 0;
	int a = ask(w);
	for(int i = 0;i < N;i++){
		if(dis[i]*A == a && dis[i]*B == b){
			answer(0,i);
			return ;
		}
	}
}

컴파일 시 표준 에러 (stderr) 메시지

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:26:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for(int i = 0;i < gr[t].size();i++) if(!vis[gr[t][i]]) {
      |                 ~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31