Submission #546713

#	Time	Username	Problem	Language	Result	Execution time	Memory
546713		cig32	기지국 (IOI20_stations)	C++17	100 / 100	806 ms	792 KiB

stations

#include "stations.h"
#include <cstdio>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v);
int find_next_station(int s, int t, std::vector<int> c);
std::vector<int> adj[1024];
int ans[1024];
int sz[1024];
void dfs(int node, int prv, int l, int r, int dep) {
  if(dep & 1) {
    ans[node] = r;
    r--;
  }
  else {
    ans[node] = l;
    l++;
  }
  for(int x: adj[node]) {
    if(x != prv) {
      dfs(x, node, l, l + sz[x] - 1, dep + 1);
      l += sz[x];
    }
  }
}
void fuck(int node, int prv) {
  sz[node] = 1;
  for(int x: adj[node]) {
    if(x != prv) {
      fuck(x, node);
      sz[node] += sz[x];
    }
  }
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
  for(int i=0; i<n; i++) {
    adj[i].clear();
  }
	for(int i=0; i<n-1; i++) {
    adj[u[i]].push_back(v[i]);
    adj[v[i]].push_back(u[i]);
  }
  fuck(0, -1);
  dfs(0, -1, 0, n-1, 0);
  for(int i=0; i<n; i++) labels[i] = ans[i];
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c[0] > s) { // Current node is an even depth node
    for(int i=0; i<c.size() - 1; i++) {
      if(s < t && t <= c[i]) return c[i];
      s = c[i];
    }
    return c[c.size() - 1];
  }
  else { // Current node is an odd depth node
    for(int i=c.size()-1; i>0; i--) {
      if(c[i] <= t && t < s) return c[i];
      s = c[i];
    }
    return c[0];
  }
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0; i<c.size() - 1; i++) {
      |                  ~^~~~~~~~~~~~~

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