제출 #334081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334081		nicholask	통행료 (IOI18_highway)	C++14	18 / 100	127 ms	8548 KiB

highway

#include "highway.h"
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
vector <pair <int,int> > g[90000]; //first: connection to which node, second: edge no.
long long dist;
vector <pair <int,int> > poss;
void dfs(int cur,int prev,int d){
	for (auto&i:g[cur]){
		if (i.x==prev) continue;
		if (d+1==dist) poss.push_back({i.y,i.x});
		else dfs(i.x,cur,d+1);
	}
}
void find_pair(int n,vector <int> u,vector <int> v,int A,int b){
	long long a=A;
	int m=u.size();
	for (int i=0; i<m; i++){
		g[u[i]].push_back({v[i],i});
		g[v[i]].push_back({u[i],i});
	}
	vector <int> query(m,0);
	dist=ask(query);
	dist/=a;
	bool can=1;
	for (int i=0; i<m; i++){
		if (u[i]!=i||v[i]!=i+1){
			can=0;
			break;
		}
	}
	if (can){ //subtask 3
		vector <int> possible;
		for (int i=0; i<n; i++) possible.push_back(i);
		while (possible.size()>1){
			vector <int> f,s;
			for (int i=0; i<possible.size(); i++){
				if (i<(possible.size()/2)) f.push_back(possible[i]);
				else s.push_back(possible[i]);
			}
			vector <int> query(m,0);
			for (auto&i:f) query[i]=1;
			if (ask(query)==dist*a) possible=s;
			else possible=f;
		}
		answer(possible[0],possible[0]+dist);
	} else {
		dfs(0,-1,0);
		while (poss.size()>1){
			vector <pair <int,int> > f,s;
			for (int i=0; i<poss.size(); i++){
				if (i<(poss.size()/2)) f.push_back(poss[i]);
				else s.push_back(poss[i]);
			}
			vector <int> query(m,0);
			for (auto&i:f) query[i.x]=1;
			if (ask(query)==dist*a) poss=s;
			else poss=f;
		}
		answer(0,poss[0].y);
	}
}

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

highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |    for (int i=0; i<possible.size(); i++){
      |                  ~^~~~~~~~~~~~~~~~
highway.cpp:39:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     if (i<(possible.size()/2)) f.push_back(possible[i]);
      |         ~^~~~~~~~~~~~~~~~~~~~
highway.cpp:52:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |    for (int i=0; i<poss.size(); i++){
      |                  ~^~~~~~~~~~~~
highway.cpp:53:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     if (i<(poss.size()/2)) f.push_back(poss[i]);
      |         ~^~~~~~~~~~~~~~~~

• 서브태스크 1: 5 / 5
• 서브태스크 2: 7 / 7
• 서브태스크 3: 6 / 6
• 서브태스크 4: 0 / 33
• 서브태스크 5: 0 / 18
• 서브태스크 6: 0 / 31