oj.uz

Submission #576276

# Submission time Handle Problem Language Result Execution time Memory
576276 2022-06-12T21:49:37 Z keta_tsimakuridze Teleporters (IOI08_teleporters) C++14
85 / 100
 828 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 2e6 + 5, M = 2e6 + 1, mod = 1e9 + 7; //!
int t, vis[N];
pii to[N];
main() {
//	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int n, m;
	cin >> n >> m;
	
	for(int i = 0; i <= M - 1; i++) to[i] = {i + 1, 0};
	for(int i = 1; i <= n; i++) {
		int l, r;
		cin >> l >> r;
		to[l - 1] = {r, 1};
		to[r - 1] = {l, 1};
	}
	multiset<int> s;
	int init = 0;
	for(int i = 0; i <= M; i++) {
		if(!vis[i]) {
			int cn = 0, x = i;
			while(!vis[x]) {
				cn += to[x].s;
				vis[x] = 1;
				x = to[x].f;
			}
			if(!i) init = cn;
			else s.insert(cn);
		}
	}
	while(m--) {
		if(s.size()) init += *--s.end() + 2, s.erase(s.find(*--s.end()));
		else {
			init++;
			s.insert(1);
		}
	}
	cout << init;
}

Compilation message

teleporters.cpp:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main() {
      | ^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 47376 KB Output is correct
2 Correct 39 ms 47472 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47308 KB Output is correct
2 Correct 45 ms 47812 KB Output is correct
3 Correct 49 ms 47552 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 50320 KB Output is correct
2 Correct 288 ms 53228 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 52312 KB Output is correct
2 Correct 423 ms 53644 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 526 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 796 ms 65536 KB Output is correct
2 Runtime error 803 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 828 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -