oj.uz

Submission #247511

# Submission time Handle Problem Language Result Execution time Memory
247511 2020-07-11T14:28:47 Z Evirir Gondola (IOI14_gondola) C++17
45 / 100
 22 ms 2304 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 1e9+9;

bool DEBUG = 0;
const int MAXN = 100005;

ll add(ll a, ll b){
	a+=b;
	a%=MOD;
	return a;
}

ll mult(ll a, ll b){
	if(a>=MOD) a%=MOD;
	if(b>=MOD) b%=MOD;
	return (a*b)%MOD;
}

int valid(int n, int inputSeq[])
{
	int minid=0;
	forn(i,0,n){
		if(inputSeq[minid]>inputSeq[i]){
			minid=i;
		}
	}
	
	int tmp[n];
	forn(i,0,n){
		tmp[i]=inputSeq[(minid+i)%n];
	}
	forn(i,0,n) inputSeq[i]=tmp[i];
	
	bool used[200005]{};
	int last=-1;
	for(int i=0;i<n;i++){
		if(used[inputSeq[i]]) return 0;
		used[inputSeq[i]]=1;
		
		if(inputSeq[i]<=n){
			if(last!=-1 && inputSeq[i]-inputSeq[last]!=i-last) return 0;
			last=i;
		}
	}
	
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	assert(valid(n, gondolaSeq));
	
	int loc[200005];
	mset(loc,-1);
	
	int large=0;
	for(int i=0;i<n;i++){
		loc[gondolaSeq[i]]=i;
		if(gondolaSeq[i]>gondolaSeq[large]){
			large=i;
		}
	}
	
	int a[n];
	int start=0,startval=1;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i]<=n){
			start=i;
			startval=gondolaSeq[i];
			break;
		}
	}
	for(int i=(start+1)%n;i!=start;i=(i+1)%n){
		a[i]=(i-start+startval+n)%n;
	}
	
	int ptr=0;
	for(int i=n+1;i<=gondolaSeq[large];i++){
		if(loc[i] == -1){
			//cout<<"Not found\n";
			replacementSeq[ptr++]=a[large];
			a[large]=i;
		}
		else{
			//cout<<"Found\n";
			replacementSeq[ptr++] = a[loc[i]];
			a[loc[i]]=i;
		}
	}
	
	return ptr;
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq)) return 0;
	
	ll ans=1;
	int cnt[200005]{}, loc[200005];
	mset(loc,-1);
	for(int i=0;i<n;i++){
		loc[inputSeq[i]]=i;
	}
	
	int Max=-1;
	forn(i,0,n){
		Max=max(Max, inputSeq[i]);
		cnt[inputSeq[i]]++;
	}
	
	int cur=0;
	forn(i,0,n){
		if(inputSeq[i]>n) cur++;
	}
	for(int i=n+1;i<=Max;i++){
		if(loc[i]!=-1){
			cur--;
			continue;
		}
		ans=mult(ans, cur);
	}
	
	return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 11 ms 1140 KB Output is correct
7 Correct 18 ms 1664 KB Output is correct
8 Correct 17 ms 1536 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 18 ms 1664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 544 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 11 ms 1024 KB Output is correct
7 Correct 19 ms 1664 KB Output is correct
8 Correct 16 ms 1536 KB Output is correct
9 Correct 8 ms 768 KB Output is correct
10 Correct 22 ms 1664 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 19 ms 1664 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 6 ms 1304 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Incorrect 6 ms 1312 KB Integer 0 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 6 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Incorrect 5 ms 1280 KB Integer 0 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 1280 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 16 ms 2176 KB Output is correct
11 Incorrect 9 ms 896 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1280 KB Output is correct
2 Correct 5 ms 1280 KB Output is correct
3 Correct 5 ms 1280 KB Output is correct
4 Correct 5 ms 1280 KB Output is correct
5 Correct 5 ms 1280 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 1280 KB Output is correct
9 Correct 19 ms 2304 KB Output is correct
10 Correct 17 ms 2176 KB Output is correct
11 Incorrect 8 ms 896 KB Output isn't correct
12 Halted 0 ms 0 KB -