제출 #1018098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018098		Boas	Stations (IOI20_stations)	C++17	0 / 100	2396 ms	964 KiB

stations

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

#define loop(x, i) for (int i = 0; i < x; i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef set<int> si;
typedef vector<vi> vvi;

vi label(int n, int k, vi u, vi v)
{
	vi labels(n);
	for (int i = 0; i < n; i++)
	{
		labels[i] = i;
	}
	return labels;
}

int DFS(int i, int t, vvi &adj, int prev = -1)
{
	for (int j : adj[i])
	{
		if (j == prev)
			continue;
		if (j == t)
			return j;
		int ans = DFS(j, t, adj, i);
		if (ans != -1)
			return ans;
	}
	return -1;
}

int find_next_station(int s, int t, vi c)
{
	int n = max(s, t) + 1;
	vvi adj(n + 2);
	loop(n, i)
	{
		adj[i + 1].pb(i / 2);
		adj[i / 2].pb(i + 1);
	}
	return DFS(s, t, adj);
}

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