oj.uz

Submission #896806

# Submission time Handle Problem Language Result Execution time Memory
896806 2024-01-02T08:02:07 Z LCJLY Gondola (IOI14_gondola) C++14
75 / 100
 25 ms 7072 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int arr[]){
	unordered_set<int>se;
	bool amos=true;
	deque<int>d;
	int mini=INT_MAX;
	set<int>shift;
	for(int x=0;x<n;x++){
		if(se.find(arr[x])!=se.end()) amos=false;
		se.insert(arr[x]);
		if(arr[x]<=n){
			d.push_back(arr[x]);
			mini=min(mini,arr[x]);
			if(arr[x]>=x+1){
				shift.insert(arr[x]-(x+1));
			}
			else{
				shift.insert(arr[x]+n-(x+1));
			}
		}	
	}
	
	if(shift.size()>1) amos=false;
	
	return amos;
}

int replacement(int n, int arr[], int ans[]){
	int maxi=0;
	int shift=-1;
	deque<int>d;
	for(int x=0;x<n;x++){
		maxi=max(maxi,arr[x]);
		if(arr[x]<=n){
			if(arr[x]>=x+1){
				shift=arr[x]-(x+1);
			}
			else{
				shift=arr[x]+n-(x+1);
			}
		}
		d.push_back(arr[x]);
	}
	
	while(shift>0){
		shift--;
		d.push_front(d.back());
		d.pop_back();
	}
	
	vector<pair<int,int>>v;
	for(int x=0;x<n;x++){
		if(d[x]>n){
			v.push_back({d[x],x});
		}
	}
	
	sort(v.begin(),v.end());
	
	int index=0;
	int cur=n;
	for(auto it:v){
		bool done=true;
		while(cur<it.first){
			if(done){
				ans[index]=it.second+1;
				done=false;
				index++;
			}
			else{
				ans[index]=cur;
				index++;
			}
			cur++;
		}
	}
	
	return maxi-n;
}

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

int mod=1000000009;

long long f(long long a, long long b){
	if(a==1||b==0) return 1;
	if(b==1) return a;
	int hold=f((a*a)%mod,b/2);
	if(b%2) hold=(hold*a)%mod;
	return hold;
}

int countReplacement(int n, int arr[]){
	int arr2[n];
	for(int x=0;x<n;x++) arr2[x]=arr[x];
	if(valid(n,arr2)==0) return 0;
	int maxi=0;
	vector<int>v;
	int mini=INT_MAX;
	for(int x=0;x<n;x++){
		maxi=max(maxi,arr[x]);
		mini=min(mini,arr[x]);
		if(arr[x]>n)v.push_back(arr[x]);
	}
	if(maxi==n) return 1;
	int cur=n;
	int counter=1;
	sort(v.begin(),v.end());
	int sz=v.size();
	//show(sz,sz);
	for(auto it:v){
		int gap=max(0,it-cur-1);
		counter=(counter*f(sz,gap))%mod;
		cur=it;
		sz--;
	}
	//show(check,1);
	if(mini>n){
		counter=(counter*n)%mod;
	}
	return counter;
}
//

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 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 #2
5.0 / 5.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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 2188 KB Output is correct
7 Correct 21 ms 4972 KB Output is correct
8 Correct 10 ms 3816 KB Output is correct
9 Correct 4 ms 1628 KB Output is correct
10 Correct 11 ms 4204 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 432 KB Output is correct
6 Correct 5 ms 2232 KB Output is correct
7 Correct 25 ms 4984 KB Output is correct
8 Correct 10 ms 3692 KB Output is correct
9 Correct 3 ms 1628 KB Output is correct
10 Correct 13 ms 4456 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 6 ms 1924 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 24 ms 7072 KB Output is correct

Subtask #4
5.0 / 5.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 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 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 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 10 ms 1516 KB Output is correct
14 Correct 6 ms 860 KB Output is correct
15 Correct 15 ms 2428 KB Output is correct

Subtask #7
5.0 / 5.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 500 KB Output is correct

Subtask #8
15.0 / 15.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
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 444 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 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 400 KB Output is correct
7 Correct 0 ms 428 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 20 ms 4456 KB Output is correct
10 Correct 14 ms 3736 KB Output is correct
11 Correct 5 ms 1884 KB Output is correct
12 Correct 7 ms 1976 KB Output is correct
13 Incorrect 2 ms 756 KB Integer -643084670 violates the range [0, 1000000008]
14 Halted 0 ms 0 KB -

Subtask #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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 19 ms 4736 KB Output is correct
10 Correct 14 ms 3948 KB Output is correct
11 Correct 6 ms 1884 KB Output is correct
12 Correct 7 ms 1976 KB Output is correct
13 Incorrect 2 ms 600 KB Integer -643084670 violates the range [0, 1000000008]
14 Halted 0 ms 0 KB -