| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325522 | Sofiatpc | 기지국 (IOI20_stations) | C++20 | 395 ms | 584 KiB |
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(v) (int)v.size()
const int MAXN = 1e3+5;
vector<int> adj[MAXN];
int tin[MAXN], tout[MAXN], t;
vector<int> labels;
void dfs(int s, int p, int x){
tin[s] = ++t;
for(int viz : adj[s])
if(viz != p)dfs(viz,s,x^1);
tout[s] = ++t;
if(x == 0) labels[s] = tout[s];
else labels[s] = tin[s];
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.resize(n);
for (int i = 0; i < n-1; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
t = -1;
dfs(0,-1,0 );
for(int i = 0; i < n; i++)adj[i].clear();
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(sz(c) == 1)return c[0];
if(s <= c[0]){//eu sou in
if(t < s || t > c[sz(c)-2])return c.back();
for(int i = 0; i < sz(c); i++)
if(c[i] >= t)return c[i];
}else{//eu sou out
if(t < c[1] || t > s)return c[0];
for(int i = sz(c)-1; i >= 0; i--)
if(c[i] <= t)return c[i];
}
}
컴파일 시 표준 에러 (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... | ||||
