제출 #1241240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241240		m.zeeshanrashid	Stations (IOI20_stations)	C++20	0 / 100	3058 ms	1942372 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;


const int N=1005;
vector<int>lab(N);
int t=1;
vector<int>G[N];

void dfs(int u=0,int p=-1,bool f=1){
	if(f){
		lab[u]=t;
		t++;
	}
	for(auto v:G[u]){
		if(v==p) continue;
		dfs(v,u,!f);
	}
	if(!f){
		lab[u]=t;
		t++;
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for(int i=0;i<n-1;i++){
		G[u[i]].push_back(v[i]);
		G[v[i]].push_back(u[i]);
	}
	dfs();
	vector<int>ans;
	for(int i=0;i<n;i++) ans.push_back(lab[i]);
	return ans;
	for(int i=0;i<n;i++) G[i].clear();
}

int find_next_station(int s, int t, vector<int> c) {
	int n=c.size();
	if(n==1) return c[0];
	if(s<c[0]){
		c.insert(begin(c),s);
		for(int i=1;i<n;i++){
			if(t<=c[i] and t>c[i-1]) return c[i];
		}
		return c[n];
	}
	c.insert(end(c)-1,s);
	for(int i=n-1;i>0;i--){
		if(t>=c[i] and t<c[i+1]) return c[i];
	}
	return c[0];
}

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