제출 #1311401

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311401		hashim_bas	기지국 (IOI20_stations)	C++20	0 / 100	3062 ms	2162688 KiB

stations

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include "stations.h"
using namespace std;
// #define int long long
#define ll long long
#define ld long double
#define fi first
#define se second
#define mo 1000000007
#define pb push_back
#define all(x) x.begin(),x.end()
#define iter(i,st) auto i=st.begin(); i!=st.end();i++

int cntt=0 ;

void dfs(int nd,int pr,vector<vector<int> > &adj,vector<int> &lab,int dpth){
	if(!(dpth%2))lab[nd]=cntt++ ;
	for(auto &i : adj[nd]){
		if(i==pr)continue ;
		dfs(i,nd,adj,lab,dpth+1) ;
	}
	if(dpth%2)lab[nd]=cntt++ ;
	return ;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
    vector<vector<int> > adj(n) ;
	for (int i = 0; i < n; i++) {
		adj[u[i]].pb(v[i]) ;
        adj[v[i]].pb(u[i]) ;
	}
	dfs(0,0,adj,labels,0) ;
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	// sort(all(c)) ;
	int op,cl ;
	int n=c.size() ;
	if(n==1){
		return c[0] ;
	}
	if(c[0]>s){
		for(int i=0;i<n-1;i++){
			if(c[i]>t)return c[i] ;
		}
		return c[n-1] ;
	}
	else{
		for(int i=n-1;i>=0;i--){
			if(c[i]<t)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