oj.uz

Submission #165038

# Submission time Handle Problem Language Result Execution time Memory
165038 2019-11-24T17:53:49 Z kostia244 Gondola (IOI14_gondola) C++17
75 / 100
 49 ms 5112 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
int valid(int n, int a[]) {
	set<int> x;
	int p = 0;
	for(int i = 0; i < n; i++) {
		if(!x.insert(a[i]).second) return 0;
		if(a[p]>a[i]) p = i;
	}
	if(p>n) return true;
	int u = a[p];
	for(int i = 0; i < n; i++) {
		if(a[p]<=n&&a[p]!=u) return 0;
		if(a[p]>n)
			a[p]=u;
		p = (p+1)%n;
		u = (u%n)+1;
	}
	return 1;
}

//----------------------
int pos[250250];
int replacement(int n, int a[], int b[]) {
	memset(pos, -1, sizeof pos);
	int mp = 0, p = 0;
	for(int i = 0; i < n; i++) {
		if(a[i] > n) {
			pos[a[i]] = i;
		}
		if(a[i]>a[mp]) mp=i;
		if(a[i]<a[p]) p=i;
	}
	if(a[mp]<=n) return 0;
	int M = a[mp], l = 0;
	if(a[p]>n) a[p] = 1;
	int u = a[p];
	for(int i = 0; i < n; i++) {
		a[p] = u;
		p = (p+1)%n;
		u = (u%n)+1;
	}
	for(int i = n+1; i <= M; i++) {
		if(pos[i]!=-1) {
			b[l++] = a[pos[i]];
			a[pos[i]] = i;
		} else {
			b[l++] = a[mp];
			a[mp] = i;
		}
	}
	return l;
}

//----------------------
ll mod = 1e9+9;
int countReplacement(int n, int a[]) {
	ll ans = 1, use = 0;
	memset(pos, -1, sizeof pos);
	int mp = 0, p = 0;
	for(int i = 0; i < n; i++) {
		if(a[i] > n) {
			pos[a[i]] = i;
			use++;
		}
		if(a[i]>a[mp]) mp=i;
		if(a[i]<a[p]) p=i;
	}
	int M = a[mp], l = 0;
	if(a[p]>n) a[p] = 1;
	if(a[mp]<=n) return 1;
	if(!valid(n, a)) return 0;
	for(int i = n+1; i <= M; i++) {
		if(pos[i]!=-1) {
			a[pos[i]] = i;
			use--;
		} else {
			ans = (ans*use)%mod;
			a[mp] = i;
		}
	}
	return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:74:17: warning: unused variable 'l' [-Wunused-variable]
  int M = a[mp], l = 0;
                 ^

Subtask #1
5.0 / 5.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 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2168 KB Output is correct
7 Correct 14 ms 760 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 36 ms 4576 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2168 KB Output is correct
7 Correct 13 ms 760 KB Output is correct
8 Correct 30 ms 3960 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 36 ms 4600 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 20 ms 2040 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 47 ms 4700 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 13 ms 1532 KB Output is correct
12 Correct 15 ms 1656 KB Output is correct
13 Correct 17 ms 2296 KB Output is correct
14 Correct 13 ms 1528 KB Output is correct
15 Correct 23 ms 3064 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 46 ms 4984 KB Output is correct
10 Correct 37 ms 4472 KB Output is correct
11 Correct 18 ms 2424 KB Output is correct
12 Correct 19 ms 2680 KB Output is correct
13 Incorrect 10 ms 1656 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 49 ms 5112 KB Output is correct
10 Correct 38 ms 4472 KB Output is correct
11 Correct 18 ms 2424 KB Output is correct
12 Correct 19 ms 2680 KB Output is correct
13 Incorrect 11 ms 1656 KB Output isn't correct
14 Halted 0 ms 0 KB -