답안 #127724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127724 2019-07-10T03:38:02 Z tinjyu 곤돌라 (IOI14_gondola) C++14
55 / 100
23 ms 2680 KB
#include "gondola.h"
#include <iostream>
using namespace std;
int a[100005],b[100005],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;
		}
	}
	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=1,x=n+1,tmp;
	int ans[1000005];
	for(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(int i=1;i<=ans[0];i++)
	{
		cout<<ans[i]<<endl;
		for(int j=1;j<ans[i];j++)ans1=(ans1*j)%1000000009;
	}
  	return ans1;
}

Compilation message

gondola.cpp: In function 'int qs(int, int)':
gondola.cpp:23:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 4 ms 2296 KB Output is correct
3 Correct 3 ms 2296 KB Output is correct
4 Correct 4 ms 2296 KB Output is correct
5 Correct 3 ms 2296 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 5 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
6 Correct 8 ms 2424 KB Output is correct
7 Correct 15 ms 2552 KB Output is correct
8 Correct 13 ms 2552 KB Output is correct
9 Correct 7 ms 2296 KB Output is correct
10 Correct 15 ms 2652 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2296 KB Output is correct
2 Correct 4 ms 2296 KB Output is correct
3 Correct 3 ms 2300 KB Output is correct
4 Correct 4 ms 2296 KB Output is correct
5 Correct 4 ms 2296 KB Output is correct
6 Correct 13 ms 2424 KB Output is correct
7 Correct 16 ms 2680 KB Output is correct
8 Correct 13 ms 2552 KB Output is correct
9 Correct 7 ms 2424 KB Output is correct
10 Correct 15 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 2300 KB Output is correct
15 Correct 17 ms 2680 KB Output is correct
# 결과 실행 시간 메모리 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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 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 376 KB Output is correct
6 Correct 2 ms 424 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 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 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 256 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 3 ms 348 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 14 ms 1272 KB Output is correct
12 Correct 16 ms 1400 KB Output is correct
13 Correct 18 ms 1400 KB Output is correct
14 Correct 14 ms 1256 KB Output is correct
15 Correct 23 ms 2296 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2296 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2296 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2296 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 2296 KB 잘못된 접근입니다.
2 Halted 0 ms 0 KB -