제출 #429302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429302		abdzag	기지국 (IOI20_stations)	C++17	8 / 100	1184 ms	528 KiB

stations

#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#include "stations.h"
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define trav(a,v) for(auto& a: v)
#define sz(v) v.size()
#define all(v) v.begin(),v.end()
#define vi vector<int>

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const long long inf = 2e9;

using namespace std;

vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> ans(n);
	rep(i, 0, n)ans[i] = i;
	return ans;
}
bool dfs(ll cur, ll wanted, vector<bool>& visited) {
	if (visited[cur])return 0;
	if (cur == wanted)return 1;
	if (cur > 1000)return 0;
	visited[cur] = 1;
	bool ans = 0;
	ans = ans || dfs(cur*2+1, wanted, visited);
	ans = ans || dfs(cur*2+2, wanted, visited);
	if(cur!=0)ans = ans || dfs((cur - 1) / 2, wanted, visited);
	return ans;
}
int find_next_station(int s, int t, vector<int> c) {
	vector<bool> visited(1001);
	visited[s] = 1;
	ll ans = -1;
	trav(a, c) {
		if (dfs(a, t, visited)) {
			ans = a;
			break;
		}
	}
	return ans;
}

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