oj.uz

Submission #546478

# Submission time Handle Problem Language Result Execution time Memory
546478 2022-04-07T16:43:37 Z Pherokung Teleporters (IOI08_teleporters) C++14
100 / 100
 325 ms 34876 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m,a,b,tp[2000005],vis[2000005],pos,ans,cnt; 
priority_queue<int> pq;
queue<int> q;
vector<int> v;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&a,&b);
		tp[a] = b;
		tp[b] = a;
	}
	ans = 0;
	vis[2000001] = 1;
	pos = 1;
	while(vis[pos] == 0){
		vis[pos] = 1;
		if(tp[pos] != 0){
			pos = tp[pos] + 1;
			ans++;
		}
		else pos++;
	}
	for(int i=1;i<=2000000;i++){
		if(vis[i] == 0){
			pos = i;
			cnt = 0;
			while(vis[pos] == 0){
				vis[pos] = 1;
				if(tp[pos] != 0){
					pos = tp[pos] + 1;
					cnt++;
				}
				else pos++;
			}
			pq.push(cnt+2);
		}
	}
	
	while(!pq.empty() && m > 0){
		//printf("TT %d\n",pq.top());
		ans += pq.top();
		pq.pop();
		m--;
	}
	
	ans += 4 * (m/2) + m % 2;
	printf("%d",ans);
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
teleporters.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |   scanf("%d%d",&a,&b);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8244 KB Output is correct
2 Correct 10 ms 8532 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8260 KB Output is correct
2 Correct 12 ms 8788 KB Output is correct
3 Correct 13 ms 8708 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 12092 KB Output is correct
2 Correct 111 ms 19524 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 16512 KB Output is correct
2 Correct 166 ms 23084 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 27200 KB Output is correct
2 Correct 234 ms 29080 KB Output is correct
3 Correct 248 ms 30524 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 30924 KB Output is correct
2 Correct 304 ms 31896 KB Output is correct
3 Correct 261 ms 30252 KB Output is correct
4 Correct 268 ms 30512 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 34784 KB Output is correct
2 Correct 323 ms 34876 KB Output is correct
3 Correct 264 ms 34556 KB Output is correct
4 Correct 268 ms 34724 KB Output is correct