제출 #1168362

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168362		woohyun_jng	기지국 (IOI20_stations)	C++20	0 / 100	310 ms	548 KiB

stations

#include <bits/stdc++.h>
using namespace std;

typedef array<int, 2> pr;

const int MAX = 1001;

vector<int> adj[MAX];
int in[MAX], out[MAX], cnt;

void dfs(int node, int par) {
    in[node] = cnt++;
    for (int i : adj[node]) {
        if (i == par)
            continue;
        dfs(i, node);
    }
    out[node] = cnt - 1;
}

vector<int> label(int N, int K, vector<int> U, vector<int> V) {
    vector<int> labels(N);

    for (int i = 0; i < N - 1; i++)
        adj[U[i]].push_back(V[i]), adj[V[i]].push_back(U[i]);

    cnt = 0, dfs(0, -1);

    for (int i = 0; i < N; i++)
        labels[i] = in[i] * 1000 + out[i];

    for (int i = 0; i < N; i++)
        adj[i].clear(), in[i] = out[i] = 0;

    return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    int X, Y;

    pr S, T;
    vector<pr> C;

    S = {s / 1000, s % 1000}, T = {t / 1000, t % 1000};
    for (int i = 0; i < c.size(); i++) {
        X = c[i] / 1000, Y = c[i] % 1000;
        if (X <= S[0] && S[1] <= Y)
            continue;
        C.push_back({X, Y});
    };

    if (S[0] <= T[0] && T[0] <= S[1]) {
        for (pr i : C) {
            if (i[0] <= T[0] && T[1] <= i[1])
                return i[0] * 1000 + i[1];
        }
    } else
        return X * 1000 + Y;
}

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

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

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