Submission #640968

#	Time	Username	Problem	Language	Result	Execution time	Memory
640968		t6twotwo	기지국 (IOI20_stations)	C++17	100 / 100	886 ms	876 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
  vector<vector<int>> adj(n);
  for (int i = 0; i < n - 1; i++) {
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);
  }
  int cnt = 0;
  vector<int> ans(n);
  function<void(int, int, int)> dfs = [&](int a, int c, int d) {
    if (d == 0) {
      ans[a] = cnt++;
    }
    for (int b : adj[a]) {
      if (b != c) {
        dfs(b, a, d ^ 1);
      }
    }
    if (d == 1) {
      ans[a] = cnt++;
    }
  };
  dfs(0, -1, 0);
  return ans;
}
int find_next_station(int s, int t, vector<int> c) {
  if (s < c[0]) {
    if (t < s || t >= c.back()) {
      return c.back();
    }
    return *lower_bound(c.begin(), c.end(), t);
  } else {
    if (t > s || t < c[0]) {
      return c[0];
    }
    return *--upper_bound(c.begin(), c.end(), t);
  }
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 61 / 61