제출 #1239908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239908		moondarkside	Stations (IOI20_stations)	C++20	100 / 100	307 ms	624 KiB

stations

#include<bits/stdc++.h>
using namespace std;
#define v vector<int>
#define vv vector<v>
#define I int
#define r return
vv N;v V;I d(I x,I p,I e,bool t){if(t==false){V[x]=e;I c=1+e;for(I i=0;i<N[x].size();i++){if(N[x][i]!=p){c+=d(N[x][i],x,c,true);}}r c-e;}I c=e;for(I i=0;i<N[x].size();i++){if(N[x][i]!=p){c += d(N[x][i],x,c,false);}}V[x]=c;c++;r c-e;}v label(I n,I k,v u,v P){N=vv(n);for(I i=0;i<n-1;i++){N[u[i]].push_back(P[i]);N[P[i]].push_back(u[i]);}V=v(n);d(0,-1,0,false);r V;}I find_next_station(I s,I t,v c){I l=c.size()-1;if(s<c[0]){if(t<s){r c[l];}for(I i=0;i<l;i++){if(t<=c[i]){r c[i];}}r c[l];}if(t>s){r c[0];}for(I i=l;i>0;i--){if(t>=c[i]){r c[i];}}r c[0];}

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