Submission #307695

#	Time	Username	Problem	Language	Result	Execution time	Memory
307695		CodePlatina	Stations (IOI20_stations)	C++14	100 / 100	974 ms	1268 KiB

stations

#include "stations.h"
#include <vector>

using namespace std;

vector<int> gph[1010];
int ord[1010];
int cnt = 0;

void dfs(int x, int p, bool flag)
{
    if(flag) ord[x] = ++cnt;
    for(auto y : gph[x]) if(y != p) dfs(y, x, !flag);
    if(!flag) ord[x] = ++cnt;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
	vector<int> labels(n);
	for(int i = 0; i < n; ++i) ord[i] = 0, vector<int>().swap(gph[i]);
	cnt = 0;
	for(int i = 0; i < n - 1; ++i)
    {
        gph[u[i]].push_back(v[i]);
        gph[v[i]].push_back(u[i]);
    }
    dfs(0, 0, false);
    for(int i = 0; i < n; ++i) labels[i] = ord[i];
    return labels;
}

int find_next_station(int s, int t, vector<int> c)
{
    int n = c.size();
    if(s < c[0])
    {
        int pr = s;
        for(int i = 0; i < n - 1; ++i)
        {
            if(pr < t && t <= c[i]) return c[i];
            pr = c[i];
        }
        return c[n - 1];
    }
    else
    {
        int pr = s;
        for(int i = n - 1; i >= 1; --i)
        {
            if(c[i] <= t && t < pr) return c[i];
            pr = c[i];
        }
        return c[0];
    }
}

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