Submission #119083

#	Time	Username	Problem	Language	Result	Execution time	Memory
119083		baluteshih	Teleporters (IOI08_teleporters)	C++14	95 / 100	1063 ms	45628 KiB

teleporters

#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i,j) memset(i,j,sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(),v.end()
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int to[2000005];
pii tran[1000005],pl[2000005];
const int INF=1e9,MAXC=2000001;
priority_queue<int> pq;
bitset<2000005> vis;
 
int main()
{jizz
	int n,m,all,ans=0;
	cin >> n >> m,all=2*n+1;
	for(int i=0;i<n;++i)
		cin >> tran[i].F >> tran[i].S,pl[i<<1]=MP(tran[i].F,i<<1),pl[i<<1|1]=MP(tran[i].S,i<<1|1);
	pl[all-1]=MP(MAXC,all-1),to[all-1]=-1,vis[all-1]=1;
	sort(pl,pl+all);
	for(int i=0;i<n;++i)
	{
		to[i<<1]=upper_bound(pl,pl+all,MP(tran[i].S,INF))->S;
		to[i<<1|1]=upper_bound(pl,pl+all,MP(tran[i].F,INF))->S;
	}
	for(int i=pl[0].S;!vis[i];i=to[i])
		vis[i]=1,++ans;
	for(int i=0;i<all;++i)
		if(!vis[i])
		{
			int tmp=0;
			for(int j=i;!vis[j];j=to[j])
				vis[j]=1,++tmp;
			pq.push(tmp);
		}
	while(!pq.empty()&&m>0)
		ans+=pq.top()+2,pq.pop(),--m;
	if(m&1)
		cout << ans+(m-1)*2+1 << "\n";
	else
		cout << ans+m*2 << "\n";
}

• 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: 0 / 5