Submission #306754

#	Time	Username	Problem	Language	Result	Execution time	Memory
306754		VEGAnn	기지국 (IOI20_stations)	C++14	0 / 100	3058 ms	2097156 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
const int N = 1000;
vector<int> g[N];
int tin[N], tout[N], tt = 0;
int tin_s, tout_s, tin_v, tout_v, tin_t, tout_t;

void dfs(int v, int p){
    tin[v] = tt++;

    for (int u : g[v]){
        if (u == p) continue;
        dfs(u, v);
    }

    tout[v] = tt - 1;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    for (int i = 0; i < sz(u); i++){
        g[u[i]].PB(v[i]);
        g[v[i]].PB(u[i]);
    }

    dfs(0, -1);

    vector<int> labels;

    labels.resize(n);

    for (int i = 0; i < n; i++)
        labels[i] = tin[i] * N + tout[i];

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    tin_s = s / N;
    tout_s = s % N;

    tin_t = t / N;
    tout_t = t % N;

    if (tin_s <= tin_t && tout_s >= tout_t){
        for (int v : c) {
            tin_v = v / N;
            tout_v = v % N;

            if (tin_v > tin_s && tin_v <= tin_t && tout_v >= tout_t)
                return v;
        }
    } else {
        for (int v : c)
            if (v / N < tin_s)
                return v;
    }
}

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:34:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   34 |     for (int i = 0; i < n; i++)
      |     ^~~
stations.cpp:37:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   37 |  return labels;
      |  ^~~~~~
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