제출 #819592

#제출 시각아이디문제언어결과실행 시간메모리
819592Alihan_8기지국 (IOI20_stations)C++17
8 / 100
755 ms540 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() #define pb push_back #define ln '\n' //#define int long long template <class _T> bool chmin(_T &x, const _T &y){ bool flag = false; if ( x > y ){ x = y; flag |= true; } return flag; } template <class _T> bool chmax(_T &x, const _T &y){ bool flag = false; if ( x < y ){ x = y; flag |= true; } return flag; } vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector <int> ans(n); for ( int i = 0; i < n; i++ ){ ans[i] = i + 1; } return ans; } int find_next_station(int s, int t, vector<int> c) { int f = t; while ( f > 0 ){ if ( f / 2 == s ){ return f; } f >>= 1; } return s / 2; }
#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...