제출 #1205399

#제출 시각아이디문제언어결과실행 시간메모리
1205399bangan기지국 (IOI20_stations)C++20
8 / 100
304 ms440 KiB
#include "stations.h"
#include <vector>
#include <bits/stdc++.h>

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> id(n);
	iota(id.begin(), id.end(), 0);
	return id;
}

int find_next_station(int s, int t, std::vector<int> c) {
	s++;
	t++;
	for (int& v : c) {
		v++;
	}

	while (t > s) {
		for (int v : c) {
			if (v == t) {
				return v - 1;
			}
		}
		t >>= 1;
	}

	return (s >> 1) - 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...