제출 #1292772

#제출 시각아이디문제언어결과실행 시간메모리
1292772julia_08Stations (IOI20_stations)C++20
0 / 100
395 ms436 KiB
#include <bits/stdc++.h> #include "stations.h" using namespace std; const int MAXN = 1e3 + 10; int marc[MAXN]; vector<int> label(int n, int k, vector<int> u, vector<int> v){ vector<int> labels(n); for(int i=0; i<n; i++) labels[i] = i; return labels; } int find_next_station(int s, int t, vector<int> c){ vector<int> vis; while(t > 0){ vis.push_back(t); marc[t] = 1; t /= 2; } vis.push_back(0); marc[t] = 1; int ans = 0; if(!marc[s]){ ans = (s / 2); } else{ if(s > 0 && marc[2 * s]){ ans = 2 * s; } else ans = 2 * s + 1; } for(auto x : vis) marc[x] = 0; return ans; }
#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...