# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432980 | MOUF_MAHMALAT | 기지국 (IOI20_stations) | C++14 | 3049 ms | 2097156 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;
typedef int ll;
ll in[1009],out[1009],ti;
vector<vector<ll> >v;
void dfs(ll d,ll p)
{
in[d]=ti;
for(auto z:v[d])
if(z!=p)
{
ti++;
dfs(z,d);
}
out[d]=ti;
}
vector<int> label(int n, int k, vector<int> U, vector<int> V)
{
v.resize(n);
vector<ll>ans(n);
for(ll i=0; i<U.size(); i++)
{
v[U[i]].push_back(V[i]);
v[V[i]].push_back(U[i]);
}
dfs(0,0);
for(ll i=0; i<n; i++)
ans[i]=in[i]+(out[i]<<10);
return ans;
}
int find_next_station(int s, int t, vector<int> c)
{
ll x=s&((1<<10)-1),y=(s>>10);
ll xx=t&((1<<10)-1),yy=(t>>10);
for(auto z:c)
{
ll o=z&((1<<10)-1),oo=(z>>10);
if(x<=xx&&y>=yy&&o<=xx&&oo>=yy)
return z;
if((y<xx||x>yy)&&o<=x&&oo>=y)
return z;
if(xx<=x&&yy>=y&&o<=x&&oo>=y)
return z;
}
return 0;
}
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... |