제출 #1239371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239371		lanaskarica	Teleporters (IOI08_teleporters)	C++20	25 / 100	460 ms	131072 KiB

teleporters

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

#define ll long long 
#define pii pair <int, int>
#define fi first
#define se second

const int MAXN = 2e6 + 5;

int bio[MAXN];

vector <pii> vtr;
vector <int> v[MAXN], c;

int dfs(int a) {
	int zb = 1;
	for (auto e : v[a]) {
		if (bio[e] != 0) continue;
		bio[e] = 1;
		zb += dfs(e);
	}
	return zb;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m, a, b;
	cin >> n >> m;
	
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		vtr.push_back({a, b});
		vtr.push_back({b, a});
	}
	sort(vtr.begin(), vtr.end());
	
	int p = 0;
	for (int i = 0; i < 2 * n; i++) {
		v[p].push_back(vtr[i].se);
		//cout << p << " " << vtr[i].se << endl;
		p = vtr[i].fi;
	}
	
	bio[0] = 1;
	int rj = dfs(0);
	//cout << rj << endl;
	for (int i = 0; i < 2 * n; i++) {
		if (bio[vtr[i].fi] != 0) continue;
		bio[vtr[i].fi] = 1;
		int br = dfs(vtr[i].fi);
		c.push_back(br);
		//cout << vtr[i].fi << " " << br << endl; 
	}
	
	sort(c.rbegin(), c.rend());
	
	for (int i = 0; i < min(m, (int)c.size()); i++) {rj += c[i] + 2; m--;}
	
	if (m == 0) {cout << rj - 1 << "\n"; return 0;}
	
	for (int i = 0; i < m; i++) {
		if (i % 2 == 0) rj++;
		else rj += 3;
	}
	cout << rj - 1 << "\n";
	
	return 0;
}

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