제출 #380288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
380288		SuhaibSawalha1	Stations (IOI20_stations)	C++17	0 / 100	940 ms	1280 KiB

stations

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

vector<vector<int>> adj;
int n;
vector<int> lb;

bool find (int u, int p, int t) {
	if (u == t) {
		return 1;
	}
	for (int v : adj[u]) {
		if (v ^ p && find(v, u, t)) {
			return 1;
		}
	}
	return 0;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	::n = n;
	adj.clear();
	adj.resize(n);
	lb.resize(n);
	for (int i = 0; i < n - 1; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	iota(lb.begin(), lb.end(), 0);
	return lb;
}

int find_next_station(int s, int t, vector<int> c) {
	return find(c[0], s, t) ? c[0] : c[1];
}

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