oj.uz

Submission #777993

# Submission time Handle Problem Language Result Execution time Memory
777993 2023-07-10T01:39:15 Z jamezzz Teleporters (IOI08_teleporters) C++17
100 / 100
 990 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define INF 1023456789
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef pair<int,int> ii;

#define maxn 1000005

int n,m,s[maxn],e[maxn],par[maxn<<2],sz[maxn<<2];
vector<ii> v;

int fp(int i){
	return par[i]==i?i:par[i]=fp(par[i]);
}

void join(int x,int y){
	x=fp(x),y=fp(y);
	if(x==y)return;
	if(sz[x]<sz[y])swap(x,y);
	par[y]=x;
	sz[x]+=sz[y];
}

int main(){
	sf("%d%d",&n,&m);
	for(int i=0;i<2*(m+n);++i)par[i]=i,sz[i]=1;
	for(int i=0;i<n;++i){
		sf("%d%d",&s[i],&e[i]);
		v.pb({s[i],2*i});
		v.pb({e[i],2*i+1});
	}
	sort(all(v));
	int src=v[0].se;
	for(auto[x,i]:v){
		int y=(i%2)?s[i>>1]:e[i>>1];//other endpoint
		int pos=lower_bound(all(v),ii(y+1,-1))-v.begin();
		if(pos==sz(v))continue;
		int j=v[pos].se;
		//pf("join %d %d\n",i,j);
		join(i,j);
	}
	priority_queue<int> pq;
	for(int i=0;i<2*n;++i){
		if(fp(i)==i&&fp(i)!=fp(src)){
			pq.push(sz[i]);
			//pf("push %d\n",sz[i]);
		}
	}
	int ans=sz[fp(src)];
	//pf("ans %d\n",ans);
	for(int i=0;i<m;++i){
		if(!pq.empty()){
			ans+=2;
			ans+=pq.top();
			pq.pop();
		}
		else ans+=1,pq.push(1);
	}
	pf("%d\n",ans);
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:32:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  sf("%d%d",&n,&m);
      |    ^
teleporters.cpp:35:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   sf("%d%d",&s[i],&e[i]);
      |     ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 5 ms 980 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 6 ms 1088 KB Output is correct
3 Correct 13 ms 1872 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4104 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1488 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 7696 KB Output is correct
2 Correct 198 ms 19872 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 21424 KB Output is correct
2 Correct 342 ms 36280 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 495 ms 49792 KB Output is correct
2 Correct 630 ms 45380 KB Output is correct
3 Correct 597 ms 60832 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 928 ms 65032 KB Output is correct
2 Correct 942 ms 56064 KB Output is correct
3 Correct 704 ms 65536 KB Output is correct
4 Correct 649 ms 54260 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 985 ms 65536 KB Output is correct
2 Correct 990 ms 65536 KB Output is correct
3 Correct 420 ms 65536 KB Output is correct
4 Correct 700 ms 61924 KB Output is correct