제출 #757304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
757304		SanguineChameleon	Teleporters (IOI08_teleporters)	C++17	100 / 100	530 ms	44492 KiB

teleporters

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

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 1e6 + 20;
pair<int, int> a[maxn * 2];
int adj[maxn * 2];
bool flag[maxn * 2];
int sz = 0;

void dfs(int u) {
	flag[u] = true;
	sz++;
	if (!flag[adj[u]]) {
		dfs(adj[u]);
	}
}

void just_do_it() {
	int n, m;
	cin >> n >> m;
	n++;
	a[1] = make_pair(0, 1);
	a[2] = make_pair(maxn * 2, n + 1);
	for (int i = 2; i <= n; i++) {
		a[i * 2 - 1].second = i;
		a[i * 2].second = n + i;
		cin >> a[i * 2 - 1].first >> a[i * 2].first;
	}
	sort(a + 1, a + n * 2 + 1);
	for (int i = 1; i <= n * 2 - 1; i++) {
		int u = a[i].second;
		int v = a[i + 1].second;
		if (v > n) {
			v -= n;
		}
		else {
			v += n;
		}
		adj[u] = v;
	}
	dfs(1);
	int res = sz - 1;
	vector<int> sizes;
	for (int i = 1; i <= n * 2; i++) {
		if (i != n + 1 && !flag[i]) {
			sz  = 0;
			dfs(i);
			sizes.push_back(sz);
		}
	}
	sort(sizes.begin(), sizes.end(), greater<int>());
	for (int i = 0; i < (int)sizes.size() && m > 0; i++) {
		res += sizes[i] + 2;
		m--;
	}
	res += 4 * (m / 2) + (m % 2);
	cout << res;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5