Submission #586534

#	Time	Username	Problem	Language	Result	Execution time	Memory
586534		MohamedFaresNebili	Stations (IOI20_stations)	C++14	0 / 100	870 ms	632 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
 
        using namespace std;
 
        int timer = 0;
        vector<vector<int>> adj;
        vector<int> res;
        void dfs(int v, int p) {
            for(int u : adj[v]) {
                if(u != p) dfs(u, v);
            }
            res[v] = timer++;
        }
 
        vector<int> label(int N, int K, vector<int> U, vector<int> V) {
            res.assign(N, 0); timer = 0;
          	adj = vector<vector<int>>(N);
            for(int l = 0; l < N - 1; l++) {
                int X = U[l], Y = V[l];
                adj[X].push_back(Y), adj[Y].push_back(X);
            }
            dfs(0, 0);
            return res;
        }
        int find_next_station(int S, int T, vector<int> R) {
          	vector<int> C = R;
          	sort(C.begin(), C.end());
          	if(S == T) return S;
          	if(T > S) {
              	int N = C.size() - 1;
          		return C[N];
            }
            for(auto u : C) {
                if(u >= T) return u;
            }
        }

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:30:28: warning: control reaches end of non-void function [-Wreturn-type]
   30 |            vector<int> C = R;
      |                            ^

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