제출 #586503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586503		MohamedFaresNebili	기지국 (IOI20_stations)	C++14	0 / 100	3093 ms	2097152 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;

        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) {
          	sort(C.begin(), C.end());
            for(auto u : C) {
                if(u < T) continue;
                return u;
            }
          	int N = C.size() - 1;
          	return C[N];
        }

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