| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1285425 | farica | 기지국 (IOI20_stations) | C++20 | 406 ms | 592 KiB |
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int cnt;
vi labels;
vector<vi>adjL;
int dfs(int pos, int state, int prev=-1) {
if(!state) labels[pos] = cnt++;
for(int adj: adjL[pos]) {
if(adj == prev) continue;
dfs(adj, (state+1)%2, pos);
}
if(state) labels[pos] = cnt++;
return cnt;
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.resize(n);
adjL.assign(n, vi());
for(int i=0; i<n-1; ++i) {
adjL[u[i]].push_back(v[i]);
adjL[v[i]].push_back(u[i]);
}
cnt = 0;
dfs(0, 0);
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int n = (int)c.size();
if(s < c[0]) { // s - in[s]
int prnt = c[n-1];
if(t < s or t >= c.back()) return prnt;
for(int i=0; i<n; ++i) {
if(t <= c[i]) return c[i];
}
} else { // s - ot[s]
int prnt = c[0];
if(c[0] >= t or t > s) return prnt;
for(int i=1; i<n; ++i) {
if(c[i] > t) return c[i-1];
}
return c[n-1];
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
