제출 #424006

#제출 시각아이디문제언어결과실행 시간메모리
424006lakshith_기지국 (IOI20_stations)C++14
8 / 100
1220 ms520 KiB
#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout <"checker reached " << a << "\n"

vector<vector<int>> adj(1000,vector<int>());


std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int> lbl(n);
	for(int i=0;i<n;i++)
		lbl[i] = i;
	return lbl;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int a =s,b=t;
	while(a>0){
		a= (a-1)/2;
		if(a==b)break;
	}
	if(a==b)return (s-1)/2;
	a=s,b=t;
	int p=b;
	while(b>0){
		p=b;
		b = (b-1)/2;
		if(a==b)break;
	}
	if(a==b)return p;
	return (s-1)/2;
}
#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...