제출 #1292864

#제출 시각아이디문제언어결과실행 시간메모리
1292864lambd47Stations (IOI20_stations)C++20
8 / 100
396 ms432 KiB
#include<bits/stdc++.h> using namespace std; #define L(i,j,k) for(int i=(j);i<=(k);i++) #define R(i,j,k) for(int i=(j);i>=(k);i--) #define sz(v) ((int)(v).size()) #define all(v) (v).begin(),(v).end() #include "stations.h" std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { vector<int> dp(n); iota(all(dp),0); return dp; } int find_next_station(int s, int t, std::vector<int> c) { while((t!=(2*s+1)) && (t!=(2*s+2)) && (t!=((s-1)/2))){ if(t<s)return (s-1)/2; t=((t-1)/2); } return t; }
#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...