oj.uz

Submission #1025761

# Submission time Handle Problem Language Result Execution time Memory
1025761 2024-07-17T09:42:08 Z socpite Gondola (IOI14_gondola) C++17
75 / 100
 37 ms 4500 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

const int maxn = 3e5+5;
const int mod = 1e9+9;

long long binpow(long long x, int e){
	long long re = 1;
	while(e){
		if(e&1)re = re*x%mod;
		x = x*x%mod;
		e>>=1;
	}
	return re;
}

int valid(int n, int inputSeq[])
{
	map<int, int> vis;
	int dist = -1;
	for(int i = 0; i < n; i++)inputSeq[i]--;
	for(int i = 0; i < n; i++){
		if(vis[inputSeq[i]])return 0;
		vis[inputSeq[i]] = 1;
		if(inputSeq[i] < n){
			int d = (i + n - inputSeq[i])%n;
			if(dist == -1)dist = d;
			else if(dist != d)return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vector<pair<int, int>> vec;
	int dist = 0;
	for(int i = 0; i < n; i++){
		gondolaSeq[i]--;
		if(gondolaSeq[i] < n){
			dist = (gondolaSeq[i] - i + n)%n;
		}
		else {
			vec.push_back({gondolaSeq[i], i});
		}
	}
	int crr = 0;
	sort(vec.begin(), vec.end());
	for(auto v: vec){
		replacementSeq[crr++] = (v.second + dist)%n + 1;
		while(crr+n <= v.first){
			replacementSeq[crr] = crr + n;
			crr++;
		}
	}
	return crr;
}

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

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq))return 0;
	vector<int> vec;
	int dist = 0;
	for(int i = 0; i < n; i++){
		if(inputSeq[i] >= n)vec.push_back(inputSeq[i]);
	}
	int prv = n-1;
	sort(vec.begin(), vec.end());
	int sz = vec.size();
	long long ans = 1;
	for(int i = 0; i < sz; i++){
		ans = ans*binpow(sz - i, vec[i] - prv-1)%mod;
		prv = vec[i];
	}
	return ans;
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 9 ms 2140 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 16 ms 3932 KB Output is correct
9 Correct 5 ms 1384 KB Output is correct
10 Correct 21 ms 4444 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2140 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 17 ms 4052 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 21 ms 4500 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 604 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Correct 10 ms 1260 KB Output is correct
14 Correct 5 ms 604 KB Output is correct
15 Correct 12 ms 2388 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 448 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 440 KB Output is correct
9 Correct 37 ms 4436 KB Output is correct
10 Correct 26 ms 3672 KB Output is correct
11 Correct 12 ms 1628 KB Output is correct
12 Correct 11 ms 1880 KB Output is correct
13 Incorrect 3 ms 604 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 32 ms 4492 KB Output is correct
10 Correct 25 ms 3912 KB Output is correct
11 Correct 9 ms 1628 KB Output is correct
12 Correct 11 ms 1880 KB Output is correct
13 Incorrect 2 ms 604 KB Output isn't correct
14 Halted 0 ms 0 KB -