제출 #1261121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1261121		PlayVoltz	Teleporters (IOI08_teleporters)	C++20	35 / 100	280 ms	40300 KiB

teleporters

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, k, ans=-1;
	cin>>n>>k;
	vector<int> to(2000005);
	vector<bool> visited(2000005, 0);
	vector<pii> vect(n);
	for (int i=0; i<2000005; ++i)to[i]=i+1;
	for (int i=0; i<n; ++i)cin>>vect[i].fi>>vect[i].se, to[vect[i].fi-1]=vect[i].se, to[vect[i].se-1]=vect[i].fi;
	priority_queue<int> pq;
	visited[2000004]=1;
	for (int i=0; i<2000005; ++i)if (!visited[i]){
		int c=i, res=0;
		while (!visited[c])visited[c]=1, res+=(to[c]!=c+1), c=to[c];
		if (ans==-1)ans=res;
		else pq.push(res);
	}
	while (pq.size()&&k--)ans+=pq.top()+2, pq.pop();
	++k;
	cout<<ans+(k/2)*4+k%2;
}

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