제출 #1310926

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310926		mo_aladaili	기지국 (IOI20_stations)	C++20	5 / 100	396 ms	492 KiB

stations

#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 < u.size(); i++)
   {
      adj[u[i]].push_back(v[i]);
      adj[v[i]].push_back(u[i]);
   }
   int st = 0;
   for (int i = 0; i < n; i++)
   {
      if (adj[i].size() <= 1)
      {
         st = i;
         break;
      }
   }
   vector<int> label(n, 0);
   vector<int> vis(n, 0);
   int cur = st, prev = -1, cur_label = 1;
   while (cur != -1)
   {
      label[cur] = cur_label++;
      vis[cur] = 1;
      int next = -1;
      for (int x : adj[cur])
      {
         if (x != prev)
         {
            next = x;
            break;
         }
      }
      prev = cur;
      cur = next;
   }
   return label;
}

int find_next_station(int s, int t, vector<int> c)
{
   for (int x : c)
   {
      if (x == t)
      {
         return x;
      }
   }
   if (t > s)
   {
      return c.back();
   }
   else
   {
      return c.front();
   }
}

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