제출 #1039888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1039888		Dan4Life	기지국 (IOI20_stations)	C++17	76 / 100	557 ms	1188 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using vi = vector<int>;
const int mxN = 1010;
int dfs_timer = 0;
vi labels, adj[mxN];

void dfs(int s, int p, int dep){
    if(!dep) labels[s] = dfs_timer;
    dfs_timer++;
    for(auto u : adj[s])
        if(u!=p) dfs(u,s,dep^1);
    if(dep) labels[s] = dfs_timer;
    dfs_timer++;
}

vi label(int n, int k, vi u, vi v) {
    labels.clear(); labels.resize(n,0); dfs_timer=0;
    for(int i = 0; i < n; i++) adj[i].clear();
    for(int i = 0; i < sz(u); i++){
        int a = u[i], b = v[i];
        adj[a].pb(b), adj[b].pb(a);
    }
    dfs(0,-1, 0); vi lol; lol.clear();
    for(auto u : labels) lol.pb(u);
    return labels;
}

int find_next_station(int s, int t, vi c) {
    if(sz(c)==1) return c[0];
    for(auto u : c) if(u==t) return u;
    if(s < c[0]){
        if(!s or (s<=t and t<=end(c)[-2]+1)){
            for(int i = 1; i < sz(c)-!!s; i++)
                if(c[i-1]+1<=t and t<=c[i]) return c[i];
            return c[0];
        }
        return c.back();
    }
    if(c[1]-1<=t and t<=s){
        for(int i = 1; i < sz(c)-1; i++)
            if(c[i]<=t and t<=c[i+1]-1) return c[i];
        return c.back();
    }
    return c[0];
}

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