oj.uz

Submission #757302

# Submission time Handle Problem Language Result Execution time Memory
757302 2023-06-13T04:09:28 Z SanguineChameleon Teleporters (IOI08_teleporters) C++17
85 / 100
 404 ms 64812 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int maxn = 1e6 + 20;
pair<int, int> a[maxn * 2];
int adj[maxn * 2];
bool flag[maxn];
int sz = 0;

void dfs(int u) {
	flag[u] = true;
	sz++;
	if (!flag[adj[u]]) {
		dfs(adj[u]);
	}
}

void just_do_it() {
	int n, m;
	cin >> n >> m;
	n++;
	a[1] = make_pair(0, 1);
	a[2] = make_pair(maxn * 2, n + 1);
	for (int i = 2; i <= n; i++) {
		a[i * 2 - 1].second = i;
		a[i * 2].second = n + i;
		cin >> a[i * 2 - 1].first >> a[i * 2].first;
	}
	sort(a + 1, a + n * 2 + 1);
	for (int i = 1; i <= n * 2 - 1; i++) {
		int u = a[i].second;
		int v = a[i + 1].second;
		if (v > n) {
			v -= n;
		}
		else {
			v += n;
		}
		adj[u] = v;
	}
	dfs(1);
	int res = sz - 1;
	vector<int> sizes;
	for (int i = 1; i <= n * 2; i++) {
		if (i != n + 1 && !flag[i]) {
			sz  = 0;
			dfs(i);
			sizes.push_back(sz);
		}
	}
	sort(sizes.begin(), sizes.end(), greater<int>());
	for (int i = 0; i < (int)sizes.size() && m > 0; i++) {
		res += sizes[i] + 2;
		m--;
	}
	res += 4 * (m / 2) + (m % 2);
	cout << res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 380 KB Output is correct
2 Correct 4 ms 724 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 5 ms 852 KB Output is correct
3 Correct 10 ms 1340 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 5476 KB Output is correct
2 Correct 134 ms 12880 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 9236 KB Output is correct
2 Correct 230 ms 18836 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 238 ms 41180 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 334 ms 55796 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 404 ms 64812 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -