# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334652 | inwbear | Stations (IOI20_stations) | C++14 | 996 ms | 1260 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 "stations.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define MEM(x,a) memset((x),a,sizeof((x)))
#define F first
#define S second
#define imx INT_MAX
const long long MOD = (long long)(1e9+7);
const long long MMX = (long long)(1e18);
typedef long long LL;
typedef pair<int,int> pii;
int rr,nn,co[1005];
bitset<1005>go;
vector<int>v[1005];
void dfs(int N)
{
go[N]=true;
bool ed=true;
co[N]=(rr*1000)+nn;
for(int i=0;i<v[N].size();i++)
{
if(!go[v[N][i]])
{
ed=false;
nn++;
dfs(v[N][i]);
}
}
if(ed)
{
rr++;
nn=0;
}
return;
}
vector<int>label(int n,int k,vector<int>a,vector<int>b)
{
vector<int>labels(n);
rr=0,nn=0;
for(int i=0;i<1005;i++)v[i].clear(),go[i]=false;
for(int i=0;i<a.size();i++)
{
v[a[i]].pb(b[i]);
v[b[i]].pb(a[i]);
}
dfs(0);
for(int i=0;i<n;i++)labels[i]=co[i];
return labels;
}
int find_next_station(int s,int t,vector<int>c)
{
int re=-1;
if(s/1000==t/1000)
{
if(s>t)
{
re=s-1;
}
else
{
re=s+1;
}
}
else
{
for(int i=0;i<c.size();i++)
{
if(t/1000==c[i]/1000)
{
re=c[i];
}
}
}
if(re==-1)return s-1;
else return re;
}
Compilation message (stderr)
# | 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... |