제출 #1311291

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311291		hmms127	Stations (IOI20_stations)	C++20	100 / 100	395 ms	584 KiB

stations

//#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int N=1e3+5;
vector<int>labels;vector<vector<int>>adj;
int cnt=0;
void dfs(int node,int par,int col){
    if(col==1)labels[node]=cnt++;
    for(auto it:adj[node])if(it!=par)dfs(it,node,col^1);
    if(col==0)labels[node]=cnt++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    labels.resize(n);
    adj.assign(n,{});
    cnt=0;
	for(int i=0;i<n-1;i++){
	    adj[u[i]].pb(v[i]);
	    adj[v[i]].pb(u[i]);
	}
	dfs(0,-1,0);
	return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
    if(c[0]>s){
        if(t<s)return c.back();
        for(auto it:c)if(it>=t)return it;
        return c.back();
    }
    else {
        if(t>s)return c[0];
        for(int i=c.size()-1;i>=0;i--){
            if(c[i]<=t)return c[i];
        }
        return c[0];
        
    }
    return s;
}

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