oj.uz

Submission #140659

# Submission time Handle Problem Language Result Execution time Memory
140659 2019-08-04T10:25:49 Z baluteshih Gondola (IOI14_gondola) C++14
100 / 100
 39 ms 2424 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const ll MOD=1e9+9;

int valid(int n, int inputSeq[])
{
	int p=min_element(inputSeq,inputSeq+n)-inputSeq;
	vector<int> v(inputSeq,inputSeq+n);
	sort(ALL(v));
	for(int i=0;i+1<n;++i)
		if(v[i]==v[i+1]) return 0;
	if(inputSeq[p]>n) return 1;
	for(int i=p;i<p+n;++i)
		if(inputSeq[i%n]<=n&&inputSeq[i%n]!=inputSeq[p]+i-p)
			return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vector<int> org(n);
	int p=min_element(gondolaSeq,gondolaSeq+n)-gondolaSeq;
	if(gondolaSeq[p]>n)
		for(int i=0;i<n;++i)
			org[i]=i+1;
	else
		for(int i=p;i<p+n;++i)
			org[i%n]=(gondolaSeq[p]+i-p-1)%n+1;
	vector<pii> v;
	for(int i=0;i<n;++i)
		if(gondolaSeq[i]>n)
			v.pb(MP(gondolaSeq[i],i));
	sort(ALL(v));
	int nw=n+1,tp=0;
	for(pii i:v)
	{
		replacementSeq[tp++]=org[i.S];
		while(nw<=i.F)
			replacementSeq[tp++]=nw++;
		--tp;
	}
	return tp;
}

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

ll pw(ll a,ll n)
{
	ll re=1;
	for(;n;n>>=1,a=a*a%MOD)
		if(n&1) re=re*a%MOD;
	return re;
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n,inputSeq)) return 0;
	ll ans=1;
	if(*min_element(inputSeq,inputSeq+n)>n) ans=n;
	vector<int> v;
	for(int i=0;i<n;++i)
		if(inputSeq[i]>n)
			v.pb(inputSeq[i]);
	sort(ALL(v),greater<int>());
	for(int ls=n+1;!v.empty();ls=v.back()+1,v.pop_back())
		ans*=pw(v.size(),v.back()-ls),ans%=MOD;
	return ans;
}

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 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 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 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 10 ms 632 KB Output is correct
7 Correct 20 ms 1016 KB Output is correct
8 Correct 14 ms 888 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 19 ms 1016 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 376 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 9 ms 632 KB Output is correct
7 Correct 20 ms 1016 KB Output is correct
8 Correct 14 ms 888 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 20 ms 1016 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 21 ms 1016 KB Output is correct

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

Subtask #5
10.0 / 10.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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 13 ms 888 KB Output is correct
12 Correct 14 ms 1020 KB Output is correct
13 Correct 19 ms 1268 KB Output is correct
14 Correct 12 ms 888 KB Output is correct
15 Correct 23 ms 2272 KB Output is correct

Subtask #7
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 376 KB Output is correct

Subtask #8
15.0 / 15.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 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 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 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 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 25 ms 1484 KB Output is correct
10 Correct 21 ms 1404 KB Output is correct
11 Correct 9 ms 760 KB Output is correct
12 Correct 11 ms 888 KB Output is correct
13 Correct 4 ms 376 KB Output is correct

Subtask #10
10.0 / 10.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 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 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 25 ms 1100 KB Output is correct
10 Correct 20 ms 1024 KB Output is correct
11 Correct 9 ms 632 KB Output is correct
12 Correct 11 ms 632 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 39 ms 2340 KB Output is correct
15 Correct 36 ms 2424 KB Output is correct
16 Correct 8 ms 760 KB Output is correct
17 Correct 24 ms 1644 KB Output is correct
18 Correct 15 ms 1248 KB Output is correct