Submission #804615

#	Time	Username	Problem	Language	Result	Execution time	Memory
804615		becaido	Stations (IOI20_stations)	C++17	21 / 100	769 ms	656 KiB

stations

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "stations.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1005;

vector<int> adj[SIZE];
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n, -1);
	FOR (i, 0, n - 1) adj[i].clear();
	FOR (i, 0, n - 2) {
        adj[u[i]].pb(v[i]);
        adj[v[i]].pb(u[i]);
	}
	int mx = 0;
	FOR (i, 0, n - 1) mx = max<int>(mx, adj[i].size());
	if (mx <= 2) {
        FOR (i, 0, n - 1) if (adj[i].size() == 1) {
            queue<int> q;
            int cnt = 0;
            labels[i] = cnt++, q.push(i);
            while (q.size()) {
                int pos = q.front();
                q.pop();
                for (int np : adj[pos]) if (labels[np] == -1) {
                    labels[np] = cnt++;
                    q.push(np);
                }
            }
            return labels;
        }
	}
	int mid = -1;
	FOR (i, 0, n - 1) if (adj[i].size() == mx) mid = i;
	labels[mid] = 0;
	int sz = 0;
	for (int s : adj[mid]) {
        queue<int> q;
        labels[s] = 1000 * sz + 1, q.push(s);
        while (q.size()) {
            int pos = q.front();
            q.pop();
            for (int np : adj[pos]) if (labels[np] == -1) {
                labels[np] = labels[pos] + 1;
                q.push(np);
            }
        }
        sz++;
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
    if (s != 0 && (t == 0 || s / 1000 != t / 1000)) return *min_element(c.begin(), c.end());
    if (s == 0) {
        for (int lb : c) if (lb / 1000 == t / 1000) return lb;
    }
    for (int i = 0; i < c.size(); i++) if (c[i] == 0) {
        c.erase(c.begin() + i);
        break;
    }
    return s < t ? *max_element(c.begin(), c.end()) : *min_element(c.begin(), c.end());
}

/*
in1
1
5 10
0 1
1 2
1 3
2 4
2
2 0 1
1 3 3
out1
9
1
3

case1
1
5 100
4 2
2 3
3 0
0 1
2
2 1 3
1 4 0

case2
1
7 10
0 1
0 2
1 3
1 4
2 5
2 6
3
4 5 1
6 0 2
1 4 4

case3
1
6 1000000
1 4
4 3
3 5
4 2
2 0
5
1 4 4
4 5 3
0 2 2
2 0 0
3 2 4
*/

#ifdef WAIMAI
static int max_label = 0;
static int r, n, k, q;
static vector<int> u, v, labels, answers;
static map<int, int> reverse_labels;
static vector<vector<int>> adjlist;
static int s, t, w;
static vector<int> c;

int main() {
    assert(scanf("%d", &r) == 1);
    for (int tc = 0; tc < r; tc++) {
        assert(scanf("%d%d", &n, &k) == 2);
        u.resize(n - 1);
        v.resize(n - 1);
        adjlist.clear();
        adjlist.resize(n);
        for (int i = 0; i < n - 1; i++) {
            assert(scanf("%d%d", &u[i], &v[i]) == 2);
            adjlist[u[i]].push_back(v[i]);
            adjlist[v[i]].push_back(u[i]);
        }
        labels = label(n, k, u, v);
        if ((int)labels.size() != n) {
            printf("Number of labels not equal to %d\n", n);
            exit(0);
        }
        reverse_labels.clear();
        for (int i = 0; i < n; i++) {
            if (labels[i] < 0 || labels[i] > k) {
                printf("Label not in range 0 to %d\n", k);
                exit(0);
            }
            if (reverse_labels.find(labels[i]) != reverse_labels.end()) {
                printf("Labels not unique\n");
                exit(0);
            }
            reverse_labels[labels[i]] = i;
            if (labels[i] > max_label) {
                max_label = labels[i];
            }
        }
        assert(scanf("%d", &q) == 1);
        for (int i = 0; i < q; i++) {
            assert(scanf("%d%d%d", &s, &t, &w) == 3);
            c.clear();
            for (int v : adjlist[s]) {
                c.push_back(labels[v]);
            }
            sort(c.begin(), c.end());
            int answer = find_next_station(labels[s], labels[t], c);
            if (!binary_search(c.begin(), c.end(), answer)) {
                printf("Label %d returned by find_next_station not found in c\n", answer);
                exit(0);
            }
            answers.push_back(reverse_labels[answer]);
        }
    }
    printf("%d\n", max_label);
    for (int index : answers) {
        printf("%d\n", index);
    }
    exit(0);
}
#endif

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:55:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |  FOR (i, 0, n - 1) if (adj[i].size() == mx) mid = i;
      |                        ~~~~~~~~~~~~~~^~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:79:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for (int i = 0; i < c.size(); i++) if (c[i] == 0) {
      |                     ~~^~~~~~~~~~

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