Submission #545142

#	Time	Username	Problem	Language	Result	Execution time	Memory
545142		PiejanVDC	Stations (IOI20_stations)	C++17	0 / 100	3170 ms	2097152 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"

using namespace std;

const int mxN = 1005;

map<pair<int,int>, bitset<mxN>>mp;
vector<bitset<mxN>>ans(mxN);

vector<int>adj[mxN];

bitset<mxN> dfs(int u, int e = -1) {
    bitset<mxN>b;
    for(auto z : adj[u]) if(z != e) {
        mp[{u,z}] |= dfs(z,u);
        mp[{u,z}][z] = 1;
        b |= mp[{u,z}];
    }
    return b;
}

void Dfs(int u, int e, bitset<mxN>B) {

    for(auto z : adj[u]) if(z != e) {

    }
}

vector<int>label(int n, int k, vector<int>u, vector<int>v) {
    for(int i = 0 ; i < n-1 ; i++)
        adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
    vector<int>ret(n);
    for(int i = 0 ; i < n ; i++) {
        dfs(i);
        ret[i] = i;
    }
    //Dfs(0, {});
    return ret;
}

int find_next_station(int s, int t, vector<int>c) {
    for(auto z : c) {
        if(mp[{s,z}][t])
            return z;
    }
    return -1;
}
/*
//#include "stations.h"
#include <cstdio>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>

static int max_label = 0;
static int r, n, k, q;
static std::vector<int> u, v, labels, answers;
static std::map<int, int> reverse_labels;
static std::vector<std::vector<int>> adjlist;
static int s, t, w;
static std::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]);
			}
			std::sort(c.begin(), c.end());
			int answer = find_next_station(labels[s], labels[t], c);
			if (!std::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);
}*/

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