# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869692 | andrewp | Stations (IOI20_stations) | C++14 | 529 ms | 908 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.
//Dedicated to my love,ivaziva
#include<bits/stdc++.h>
#include "stations.h"
using namespace std;
#define ll long long
#define pb push_back
const int maxn=1050;
const int mx=1000;
const int mod=998244353;
vector<int> es[maxn]; //ivice
int tin[maxn],tout[maxn];
int vr=0;//vreme ulaza, vreme izlaza
void dfs(int u,int par){
tin[u]=vr;vr++;
for(auto e:es[u]){
if(e!=par){
dfs(e,u);
}
}
tout[u]=vr-1;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v){
vector<int> kodiraj(n,0);
for(int i=0;i<n;i++) es[i].clear();
for(int i=0;i<v.size();i++){
es[u[i]].pb(v[i]);
es[v[i]].pb(u[i]);
}
dfs(0,-1);
for(int i=0;i<n;i++){
kodiraj[i]=tin[i]*mx+tout[i];//tout[i]<=1k
}
return kodiraj;
}
int find_next_station(int s,int e,vector<int> c){
int ine=e/mx,oute=e%mx;
int ins=s/mx,outs=s%mx;
if(ine>=ins&&outs>=oute){
bool root=ins==0;
for(int i=(root?1:0);i<c.size();i++){
int ini=c[i]/1000,outi=c[i]%1000;
if(ine>=ini&&outi>=oute) return c[i];
}
}
return c[0];
}
// void sol(){
// }
// int main(){
// int T=1;
// // scanf("%d",&T);
// while(T--){
// sol();
// }
// 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... |