제출 #1305412

#제출 시각아이디문제언어결과실행 시간메모리
1305412IUA_Hasin기지국 (IOI20_stations)C++20
0 / 100
3082 ms432 KiB
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {

	vector<int> labels(n);
	for(int i=0; i<n; i++){
		labels[i] = i;
	}

	return labels;
	
	
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size()==1) return c[0];

	set<int> st;
	for(int i=0; i<c.size(); i++){
		st.insert(c[i]);
	}

	int curr_s = s, curr_t = t;
	if(curr_s > curr_t){
		swap(curr_s, curr_t);
	}

	while(true){
		int a = curr_t/2;
		if(st.count(a)>0){
			return a;
		} else {
			curr_t = a;
		}

		if(curr_s > curr_t){
			swap(curr_s, curr_t);
		}
	}

}
#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...