oj.uz

Submission #114377

# Submission time Handle Problem Language Result Execution time Memory
114377 2019-06-01T06:44:07 Z E869120 Gondola (IOI14_gondola) C++14
60 / 100
 66 ms 4828 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
	int minx = (1 << 30), minid = -1; map<int, int>Map;
	for (int i = 0; i < n; i++) { if (minx > inputSeq[i]) { minx = inputSeq[i]; minid = i; } if (Map[inputSeq[i]] == 1) return 0; Map[inputSeq[i]] = 1;}
	for (int i = 0; i < n; i++) {
		int s = (i + minid) % n;
		if (inputSeq[s] <= n && inputSeq[s] != i + 1) return 0;
	}
	return 1;
}

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

int id[250009];

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int G = 0; for (int i = 0; i < n; i++) { if (gondolaSeq[i] <= n) G = (i - (gondolaSeq[i] - 1) + n) % n; }
	
	int maxn = 0;
	for (int i = 0; i <= 250000; i++) id[i] = -1;
	for (int i = 0; i < n; i++) { id[gondolaSeq[i]] = (i - G + n) % n; maxn = max(maxn, gondolaSeq[i]); }
	
	for (int i = 0; i < n; i++) gondolaSeq[i] = i + 1;
	for (int i = n + 1; i <= maxn; i++) {
		if (id[i] >= 0) {
			replacementSeq[i - (n + 1)] = gondolaSeq[id[i]];
			gondolaSeq[id[i]] = i;
		}
		else {
			replacementSeq[i - (n + 1)] = gondolaSeq[id[maxn]];
			gondolaSeq[id[maxn]] = i;
		}
	}
	return maxn - n;
}

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

const int mod = 1000000009;

long long modpow(int a, int b, long long m) {
	long long p = 1, q = a;
	for (int i = 0; i < 31; i++) {
		if ((b / (1 << i)) % 2 == 1) { p *= q; p %= m; }
		q *= q; q %= m;
	}
	return p;
}

int countReplacement(int n, int inputSeq[]) {
	if (valid(n, inputSeq) == 0) return 0;
	
	vector<int>vec; vec.push_back(n);
	for (int i = 0; i < n; i++) { if (inputSeq[i] > n) vec.push_back(inputSeq[i]); }
	sort(vec.begin(), vec.end());
	reverse(vec.begin(), vec.end());
	
	long long F = 1;
	for (int i = 0; i < vec.size() - 1; i++) {
		long long E = modpow(i + 1, vec[i] - vec[i + 1] - 1, mod);
		F *= E; F %= mod;
	}
	if ((int)vec.size() > n) { F *= n; F %= mod; }
	return (int)F;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:62:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vec.size() - 1; i++) {
                  ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 6 ms 256 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 40 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 17 ms 2304 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 30 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 42 ms 4600 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 23 ms 2168 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 66 ms 4828 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1408 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1252 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 3 ms 1280 KB Output is correct
8 Correct 3 ms 1280 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 3 ms 1280 KB Output is correct
11 Correct 11 ms 1664 KB Output is correct
12 Correct 13 ms 1664 KB Output is correct
13 Correct 13 ms 2176 KB Output is correct
14 Correct 12 ms 1652 KB Output is correct
15 Correct 18 ms 3072 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -