oj.uz

Submission #442920

# Submission time Handle Problem Language Result Execution time Memory
442920 2021-07-09T10:55:19 Z jesus_coconut Teleporters (IOI08_teleporters) C++17
100 / 100
 664 ms 62076 KB 
#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define S second
#define F first
using namespace std;

int const N = 2000005;

void countsort(vector<int> &v) {
	array<bool, N> tmp{};
	for (auto a : v) {
		assert(a < N);
		tmp[a] = true;
	}
	v.clear();
	for (int i = 0; i < N; ++i) {
		if (tmp[i]) {
			v.push_back(i);
		}
	}
}

void cs2(vector<int> &v) {
	array<int, N> tmp{};
	for (auto a : v) {
		assert(a < N);
		tmp[a]++;
	}
	v.clear();
	for (int i = N - 1; i > 0; --i) {
		while (tmp[i] > 0) {
			v.push_back(i);
			tmp[i]--;
		}
	}
}

void cc(vector<pair<int, int>> &v) {
	vector<int> tmp;
	tmp.reserve(v.size());
	for (auto &[a, b] : v) {
		tmp.push_back(a);
		tmp.push_back(b);
	}
	countsort(tmp);
	for (auto &[a, b] : v) {
		a = lower_bound(all(tmp), a) - begin(tmp);
		b = lower_bound(all(tmp), b) - begin(tmp);
	}
}

void countsort(vector<pair<int, int>> &v) {
	array<int, N> tmp{};
	tmp.fill(-1);
	for (auto &[a, b] : v) {
		assert(a < N);
		tmp[a] = b;
	}
	v.clear();
	for (int i = 0; i < N; ++i) {
		if (tmp[i] != -1) {
			v.emplace_back(i, tmp[i]);
		}
	}
}

vector<bool> bio;
vector<int> len;
vector<int> nxt;
int l, tar;
void findcyc(int ver) {
	bio[ver] = true;
	if (ver == tar) {
		len.push_back(l);
		return;
	}
	++l;
	findcyc(nxt[ver]);
}

void solve() {
	int n, m;
	cin >> n >> m;
	bio.resize(2 * n);
	nxt.resize(2 * n);
	len.reserve(n);
	vector<pair<int, int>> v;
	v.reserve(2 * n);
	for (int i = 0; i < n; ++i) {
		int a, b;
		cin >> a >> b;
		v.emplace_back(a, b);
		v.emplace_back(b, a);
	}
	countsort(v);
	cc(v);
	for (int i = 0; i < 2 * n; ++i) {
		nxt[i] = (v[i].S + 1) % (2 * n);
	}
	v.clear();
	v.shrink_to_fit();
	for (int i = 0; i < 2 * n; ++i) {
		if (!bio[nxt[i]]) {
			l = 1;
			tar = i;
			findcyc(nxt[i]);
		}
	}
	bio.clear();
	bio.shrink_to_fit();
	nxt.clear();
	nxt.shrink_to_fit();
	int ans = len[0];
	len[0] = 0;
	cs2(len);
	int i = 0;
	for (; i < m && i < len.size(); ++i) {
		if (len[i] > 0) {
			ans += len[i] + 2;
		} else break;
	}
	int lft = m - i;
	if (lft % 2 == 1) {
		lft--;
		ans++;
	}
	ans += 2 * lft;
	cout << ans << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	solve();

	return 0;
}

Compilation message

teleporters.cpp: In function 'void solve()':
teleporters.cpp:117:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |  for (; i < m && i < len.size(); ++i) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 8268 KB Output is correct
2 Correct 27 ms 8524 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 8268 KB Output is correct
2 Correct 30 ms 8716 KB Output is correct
3 Correct 36 ms 9312 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 13072 KB Output is correct
2 Correct 236 ms 19912 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 16424 KB Output is correct
2 Correct 341 ms 25740 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 398 ms 32680 KB Output is correct
2 Correct 474 ms 37676 KB Output is correct
3 Correct 437 ms 40524 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 658 ms 42736 KB Output is correct
2 Correct 653 ms 45548 KB Output is correct
3 Correct 529 ms 61416 KB Output is correct
4 Correct 535 ms 62076 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 664 ms 47608 KB Output is correct
2 Correct 649 ms 47492 KB Output is correct
3 Correct 584 ms 47556 KB Output is correct
4 Correct 543 ms 47640 KB Output is correct