# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413190 | losmi247 | Stations (IOI20_stations) | C++14 | 0 ms | 0 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>
using namespace std;
typedef long long ll;
const int N = 1005;
int deg[N];
int *label(int n,int k,int *u,int *v){
bool prvi = 1;
for(int i = 0; i < n-1; i++) deg[u[i]]++, deg[v[i]]++;
for(int i = 0; i < n; i++) if(deg[i] > 2) prvi = 0;
if(prvi){
int *l = (int*)malloc(sizeof(int)*n);
for(int i = 0; i < n; i++) l[i] = i;
return l;
}
}
int find_next_station(int s,int t,int *c){
if(s < t){
return s+1;
}
else{
return s-1;
}
}