제출 #1051487

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1051487		TahirAliyev	기지국 (IOI20_stations)	C++17	100 / 100	517 ms	1304 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 1005;
vector<int> g[MAX];	
int in[MAX], out[MAX];
int col[MAX];
int t = 0;
void dfs(int node, int p){
	col[node] = col[p] ^ 1;
	in[node] = ++t;
	for(int to : g[node]){
		if(to == p) continue;
		dfs(to, node);
	}
	out[node] = t++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for(int i = 0; i < n; i++) g[i].clear();
	for(int i = 0; i < n - 1; i++){
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	dfs(1, 1);
	vector<int> L;
	map<int, int> mp;
	for(int i = 0; i < n; i++){
		if(col[i]){
			L.push_back(in[i]);
			mp[in[i]];
		} 
		else{
			L.push_back(out[i]); 
			mp[out[i]];
		}
	}
	int t = 0;
	for(auto a : mp) mp[a.first] = t++;
	for(int i = 0; i < n; i++){
		L[i] = mp[L[i]];
	}
	return L;
}

int find_next_station(int s, int t, vector<int> c) {
	sort(c.begin(), c.end());
	if(s < c[0]){
		int in = s + 1;
		for(int i = 0; i < c.size() - 1; i++){
			if(in <= t && t <= c[i]){
				return c[i];
			}
			in = c[i] + 1;
		}
		return c.back();
	}
	else{
		sort(c.rbegin(), c.rend());
		int out = s - 1;
		for(int i = 0; i < c.size() - 1; i++){
			if(c[i] <= t && t <= out) return c[i];
			out = c[i] - 1;
		}
		return c.back();
	}
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i = 0; i < c.size() - 1; i++){
      |                  ~~^~~~~~~~~~~~~~
stations.cpp:62:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for(int i = 0; i < c.size() - 1; i++){
      |                  ~~^~~~~~~~~~~~~~

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