oj.uz

Submission #285640

# Submission time Handle Problem Language Result Execution time Memory
285640 2020-08-29T11:09:53 Z amoo_safar Gondola (IOI14_gondola) C++17
40 / 100
 29 ms 1808 KB 
#include "gondola.h"

#include <bits/stdc++.h>
#define pb push_back

using namespace std;

int valid(int n, int a[]){
	vector<int> A, S;
	for(int i = 0; i < n; i++) A.pb(a[i]);
	sort(A.begin(), A.end());
	for(int i = 0; i + 1 < n; i++) if(A[i] == A[i + 1]) return 0;
	for(int i = 0; i < n; i++) if(a[i] <= n) S.pb((i - a[i] + n) % n);
	sort(S.begin(), S.end());
	for(int i = 0; i + 1 < (int) S.size(); i++) if(S[i] != S[i + 1]) return 0;
	return 1;
}

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

const int MX = 250010;
int replacement(int n, int a[], int ans[]){
	int L = (*max_element(a, a + n)) - n;
	vector<int> mk(MX, 0);
	for(int i = 0; i < n; i++)
		mk[a[i]] = 1;
	int idx = 0;
	return L;
}

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

const int Mod = 1e9 + 9;
int countReplacement(int n, int a[]){
	if(!valid(n, a)) return 0;
	vector<int> A, S;
	for(int i = 0; i < n; i++) A.pb(a[i]);
	sort(A.begin(), A.end());
	int mx = A.back();
	int res = 1;
	for(int i = n + 1; i < mx; i++){
		int idx = lower_bound(A.begin(), A.end(), i) - A.begin();
		if(A[idx] == i) continue;
		res = (1ll * res * (n - idx)) % Mod;
	}
	return res;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:27:6: warning: unused variable 'idx' [-Wunused-variable]
   27 |  int idx = 0;
      |      ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 9 ms 1008 KB Output is correct
7 Correct 21 ms 1276 KB Output is correct
8 Correct 14 ms 1656 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 21 ms 1776 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1020 KB Output is correct
7 Correct 18 ms 1404 KB Output is correct
8 Correct 13 ms 1656 KB Output is correct
9 Correct 5 ms 768 KB Output is correct
10 Correct 19 ms 1808 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 8 ms 896 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 24 ms 1520 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1280 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1280 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1280 KB Integer 0 violates the range [1, 76]
2 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 29 ms 1368 KB Output is correct
10 Correct 23 ms 1088 KB Output is correct
11 Correct 14 ms 680 KB Output is correct
12 Correct 13 ms 660 KB Output is correct
13 Incorrect 8 ms 384 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 29 ms 1368 KB Output is correct
10 Correct 25 ms 1088 KB Output is correct
11 Correct 13 ms 680 KB Output is correct
12 Correct 13 ms 788 KB Output is correct
13 Incorrect 8 ms 512 KB Output isn't correct
14 Halted 0 ms 0 KB -