oj.uz

Submission #119089

# Submission time Handle Problem Language Result Execution time Memory
119089 2019-06-20T10:08:07 Z baluteshih Teleporters (IOI08_teleporters) C++14
100 / 100
 517 ms 41468 KB 
#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],cnt[2000005],pl[2000005],nxt[2000005];
pii tran[1000005];
const int INF=1e9,MAXC=2000001;
bitset<2000005> vis;
 
int main()
{jizz
	int n,m,all,ans=0;
	cin >> n >> m,all=2*n+1;
	MEM(pl,-1);
	for(int i=0;i<n;++i)
		cin >> tran[i].F >> tran[i].S,pl[tran[i].F]=i<<1,pl[tran[i].S]=i<<1|1;
	pl[MAXC]=all-1,to[all-1]=-1,vis[all-1]=1;
	for(int i=MAXC-1,ls=all-1;i>=0;--i)
		nxt[i]=ls,~pl[i]&&(ls=pl[i]);
	for(int i=0;i<n;++i)
		to[i<<1]=nxt[tran[i].S],to[i<<1|1]=nxt[tran[i].F];
	for(int i=nxt[0];!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;
			++cnt[tmp];
		}
	for(int i=2*n;i>0&&m;)
		if(cnt[i])
			--cnt[i],--m,ans+=i+2;
		else
			--i;
	if(m&1)
		cout << ans+(m-1)*2+1 << "\n";
	else
		cout << ans+m*2 << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16000 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16128 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16000 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 15972 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16000 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16000 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16056 KB Output is correct
2 Correct 22 ms 16228 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 16120 KB Output is correct
2 Correct 18 ms 16256 KB Output is correct
3 Correct 21 ms 16504 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16228 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16352 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 17968 KB Output is correct
2 Correct 135 ms 20932 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 19448 KB Output is correct
2 Correct 196 ms 23272 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 25976 KB Output is correct
2 Correct 316 ms 28060 KB Output is correct
3 Correct 329 ms 29304 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 30200 KB Output is correct
2 Correct 503 ms 31224 KB Output is correct
3 Correct 441 ms 31728 KB Output is correct
4 Correct 444 ms 31864 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 511 ms 32028 KB Output is correct
2 Correct 517 ms 41336 KB Output is correct
3 Correct 224 ms 41468 KB Output is correct
4 Correct 484 ms 41208 KB Output is correct