제출 #421357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
421357		Trunkty	Stations (IOI20_stations)	C++14	100 / 100	1057 ms	888 KiB

stations

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int nextnum;
int arr[1005];
vector<int> pairs[1005];

void dfs(int par, int a, int dep){
	if(dep%2){
		arr[a] = nextnum;
		nextnum++;
	}
	for(int i:pairs[a]){
		if(i!=par){
			dfs(a,i,dep+1);
		}
	}
	if(dep%2==0){
		arr[a] = nextnum;
		nextnum++;
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v){
	nextnum = 0;
	for(int i=0;i<n;i++){
		pairs[i].clear();
	}
	for(int i=0;i<n-1;i++){
		pairs[u[i]].push_back(v[i]);
		pairs[v[i]].push_back(u[i]);
	}
	dfs(-1,0,1);
	vector<int> ans;
	for(int i=0;i<n;i++){
		ans.push_back(arr[i]);
	}
	return ans;
}

int find_next_station(int s, int t, vector<int> c){
	sort(c.begin(),c.end());
	if(s==0){
		for(int i:c){
			if(t<=i){
				return i;
			}
		}
	}
	else if(c.size()==1){
		return c[0];
	}
	else{
		if(c[0]<s){
			if(s<t){
				return c[0];
			}
			reverse(c.begin(),c.end());
			for(int i=0;i<c.size()-1;i++){
				if(c[i]<=t){
					return c[i];
				}
			}
			return c[c.size()-1];
		}
		else{
			if(s>t){
				return c[c.size()-1];
			}
			for(int i=0;i<c.size()-1;i++){
				if(c[i]>=t){
					return c[i];
				}
			}
			return c[c.size()-1];
		}
	}
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |    for(int i=0;i<c.size()-1;i++){
      |                ~^~~~~~~~~~~
stations.cpp:72:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    for(int i=0;i<c.size()-1;i++){
      |                ~^~~~~~~~~~~
stations.cpp:80:1: warning: control reaches end of non-void function [-Wreturn-type]
   80 | }
      | ^

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61