Submission #1331049

#TimeUsernameProblemLanguageResultExecution timeMemory
1331049somefolkStations (IOI20_stations)C++20
8 / 100
390 ms444 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e3+5;

vector<int> label(int n, int k, vector<int> u, 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, vector<int> c){
	auto check = [&](int u, int end){
		if(u == end) return 1;
		while(end >= u){
			end = (end-1)/2;
			if(u == end) return 1;
		}
		return 0;
	};

	if((int)c.size() == 1){
		return c[0];
	} else if((int)c.size() == 2){
		if(check(c[1], t)) return c[1];
		return c[0];
	}

	if(check(c[1], t)) return c[1];
	else if(check(c[2], t)) return c[2];
	return c[0];
}
#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...