제출 #1296047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1296047		lukaye_19	기지국 (IOI20_stations)	C++20	0 / 100	2 ms	484 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 startingstation = -1;
  
  for (int i = 0; i < n; i++)
  {
    if (adj[i].size() == 1)
    {
      startingstation = i;
      
      break;
    }
  }
  
  vector<int>labels(n,-1);
  
  int previousstation = -1;
  int currentstation = -1;
  
  int stationlabel = 0;
  
  while (true)
  {
    labels[currentstation] = stationlabel++;
    
    int nextstation = -1;
    
    for (int connection : adj[currentstation])
    {
      if (connection != previousstation)
      {
        nextstation = connection;
      }
    }
    
    if (nextstation == -1) break;
    
    previousstation = currentstation;
    currentstation = nextstation;
  }
  
  return labels;
}

int find_next_station(int s, int t, vector <int> c)
{
  if (c.size() == 1)
  {
    return c[0];
  }
  else if (t < s)
  {
    return c[0];
  }
  else
  {
    return c[1];
  }
}

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