oj.uz

Submission #278120

# Submission time Handle Problem Language Result Execution time Memory
278120 2020-08-21T10:46:42 Z amiratou Gondola (IOI14_gondola) C++14
75 / 100
 71 ms 5368 KB 
#include "gondola.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define sz(x) (ll)(x.size())
const ll MOD =(ll)(1e9+9);
ll val[100005],p[250005],dp[100005][2];
set<ll> here;

int valid(int n, int inputSeq[])
{
	ll idx=-1;
	for (ll i = 0; i < n; ++i){
		if(here.find(inputSeq[i])!=here.end())return 0;
		here.insert(inputSeq[i]);
		if(inputSeq[i]<=n)idx=i;
	}
	if(idx==-1)return 1;
	ll h=inputSeq[idx];
	for (ll i = 0; i < n; ++i)
		val[(idx+i)%n]=((h-1+i)%n)+1;
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]<=n && inputSeq[i]!=val[i])return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	ll flag=-1;
	for (ll i = 0; i < n; ++i)
		if(gondolaSeq[i]<=n)flag=i;
	priority_queue<ll,vector<ll>,greater<ll> > pq;
	if(flag!=-1){
		ll g=gondolaSeq[flag];
		for (ll i = 0; i < n; ++i){
			ll r=((g-1+i)%n)+1;
			if(gondolaSeq[(flag+i)%n]!=r)pq.push(gondolaSeq[(flag+i)%n]),p[gondolaSeq[(flag+i)%n]]=r;
		}
	}
	else{
		for (ll i = 0; i < n; ++i)
			p[gondolaSeq[i]]=i+1,pq.push(gondolaSeq[i]);
	}
	ll h=n+1,idx=0;
	while(!pq.empty()){
		ll f=pq.top();
		pq.pop();
		replacementSeq[idx++]=p[f];
		while(h<f)replacementSeq[idx++]=h++;
		h++;
	}
	return idx;
}

//----------------------
ll binpow(ll a,ll b){
	if(!b)return 1;
	ll h=binpow(a,b>>1LL);
	h*=h;
	if(h>=MOD)h%=MOD;
	if(b&1LL)h*=a;
	if(h>=MOD)h%=MOD;
	return (ll)(h);
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n,inputSeq))return 0;
	ll idx=-1;
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]<=n)idx=i;
	if(idx==-1)return 1;
	ll h=inputSeq[idx];
	for (ll i = 0; i < n; ++i)
		val[(idx+i)%n]=((h-1+i)%n)+1;
	vector<ll> vec={n};
	for (ll i = 0; i < n; ++i)
		if(inputSeq[i]>n)
			vec.push_back(inputSeq[i]);
	ll ans=1;
	sort(vec.begin(),vec.end());
	for (ll i = 1; i < sz(vec); ++i)
		ans=(ans*binpow(sz(vec)-i,vec[i]-vec[i-1]-1))%MOD;
	return ans;
}

Subtask #1
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 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 2560 KB Output is correct
7 Correct 15 ms 768 KB Output is correct
8 Correct 37 ms 4472 KB Output is correct
9 Correct 9 ms 1664 KB Output is correct
10 Correct 41 ms 5248 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 2560 KB Output is correct
7 Correct 13 ms 740 KB Output is correct
8 Correct 32 ms 4472 KB Output is correct
9 Correct 9 ms 1664 KB Output is correct
10 Correct 37 ms 5248 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 20 ms 2432 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 57 ms 5368 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
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 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 14 ms 640 KB Output is correct
12 Correct 16 ms 640 KB Output is correct
13 Correct 19 ms 2064 KB Output is correct
14 Correct 12 ms 640 KB Output is correct
15 Correct 27 ms 3184 KB Output is correct

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

Subtask #8
15.0 / 15.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 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct

Subtask #9
0 / 15.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 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 71 ms 5236 KB Output is correct
10 Correct 41 ms 4600 KB Output is correct
11 Correct 15 ms 2048 KB Output is correct
12 Correct 18 ms 2304 KB Output is correct
13 Incorrect 3 ms 640 KB Output isn't correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 53 ms 5236 KB Output is correct
10 Correct 43 ms 4600 KB Output is correct
11 Correct 16 ms 2048 KB Output is correct
12 Correct 19 ms 2304 KB Output is correct
13 Incorrect 3 ms 640 KB Output isn't correct
14 Halted 0 ms 0 KB -