oj.uz

Submission #576274

# Submission time Handle Problem Language Result Execution time Memory
576274 2022-06-12T21:48:41 Z keta_tsimakuridze Teleporters (IOI08_teleporters) C++17
85 / 100
 766 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, 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 27 ms 47204 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 47272 KB Output is correct
2 Correct 35 ms 47512 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 47256 KB Output is correct
2 Correct 43 ms 47604 KB Output is correct
3 Correct 52 ms 47692 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 51620 KB Output is correct
2 Correct 268 ms 57184 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 54896 KB Output is correct
2 Correct 391 ms 59896 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 516 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 743 ms 65536 KB Output is correct
2 Runtime error 755 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 766 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -