Submission #552183

#	Time	Username	Problem	Language	Result	Execution time	Memory
552183		hoanghq2004	Stations (IOI20_stations)	C++14	0 / 100	713 ms	684 KiB

stations

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "stations.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 gen(std :: chrono :: system_clock :: now().time_since_epoch().count());

const int N = 2e3 + 10;

int in[N], out[N], ti;
vector <int> g[N];
int depth[N];

void dfs(int u, int p, int d) {
    in[u] = ++ti;
    depth[u] = d;
    for (auto v: g[u]) {
        if (v == p) continue;
        dfs(v, u, d ^ 1);
    }
    out[u] = ++ti;
}

int a[N];

vector <int> label(int n, int k, vector <int> U, vector <int> V) {
    for (int i = 0; i < n - 1; ++i) {
        g[U[i]].push_back(V[i]);
        g[V[i]].push_back(U[i]);
    }
    dfs(0, -1, 0);
    vector <int> ans, dta;
    for (int i = 0; i < n; ++i)
        a[i] = (!depth[i] ? out[i] : in[i]);
    for (int i = 0; i < n; ++i) dta.push_back(a[i]);
    for (int i = 0; i < n; ++i) ans.push_back(lower_bound(dta.begin(), dta.end(), a[i]) - dta.begin());
    ti = 0;
    for (int i = 0; i < n; ++i) in[i] = out[i] = depth[i] = 0, g[i].clear();
    return ans;
}

int find_next_station(int s, int t, vector <int> g) {
    if (g[0] > s) { // in
        if (t < s) return g.back();
        for (int i = 0; i < g.size(); ++i)
            if (t <= g[i]) return g[i];
        return g.back();
    } else { // out
        if (t > s) return g.front();
        for (int i = g.size() - 1; i >= 0; --i)
            if (t >= g[i]) return g[i];
        return g.front();
    }
}

Compilation message (stderr)

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:53:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for (int i = 0; i < g.size(); ++i)
      |                         ~~^~~~~~~~~~

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