Submission #1057555

#	Time	Username	Problem	Language	Result	Execution time	Memory
1057555		vjudge1	Stations (IOI20_stations)	C++17	0 / 100	461 ms	852 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>adj[1010];
int CC;
void dfs(int n,vector<int>&cols,int dep=0){
    if(dep)cols[n]=++CC;
    for(auto i:adj[n])
        if(!cols[i])
            dfs(i,cols,!dep);
    if(!dep)cols[n]=++CC;
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    vector<int>res(n);
    for(int i=0;i<n-1;i++)
        adj[u[i]].push_back(v[i]),
        adj[v[i]].push_back(u[i]);
    dfs(0,res);
    for(auto&i:res)i--;
    return res;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(s<c[0]){
        if(t<s)
            return c.back();
        for(auto i:c)
            if(t<=i)
                return i;
        return c.back();
    } else {
        if(t>s)
            return c[0];
        reverse(c.begin(),c.end());
        for(auto i:c)
            if(t<=i)
                return i;
        return c.back();
    }
}

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