oj.uz

Submission #127818

# Submission time Handle Problem Language Result Execution time Memory
127818 2019-07-10T06:46:06 Z zozder Gondola (IOI14_gondola) C++14
35 / 100
 16 ms 1660 KB 
#include "gondola.h"
#include <iostream>
using namespace std;

int valid(int n, int inputSeq[])
{
	int minn=10000,minl=n;
	int tag[250001];
	for(int i=1;i<=250000;i++)tag[i]=0;
	for(int i=0;i<n;i++)if(inputSeq[i]<minn&&0<inputSeq[i]&&inputSeq[i]<=n)
	{
		minn=inputSeq[i];
		minl=i;
  	}
	int t=1,m=n;
	while(m>0)
  	{
  		if(minl>=n)minl=0;
  		
  		if((inputSeq[minl]!=minn&&0<inputSeq[minl]&&inputSeq[minl]<=n)||tag[inputSeq[minl]]==1)t=0;
  		tag[inputSeq[minl]]=1;
//  		cout<<minn<<","<<minl<<","<<inputSeq[minl]<<","<<tag[inputSeq[minl]]<<endl;
  		m--;
		minl++;
  		minn++;
	}
	return t;
}

int a[500001],b[500001],c[500001];

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int minl=1000000,minn=n;
	for(int i=1;i<=n;i++)a[i]=gondolaSeq[i-1];
	for(int i=1;i<=n;i++)if(a[i]<minn&&0<a[i]&&a[i]<=n)
	{
		minn=a[i];
		minl=i;
	}
	int m=n;int max=0;
	while(m>0)
	{
		if(minl>n)minl=1;
		b[n-m+1]=a[minl];
		if(max<b[n-m+1])max=b[n-m+1];
		minl++;
		m--;
	}
//	for(int i=1;i<=n;i++)cout<<b[i]<<" ";cout<<endl;
	for(int i=1;i<=n;i++)if(b[i]==i)a[i]=0;else a[i]=i;
	for(int i=1;i<=n;i++)if(a[i]!=0&&b[i]-n>0)c[b[i]-n]=a[i];
//	for(int i=1;i<=n;i++)cout<<a[i]<<" ";cout<<endl;
	int len=max-n;
//	for(int i=1;i<=len;i++)cout<<c[i]<<" ";cout<<endl;
	int x=0,last=0;
	for(int i=len;i>0;i--)if(c[i]!=0)
	{
//		cout<<";"<<i<<","<<x<<endl;
		int t;
		t=x;
		x=c[i];
		c[i]=t;
		if(i>last)last=i;
	}
	c[0]=x;
	
	for(int i=1;i<=len;i++)if(c[i]==0)c[i]=i+n;
//	for(int i=0;i<last;i++)cout<<c[i]<<" ";cout<<endl;
	for(int i=0;i<last;i++)replacementSeq[i]=c[i];
	
	return last;
}

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 7 ms 1400 KB Output is correct
7 Correct 15 ms 1632 KB Output is correct
8 Correct 12 ms 1528 KB Output is correct
9 Correct 5 ms 1400 KB Output is correct
10 Correct 13 ms 1656 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 7 ms 1400 KB Output is correct
7 Correct 15 ms 1656 KB Output is correct
8 Correct 11 ms 1656 KB Output is correct
9 Correct 6 ms 1400 KB Output is correct
10 Correct 13 ms 1660 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 8 ms 1400 KB Output is correct
14 Correct 3 ms 1272 KB Output is correct
15 Correct 16 ms 1656 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 3 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
0 / 20.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 380 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
11 Correct 12 ms 1400 KB Output is correct
12 Correct 13 ms 1400 KB Output is correct
13 Incorrect 15 ms 1660 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -