Submission #308152

#	Time	Username	Problem	Language	Result	Execution time	Memory
308152		jwvg0425	Stations (IOI20_stations)	C++17	0 / 100	2 ms	896 KiB

stations

#include "stations.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

vector<int> edge[1005];
int in[1005], out[1005];
int vis = 0;

void dfs(int root)
{
	in[root] = vis;
	vis++;

	for (auto& e : edge[root])
	{
		edge[e].erase(find(all(edge[e]), root));
		dfs(e);
	}

	out[root] = vis;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
	for (int i = 0; i < n - 1; i++)
	{
		edge[u[i]].push_back(v[i]);
		edge[v[i]].push_back(u[i]);
	}

	dfs(0);

	vector<int> res(n);
	for (int i = 0; i < n; i++)
		res[i] = in[i] * 1000 + out[i];

	return res;
}

int find_next_station(int s, int t, vector<int> c)
{
	int ti = t / 1000;
	int to = t % 1000;
	int si = s / 1000;
	int so = s % 1000;
	int p = c[0];

	for (auto& e : c)
	{
		int ei = e / 1000;
		int eo = e % 1000;

		if (ei <= ti && eo >= to)
			return e;

		if (ei <= si && eo >= so)
			p = e;
	}

	return p;
}

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