Submission #517100

#	Time	Username	Problem	Language	Result	Execution time	Memory
517100		Sirapetch	Stations (IOI20_stations)	C++14	0 / 100	4 ms	444 KiB

stations

#include <bits/stdc++.h>
using namespace std;

vector <int> path[1111];
queue <int> walk;
int pass[1111];
vector <int> la;

vector <int> label(int n, int k, vector<int> u, vector<int> v)
{
    la.clear();
    int i,x;
    for(i=0;i<n;i++)
    {
        pass[i]=0;
        la.push_back(0);
    }
    x=u.size();
    for(i=0;i<x;i++)
    {
        path[u[i]].push_back(v[i]);
        path[v[i]].push_back(u[i]);
    }
    for(i=0;i<n;i++)
    {
        if(path[i].size()==1)
        {
            walk.push(i);
            break;
        }
    }
    x=1;
    while(!walk.empty())
    {
        i=walk.front();
        walk.pop();
        if(pass[i]==1) continue;
        pass[i]=1;
        la[i]=x;
        x++;
        for(auto a:path[i])
        {
            if(pass[a]==1) continue;
            walk.push(a);
        }
    }
    return la;
}

int find_next_station(int s, int t, vector<int> c)
{
    if(s<t) return s+1;
    else return s-1;
}

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