제출 #586491

#제출 시각아이디문제언어결과실행 시간메모리
586491MohamedFaresNebiliStations (IOI20_stations)C++14
0 / 100
3133 ms2097152 KiB
#include <bits/stdc++.h>
#include "stations.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

        using namespace std;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound

        const int MOD = 1000 * 1000 * 1000 + 7;

        int timer, tin[1001];
        vector<int> adj[1001];
        void dfs(int v, int p) {
            for(auto u : adj[v]) {
                if(u == p) continue;
                dfs(u, v);
            }
            tin[v] = timer++;
        }

        vector<int> label(int N, int K, vector<int> U, vector<int> V) {
            for(int l = 0; l < N - 1; l++) {
                int X = U[l], Y = V[l];
                adj[X].pb(Y), adj[Y].pb(X);
            }
            dfs(0, 0); vector<int> res(N);
            for(int l = 0; l < N; l++)
                res[l] = tin[l];
            return res;
        }
        int find_next_station(int S, int T, vector<int> C) {
            for(auto u : C) {
                if(u < T) continue;
                return u;
            }
        }

컴파일 시 표준 에러 (stderr) 메시지

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:46:9: warning: control reaches end of non-void function [-Wreturn-type]
   46 |         }
      |         ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...