Submission #1239737

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239737		SalihSahin	Stations (IOI20_stations)	C++20	0 / 100	302 ms	588 KiB

stations

#include "bits/stdc++.h"
#include "stations.h"
using namespace std;

vector<int> out;
vector<vector<int> > adj;
int tval;

void dfs(int node, int par){
   for(auto itr: adj[node]){
      if(itr == par) continue;
      dfs(itr, node);
   }
   out[node] = tval++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
   out.assign(n, 0);
   adj.resize(n);
   tval = 0;
   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]);
   }
   dfs(0, 0);

   int now = 0;
   vector<int> labels = out;
   /*
   for(int i = 0; i < n; i++){
      cout<<i<<" -> "<<labels[i]<<endl;
   }*/

   return labels;
}

int find_next_station(int s, int t, vector<int> c) {
   int nxt = -1;
   for(auto itr: c){
      if(itr >= t){
         nxt = itr;
         break;
      }
   }

   if(nxt != -1) return nxt;
   else return c[c.size()-1];
}

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