제출 #306044

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
306044		eriksuenderhauf	기지국 (IOI20_stations)	C++17	0 / 100	5 ms	512 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<int> deg(n);
  vector<vector<int>> adj(n, vector<int>());
  for (int i = 0; i < n - 1; i++)
    deg[u[i]]++, deg[v[i]]++, adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);;
  vector<int> labels(n);
  if (*max_element(deg.begin(), deg.end()) <= 2) {
    int r = min_element(deg.begin(), deg.end()) - deg.begin(), p = -1;
    labels[r] = 0;
    for (int i = 1; i < n; i++) {
      adj[r].erase(find(adj[r].begin(), adj[r].end(), p));
      tie(r, p) = make_pair(adj[r][0], r);
      labels[r] = i;
    }
  }
  return labels;
}

int find_next_station(int s, int t, vector<int> c) {
  return s < t ? *max_element(c.begin(), c.end()) : *min_element(c.begin(), c.end());
}

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