제출 #1311258

#제출 시각아이디문제언어결과실행 시간메모리
1311258ayathk기지국 (IOI20_stations)C++20
0 / 100
1 ms512 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; //#define int long long #define fi first #define se second #define all(a) a.begin(), a.end() 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 + 1; return labels; } bool dfs(int s,int t){ if(s == t)return 1; if(s > t)return 0; return (dfs(s * 2, t) || dfs(s*2 + 1,t)); } int find_next_station(int s, int t, vector<int> c) { if(dfs(s * 2, t)){ return s * 2; } if(dfs(s*2 + 1, t)){ return s*2 + 1; } return s/2; } /*signed main(){ vector <int> a = label(5, 8 ,{0,0,1,1}, {1,2,4,3}); for(int i : a){ cout<<i<<' '; } }*/
#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...