oj.uz

Submission #127795

# Submission time Handle Problem Language Result Execution time Memory
127795 2019-07-10T06:12:30 Z tinjyu Gondola (IOI14_gondola) C++14
90 / 100
 28 ms 4984 KB 
#include "gondola.h"
#include <iostream>
using namespace std;
long long int ans[1000005];
long long int a[1000005],b[1000005],n;
int qs(int s,int e)
{
	if(s>=e)return 0;
	int l=s,r=e,mid=(a[l]+a[r])/2;
	while(l<=r)
	{
		while(a[l]<mid)l++;
		while(a[r]>mid)r--;
		if(l<=r)
		{
			swap(a[l],a[r]);
			swap(b[l],b[r]);
			l++;
			r--;
		}
	}
	qs(s,r);
	qs(l,e);
}
int valid(int N, int a[])
{
	n=N;
	int tmp=-1,mi=500005,tag[500005];
	for(int i=0;i<=500000;i++)tag[i]=0;
	for(int i=0;i<n;i++)
	{
		if(tag[a[i]]==1)return 0;
		tag[a[i]]++;
	}
	for(int i=0;i<n;i++)
	if(a[i]<=n && a[i]<mi)
	{
		tmp=i;
		mi=a[i];
	}
	if(tmp==-1)return 1;
	int p=n-1,i=tmp,t=mi;
	while(p--)
	{
		i++;
		i%=n;
		t++;
		if(a[i]<=n && a[i]!=t)return 0;
	}
 
	return 1;
}
 
 
//----------------------
 
int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
	n=N;
	int t=-1;
	for(int i=0;i<n;i++)a[i]=gondolaSeq[i];
	for(int i=0;i<n;i++)
	{
		if(a[i]<=n)
		{
			t=i;
			break;
		}
	}
	if(t==-1)for(int i=0;i<n;i++)b[i]=i+1;
	else
	{
		b[t]=a[t];
		int now=a[t],i=t;
		int p=n-1;
		while(p--)
		{
			i++;
			i%=n;
			now=now%n+1;
			b[i]=now;
		}
	}
	//for(int i=0;i<n;i++)cout<<a[i]<<" "<<b[i]<<endl;
	qs(0,n-1);
	//for(int i=0;i<n;i++)cout<<a[i]<<" "<<b[i]<<endl;
	int ans1=0,x=n+1;
	for(int i=0;i<n;i++)
	{
		while(a[i]!=b[i])
		{
			
			replacementSeq[ans1]=b[i];
			b[i]=x;
			ans1++;
			x++;
		}
	}
  	return ans1;
}
 
//----------------------
 
int countReplacement(int N, int inputSeq[])
{
	if(valid(N,inputSeq)==0)return 0;
	n=N;
	int t=-1;
	for(int i=0;i<n;i++)a[i]=inputSeq[i];
	for(int i=0;i<n;i++)
	{
		if(a[i]<=n)
		{
			t=i;
			break;
		}
	}
	long long int ans1=1,x=n+1,tmp;
	if(t==-1)
	{
		for(int i=0;i<n;i++)b[i]=i+1;
		ans1=(ans1*n)%1000000009;
	}
	else
	{
		b[t]=a[t];
		long long int now=a[t],i=t;
		long long int p=n-1;
		while(p--)
		{
			i++;
			i%=n;
			now=now%n+1;
			b[i]=now;
		}
	}
	//for(int i=0;i<n;i++)cout<<a[i]<<" "<<b[i]<<endl;
	qs(0,n-1);
	//for(int i=0;i<n;i++)cout<<a[i]<<" "<<b[i]<<endl;
	
	
	for(long long int i=0;i<n;i++)
	{
		tmp=0;
		while(a[i]!=b[i])
		{
			
			b[i]=x;
			tmp++;
			x++;
		}
		if(tmp!=0)
		{
			ans[0]++;
			ans[ans[0]]=tmp;
		}
	}
	for(long long int i=1;i<=ans[0];i++)
	{
		//cout<<ans[i]<<" ";
		for(long long int j=1;j<=ans[i]-1;j++)ans1=(ans1*(ans[0]-i+1))%1000000009;
	}
  	return ans1;
}

Compilation message

gondola.cpp: In function 'int qs(int, int)':
gondola.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2296 KB Output is correct
2 Correct 3 ms 2296 KB Output is correct
3 Correct 3 ms 2296 KB Output is correct
4 Correct 3 ms 2296 KB Output is correct
5 Correct 3 ms 2296 KB Output is correct
6 Correct 10 ms 2424 KB Output is correct
7 Correct 15 ms 2680 KB Output is correct
8 Correct 16 ms 2552 KB Output is correct
9 Correct 7 ms 2424 KB Output is correct
10 Correct 16 ms 2680 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 4 ms 2296 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 4 ms 2296 KB Output is correct
5 Correct 3 ms 2296 KB Output is correct
6 Correct 9 ms 2424 KB Output is correct
7 Correct 15 ms 2680 KB Output is correct
8 Correct 14 ms 2552 KB Output is correct
9 Correct 7 ms 2296 KB Output is correct
10 Correct 17 ms 2680 KB Output is correct
11 Correct 4 ms 2296 KB Output is correct
12 Correct 4 ms 2296 KB Output is correct
13 Correct 9 ms 2424 KB Output is correct
14 Correct 4 ms 2296 KB Output is correct
15 Correct 17 ms 2552 KB Output is correct

Subtask #4
5.0 / 5.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 376 KB Output is correct
4 Correct 2 ms 376 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 376 KB Output is correct
2 Correct 2 ms 376 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 376 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 3 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 372 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 376 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 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 16 ms 1912 KB Output is correct
12 Correct 18 ms 2168 KB Output is correct
13 Correct 19 ms 1784 KB Output is correct
14 Correct 16 ms 1912 KB Output is correct
15 Correct 24 ms 2424 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2296 KB Output is correct
2 Correct 4 ms 2296 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 4 ms 2296 KB Output is correct
5 Correct 3 ms 2296 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 4 ms 2296 KB Output is correct
8 Correct 4 ms 2296 KB Output is correct
9 Correct 27 ms 4220 KB Output is correct
10 Correct 23 ms 3832 KB Output is correct
11 Correct 12 ms 2936 KB Output is correct
12 Correct 13 ms 3064 KB Output is correct
13 Correct 7 ms 2552 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 4 ms 2296 KB Output is correct
3 Correct 4 ms 2296 KB Output is correct
4 Correct 5 ms 2296 KB Output is correct
5 Correct 4 ms 2344 KB Output is correct
6 Correct 4 ms 2296 KB Output is correct
7 Correct 4 ms 2296 KB Output is correct
8 Correct 4 ms 2296 KB Output is correct
9 Correct 28 ms 4216 KB Output is correct
10 Correct 23 ms 3832 KB Output is correct
11 Correct 12 ms 2936 KB Output is correct
12 Correct 14 ms 3064 KB Output is correct
13 Correct 7 ms 2552 KB Output is correct
14 Runtime error 22 ms 4984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -