oj.uz

Submission #127715

# Submission time Handle Problem Language Result Execution time Memory
127715 2019-07-10T03:12:39 Z Dr_Cow Gondola (IOI14_gondola) C++14
10 / 100
 14 ms 1144 KB 
#include <bits/stdc++.h>
#include "gondola.h"

int valid(int n, int inputSeq[]){
	int ip=-1,N[100010];
	bool tf[250010];
	for (int i=0;i<n;i++){
		if (inputSeq[i]<=n){
			ip=i;break;
		}
	}
	if (ip==-1) return 1;
	else {
		N[ip]=inputSeq[ip];
		for (int i=ip+1;i<n;i++) {
			N[i]=N[i-1]+1;
			if (N[i]>n) N[i]-=n;
		}
		for (int i=ip-1;i>=0;i--){
			N[i]=N[i+1]-1;
			if (N[i]<=0) N[i]+=n;
		}
	}
	for (int i=0;i<n;i++)
		if (inputSeq[i]<=n && inputSeq[i]!=N[i]) 	return 0;
	for (int i=0;i<n;i++)
		if (tf[inputSeq[i]]) return 0;
		else tf[inputSeq[i]]=true;
  return 1;

}
//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:27:21: warning: 'tf[<unknown>]' may be used uninitialized in this function [-Wmaybe-uninitialized]
   if (tf[inputSeq[i]]) return 0;
       ~~~~~~~~~~~~~~^

Subtask #1
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 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 7 ms 632 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 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 7 ms 604 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 11 ms 904 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 7 ms 632 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

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 376 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 256 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 376 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 376 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 -