제출 #1220817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220817		brinton	기지국 (IOI20_stations)	C++20	0 / 100	308 ms	608 KiB

stations

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

vector<int> label(int N, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> edges(N);
	for(int i = 0;i < u.size();i++){
		edges[u[i]].push_back(v[i]);
		edges[v[i]].push_back(u[i]);
	}
	vector<int> labels(N);
	vector<int> tin(N);
	vector<int> tout(N);

	int gt = 0;
	function<void(int,int,int)> dfs = [&](int cur,int par,int layer){
		tin[cur] = gt++;
		for(auto nxt:edges[cur]){
			if(nxt == par) continue;
			dfs(nxt,cur,1-layer);
		}
		tout[cur] = gt++;
		if(layer == 0) labels[cur] = tin[cur];
		else labels[cur] = tout[cur];
	};

	dfs(0,-1,0);
	// for(auto &i:tin) cout << i << " ";cout << endl;
	// for(auto &i:tout) cout << i << " ";cout << endl;
	// for(auto &i:labels) cout << i << " ";cout << endl;
	return labels;

	
}

int find_next_station(int s, int t, vector<int> c) {
	if(c.size() == 1){
		return c[0];
	}else if(s == 0){
		// root, odd layer;
		if(t <= c[0]) return c[0];
		for(int i = 0;i+1 < c.size();i++){
			if(t > c[i] && t <= c[i+1]) return c[i+1];
		}
	}else if(s < c[0]){
		// odd layer;
		if(t < s || t > c[c.size()-2]) return c.back();
		if(t > s && t <= c[0]) return c[0];
		for(int i = 0;i+1 < c.size();i++){
			if(t > c[i] && t <= c[i+1]) return c[i+1];
		}
	}else{
		// even layer
		if(t > s || t <= c[0]) return c[0];
		if(t < s && t >= c.back()) return c.back();
		for(int i = 1;i+1 < c.size();i++){
			if(t >= c[i] && t < c[i+1]) return c[i];
		}
	}
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
   60 | }
      | ^

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