| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 427315 | 2021-06-14T14:15:03 Z | AugustinasJucas | 기지국 (IOI20_stations) | C++14 | 0 ms | 0 KB |
//#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int dydis = 1000;
vector<int> gr[dydis];
int enter[dydis];
int leave[dydis];
vector<int> ret (dydis);
int dbInd = 0;
void dfs(int v, int came){
enter[v] = dbInd++;
for(auto x : gr[v]){
if(x == came) continue;
dfs(x, v);
}
leave[v] = dbInd;
ret[v] = enter[v] * dydis + leave[v] - 1;
//cout << "enter " << v << " - " << enter[v] << ", o leave " << leave[v]-1 << endl;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i = 0; i < n; i++){
gr[i].clear();
gr[i].clear();
}
dbInd = 0
ret.resize(n);
for(int i = 0; i < n-1; i++){
gr[u[i]].push_back(v[i]);
gr[v[i]].push_back(u[i]);
}
dfs(0, -1);
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
int enterS = s / 1000;
int leaveS = s % 1000;
int enterT = t / 1000;
int leaveT = t % 1000;
// cout << "kitas einant is " << s << " i " << t << " yra:\n";
if(enterS <= enterT && leaveT <= leaveS){
// cout << enterS << " yra " << enterT << " tevas\n";
for(auto x : c){
int e = x / 1000;
int l = x % 1000;
if(e <= enterT && leaveT <= l && !(e <= enterS && leaveS <= l)){
// cout << "ret " << x << endl << endl;
return x;
}
}
}else{ // eisiu aukstyn
for(auto x : c){
int e = x / 1000;
int l = x % 1000;
if(e <= enterS && leaveS <= l){
// cout << "ret " << x << endl << endl;
return x;
}
}
}
return c[0];
}