제출 #350640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
350640		Kerim	Stations (IOI20_stations)	C++17	0 / 100	3016 ms	2097156 KiB

stations

#include "stations.h"
#include "bits/stdc++.h"
#define MAXN 1009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int n;
int tin[MAXN],tout[MAXN],T;
vector<int>adj[MAXN];
void dfs(int nd,int pr){
	tin[nd]=T++;
	tr(it,adj[nd])
		if(*it!=pr)
			dfs(*it,nd);
	tout[nd]=T++;	
}
vector<int> label(int N, int k,vector<int> u, std::vector<int> v) {
	n=N;
	for(int i=0;i<n-1;i++){
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	vector<int> labels(n);
	for (int i = 0; i < n; i++) {
		labels[i] = i;
	}
	dfs(0,-1);
	return labels;
}
bool ata(int x,int y){
	return (tin[x]<tin[y] and tout[y]<tout[x]);	
}
int find_next_station(int s, int t, vector<int> c) {
	return c[0];
}

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