제출 #660060

#제출 시각아이디문제언어결과실행 시간메모리
660060evenvalue기지국 (IOI20_stations)C++17
8 / 100
916 ms548 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>; template<typename T> using max_heap = priority_queue<T, vector<T>, less<T>>; using int64 = long long; using ld = long double; constexpr int kInf = 1e9 + 10; constexpr int64 kInf64 = 1e15 + 10; constexpr int kMod = 1e9 + 7; vector<int> label(int n, int k, vector<int> u, vector<int> v) { vector<int> labels(n); iota(labels.begin(), labels.end(), 0); return labels; } int find_next_station(int s, int t, vector<int> c) { const int p = (s - 1) / 2; while (t > 0) { if ((t - 1) / 2 == s) { return t; } t = (t - 1) / 2; } return p; }
#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...