제출 #622874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
622874		yanndev	Stations (IOI20_stations)	C++17	36.32 / 100	800 ms	784 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int MX = 1042;

int in[MX];
int out[MX];
int dfsT = 0;
vector<int> adj[MX];

void dfs(int node, int par) {
	//cout << "cur " << node << '\n';
	in[node] = dfsT++;
	for (auto& x: adj[node])
		if (x != par)
			dfs(x, node);
	out[node] = dfsT;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	//cout << "called\n";
	dfsT = 0;
	vector<int> labels(n);

	for (int i = 0; i < n; i++)
		adj[i].clear();

	for (int i = 0; i + 1 < n; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	dfs(0, -1);

	for (int i = 0; i < n; i++)
		labels[i] = in[i] * 1001 + out[i];
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	vector<pair<int, int>> times {};

	int sIn = s / 1001;
	int sOut = s % 1001;
	int tIn = t / 1001;
	int tOut = t % 1001;

	for (auto& x: c)
		times.push_back({x / 1001, x % 1001});
	
	int par = -1;
	for (auto& x: times) {
		if (sIn <= x.fi) {
			if (x.fi <= tIn && tOut <= x.se)
				return x.fi * 1001 + x.se;
		} else {
			par = x.fi * 1001 + x.se;
		}
	}

	return par;
}

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

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:47:6: warning: unused variable 'sOut' [-Wunused-variable]
   47 |  int sOut = s % 1001;
      |      ^~~~

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