Submission #510337

#TimeUsernameProblemLanguageResultExecution timeMemory
510337jamezzzStations (IOI20_stations)C++17
0 / 100
1212 ms548 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; vector<int> label(int n,int k,vector<int> u,vector<int> v){ vector<int> l(n); for(int i=0;i<n;++i)l[i]=i; return l; } int pre[1005],pst[1005],cnt; void dfs(int u){ if(u>1000)return; pre[u-1]=cnt++; dfs(2*u);dfs(2*u+1); pst[u-1]=cnt-1; } int find_next_station(int s,int t,vector<int> c){ ++s;++t; if(cnt==0)dfs(1); if(2*s>1000)return c[0]; if(pre[2*s]<=pre[t]&&pst[t]<=pre[2*s])return 2*s-1; if(pre[2*s+1]<=pre[t]&&pst[t]<=pre[2*s+1])return 2*s; return s/2-1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...