제출 #659935

#제출 시각아이디문제언어결과실행 시간메모리
659935evenvalue기지국 (IOI20_stations)C++17
0 / 100
758 ms556 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 / 2;
  while (t > 0) {
    if (t / 2 == s) {
      return t;
    }
    t /= 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...