제출 #772541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772541		ono_de206	Stations (IOI20_stations)	C++14	0 / 100	1 ms	336 KiB

stations

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

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> g(n);
	for(int i = 0; i < n - 1; i++) {
		g[u[i]].pb(v[i]);
		g[v[i]].pb(u[i]);
	}
	int t = 0;
	vector<int> ret(n);
	function<void(int, int, bool)> dfs = [&](int to, int fr, bool fl) {
		if(fl) ret[to] = t++;
		fl = !fl;
		for(int x : g[to]) {
			if(x == fr) continue;
			dfs(x, to, fl);
		}
		if(fl) ret[to] = t++;
	};
	dfs(0, -1, false);
	for(int i = 0; i < n; i++) {
		cout << ret[i] << ' ';
	}
	cout << '\n';
	return ret;
}

int find_next_station(int s, int t, vector<int> c) {
	if(c.back() > s) {
		for(int i = 0; i + 1 < c.size(); i++) {
			if(t >= s && t <= c[i]) return c[i];
		}
		return c.back();
	} else {
		for(int i = (int)c.size() - 1; i > 0; i--) {
			if(t >= c[i] && t <= s) return c[i];
		}
		return c[0];
	}
	return 69;
}

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

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

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