Submission #1296070

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296070		lukaye_19	기지국 (IOI20_stations)	C++20	0 / 100	3100 ms	1052 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>labels(n);
  
  for (int i = 0; i < n; i++)
  {
    labels[i] = i;
  }
  
  return labels;
}

int find_next_station(int s, int t, vector <int> c)
{
  vector<int>q;
  
  q.push_back(s);
  
  unordered_set<int>cv2;
  
  for (int i = 0; i < c.size(); i++)
  {
    cv2.insert(c[i]);
  }
  
  while (!q.empty())
  {
    int t = q.front();
    q.erase(q.begin());
    
    vector<int>cs;
    
    int i1 = (t - 1);
    int c1 = i1 / 2;
    
    cs.push_back(c1);
    
    int irange1 = t * 2;
    int irange2 = (t + 1) * 2 - 1;
    
    for (int i = irange1; i < irange2; i++)
    {
      cs.push_back(i);
    }
    
    for (int i = 0; i < cs.size(); i++)
    {
      auto it = cv2.find(cs[i]);
      
      if (it != cv2.end())
      {
        return cs[i];
      }
    }
    
    for (int i = 0; i < cs.size(); i++)
    {
      q.push_back(cs[i]);
    }
  }
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^

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