# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321871 | akobi | Stations (IOI20_stations) | C++14 | 1097 ms | 1248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector< vector<int> > edge;
vector<int> t,p,fix,anss;
vector< pair<int,int> >ans;
for (int i=0; i<n; i++)
{
edge.pb(t);
p.pb(0);
fix.pb(0);
anss.pb(0);
}
for (int i=0; i<n-1; i++)
{
edge[u[i]].pb(v[i]);
edge[v[i]].pb(u[i]);
}
p[0]=-1;
int c=0,cnt=0,l=0;
while (c>=0)
{
int inn=0,out=0,bbb=0;
if (fix[c]==0)
{
# | 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... |