Submission #430415

#TimeUsernameProblemLanguageResultExecution timeMemory
430415alishahali1382Stations (IOI20_stations)C++14
0 / 100
1 ms292 KiB
#include "stations.h" #include <bits/stdc++.h> #pragma GCC optimize("O2") using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; #define debug(x) {cerr<<#x<<"="<<x<<"\n";} #define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";} #define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";} #define debugv(abcd) {cerr<<#abcd<<": "; for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";} #define pb push_back #define all(x) x.begin(), x.end() #define SZ(x) ((int)x.size()) const int inf=1000000100; // 1e9 const ll INF=10000000001000000; // 1e16 const int mod=1000000007; const int MAXN=1010; int n, m, k, x, y, a, b, t, ans; vi A, B; vi label(int _n, int _k, vi U, vi V){ vi out(n); for (int i = 0; i < n; i++) { out[i] = i; } return out; } int find_next_station(int s, int t, vi adj){ s++; t++; int tt=t; while (tt && tt/2!=s) tt/=2; if (tt/2==s) return tt-1; 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...