oj.uz

Submission #763874

# Submission time Handle Problem Language Result Execution time Memory
763874 2023-06-23T01:42:17 Z SanguineChameleon Gondola (IOI14_gondola) C++17
100 / 100
 38 ms 6252 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
	set<int> s;
	for (int i = 0; i < n; i++) {
		s.insert(inputSeq[i]);
	}
	if ((int)s.size() != n) {
		return 0;
	}
	int off = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			off = (i + n - inputSeq[i] + 1) % n;
			break;
		}
	}
	if (off != -1) {
		for (int i = 0; i < n; i++) {
			if (inputSeq[(i + off) % n] <= n && inputSeq[(i + off) % n] != i + 1) {
				return 0;
			}
		}
	}
	return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int off = 0;
	for (int i = 0; i < n; i++) {
		if (gondolaSeq[i] <= n) {
			off = (i + n - gondolaSeq[i] + 1) % n;
			break;
		}
	}
	vector<pair<int, int>> last;
	for (int i = 0; i < n; i++) {
		if (gondolaSeq[(i + off) % n] != i + 1) {
			last.emplace_back(gondolaSeq[(i + off) % n], i + 1);
		}
	}
	if (last.empty()) {
		return 0;
	}
	sort(last.begin(), last.end());
	int sz = last.size();
	int prv = last.back().second;
	for (int i = 0; i < sz; i++) {
		for (int j = (i > 0 ? last[i - 1].first + 1 : n + 1); j < last[i].first; j++) {
			replacementSeq[j - n - 1] = prv;
			prv = j;
		}
		replacementSeq[last[i].first - n - 1] = (i < sz - 1 ? last[i].second : prv);
	}
	return last[sz - 1].first - n;
}

//----------------------

const long long mod = 1e9 + 9;

long long bin_pow(long long x, int y) {
	long long res = 1;
	while (y) {
		if (y & 1) {
			res = res * x % mod;
		}
		y >>= 1;
		x = x * x % mod;
	}
	return res;
}

int countReplacement(int n, int inputSeq[]) {
	set<int> s;
	for (int i = 0; i < n; i++) {
		s.insert(inputSeq[i]);
	}
	if ((int)s.size() != n) {
		return 0;
	}
	int off = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			off = (i + n - inputSeq[i] + 1) % n;
			break;
		}
	}
	if (off != -1) {
		for (int i = 0; i < n; i++) {
			if (inputSeq[(i + off) % n] <= n && inputSeq[(i + off) % n] != i + 1) {
				return 0;
			}
		}
	}
	vector<int> last;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] > n) {
			last.push_back(inputSeq[i]);
		}
	}
	sort(last.begin(), last.end());
	int sz = last.size();
	long long res = 1;
	for (int i = 0; i < sz; i++) {
		res = res * bin_pow(sz - i, last[i] - (i > 0 ? last[i - 1] : n) - 1) % mod;
	}
	if (off == -1) {
		res = res * n % mod;
	}
	return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 2176 KB Output is correct
7 Correct 20 ms 3552 KB Output is correct
8 Correct 15 ms 3936 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 20 ms 4536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 2132 KB Output is correct
7 Correct 20 ms 3668 KB Output is correct
8 Correct 15 ms 3856 KB Output is correct
9 Correct 5 ms 1364 KB Output is correct
10 Correct 21 ms 4528 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 9 ms 2004 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 25 ms 4552 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 596 KB Output is correct
12 Correct 8 ms 596 KB Output is correct
13 Correct 11 ms 1256 KB Output is correct
14 Correct 6 ms 596 KB Output is correct
15 Correct 16 ms 2252 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 26 ms 4804 KB Output is correct
10 Correct 21 ms 4116 KB Output is correct
11 Correct 8 ms 1704 KB Output is correct
12 Correct 11 ms 2004 KB Output is correct
13 Correct 2 ms 724 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 408 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 26 ms 4924 KB Output is correct
10 Correct 21 ms 4056 KB Output is correct
11 Correct 7 ms 1748 KB Output is correct
12 Correct 10 ms 2096 KB Output is correct
13 Correct 2 ms 732 KB Output is correct
14 Correct 33 ms 5672 KB Output is correct
15 Correct 38 ms 6252 KB Output is correct
16 Correct 6 ms 1492 KB Output is correct
17 Correct 27 ms 4412 KB Output is correct
18 Correct 13 ms 2800 KB Output is correct