oj.uz

Submission #165042

# Submission time Handle Problem Language Result Execution time Memory
165042 2019-11-24T18:01:21 Z kostia244 Gondola (IOI14_gondola) C++17
90 / 100
 51 ms 9948 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[4*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, GG = 0;
	if(a[p]>n) a[p] = 1, GG = 1;
	if(a[mp]<=n) return 1;
	if(!valid(n, a)) return 0;
	for(int i = 0; i < n; i++) if(a[i]>n) cout << "213213312";
	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;
		}
	}
	if(GG) (ans *= n)%=mod;
	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, GG = 0;
                 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 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 376 KB Output is correct
3 Correct 2 ms 376 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 2196 KB Output is correct
7 Correct 13 ms 632 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 4472 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 16 ms 2300 KB Output is correct
7 Correct 14 ms 748 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 4628 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 20 ms 2168 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 48 ms 4728 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 6 ms 4216 KB Output is correct
5 Correct 6 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 6 ms 4216 KB Output is correct
8 Correct 6 ms 4216 KB Output is correct
9 Correct 6 ms 4216 KB Output is correct
10 Correct 6 ms 4220 KB Output is correct
11 Correct 15 ms 4472 KB Output is correct
12 Correct 17 ms 4600 KB Output is correct
13 Correct 18 ms 5084 KB Output is correct
14 Correct 15 ms 4600 KB Output is correct
15 Correct 26 ms 6136 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 6 ms 4216 KB Output is correct
4 Correct 5 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4188 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4196 KB Output is correct
9 Correct 49 ms 8056 KB Output is correct
10 Correct 41 ms 7404 KB Output is correct
11 Correct 23 ms 5368 KB Output is correct
12 Correct 21 ms 5624 KB Output is correct
13 Correct 13 ms 4600 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4216 KB Output is correct
2 Correct 5 ms 4216 KB Output is correct
3 Correct 5 ms 4216 KB Output is correct
4 Correct 8 ms 4216 KB Output is correct
5 Correct 5 ms 4216 KB Output is correct
6 Correct 5 ms 4216 KB Output is correct
7 Correct 5 ms 4216 KB Output is correct
8 Correct 5 ms 4216 KB Output is correct
9 Correct 51 ms 7964 KB Output is correct
10 Correct 40 ms 7416 KB Output is correct
11 Correct 21 ms 5368 KB Output is correct
12 Correct 21 ms 5624 KB Output is correct
13 Correct 31 ms 4600 KB Output is correct
14 Runtime error 26 ms 9948 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -