oj.uz

Submission #127703

# Submission time Handle Problem Language Result Execution time Memory
127703 2019-07-10T02:51:55 Z tinjyu Gondola (IOI14_gondola) C++14
20 / 100
 17 ms 3196 KB 
#include "gondola.h"
#include <iostream>
using namespace std;
int valid(int n, int a[])
{
	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[])
{
  return -2;
}

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 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 4 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 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 2680 KB Output is correct
8 Correct 13 ms 2552 KB Output is correct
9 Correct 6 ms 2296 KB Output is correct
10 Correct 15 ms 2552 KB Output is correct

Subtask #3
10.0 / 10.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 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
6 Correct 9 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 2552 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 2680 KB Output is correct
14 Correct 4 ms 2296 KB Output is correct
15 Correct 17 ms 3196 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -2 violates the range [0, 350000]
2 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 -