제출 #1063717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1063717		aaaaaarroz	Split the Attractions (IOI19_split)	C++17	0 / 100	1 ms	348 KiB

split

#include "split.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<vector<int>>graph(n,vector<int>());
	for(int i=0;i<q.size();i++){
		graph[p[i]].push_back(q[i]);
		graph[q[i]].push_back(p[i]);
	}
	int pivot=0;
	vector<int>nodes;
	queue<int>cola;
	cola.push(pivot);
	vector<bool>v(n,false);
	v[pivot]=true;
	nodes.push_back(pivot);
	while(!cola.empty()&&nodes.size()<max(b,c)){
		int nodo=cola.front();
		cola.pop();
		nodes.push_back(nodo);
		for(int vecino:graph[nodo]){
			if(!v[vecino]){
				v[vecino]=true;
				cola.push(vecino);
			}
		}
	}
	vector<int>ans(n,0);
	if(b>c){
		for(int nodo:nodes){
			ans[nodo]=2;
		}
		for(int i=0;i<n;i++){
			if(ans[i]==0){
				ans[i]=3;
			}
		}
		for(int i=0;i<n;i++){
			if(ans[i]==3){
				ans[i]=1;
				break;
			}
		}
	}
	else{
		for(int nodo:nodes){
			ans[nodo]=3;
		}
		for(int i=0;i<n;i++){
			if(ans[i]==0){
				ans[i]=2;
			}
		}
		for(int i=0;i<n;i++){
			if(ans[i]==2){
				ans[i]=1;
				break;
			}
		}
	}
	return ans;
}

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:6:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |  for(int i=0;i<q.size();i++){
      |              ~^~~~~~~~~
split.cpp:17:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'const int' [-Wsign-compare]
   17 |  while(!cola.empty()&&nodes.size()<max(b,c)){
      |                       ~~~~~~~~~~~~^~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36