oj.uz

답안 #429301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
429301 2021-06-15T20:20:16 Z abdzag 기지국 (IOI20_stations) C++17
0 / 100
 1 ms 412 KB 
#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;
	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.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 324 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 412 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 320 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 284 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -