제출 #377813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377813		autumn_eel	기지국 (IOI20_stations)	C++14	0 / 100	988 ms	756 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<int(n);i++)
using namespace std;
typedef long long ll;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	vector<int>labels(n);
	rep(i,n)labels[i]=i;
	return labels;
	/*
	vector<vector<int>>E(n);
	vector<int>deg(n);
	rep(i,n-1){
		E[u[i]].push_back(v[i]);
		E[v[i]].push_back(u[i]);
		deg[u[i]]++;
		deg[v[i]]++;
	}
	int s=-1;
	rep(i,n){
		if(deg[i]==1){s=i;break;}
	}
	vector<int>vs;
	vector<int>labels(n,-1);

	rep(i,n){
		vs.push_back(s);
		labels[s]=i;
		for(int u:E[s]){
			if(labels[u]==-1){
				s=u;break;
			}
		}
	}

	return labels;*/
}

bool find(int r,int x){
	int L=r,R=r;
	while(r<=2000){
		if(L<=x&&x<=R)return true;
		L=L*2+1;
		R=R*2+2;
	}
	return false;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(find(s*2+1,t))return s*2+1;
	if(find(s*2+2,t))return s*2+2;
	return (s-1)/2;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61