oj.uz

Submission #18691

# Submission time Handle Problem Language Result Execution time Memory
18691 2016-02-14T06:04:43 Z suhgyuho_william Gondola (IOI14_gondola) C++
20 / 100
 13 ms 2568 KB 
#include "gondola.h"

int valid(int n, int inputSeq[])
{
	int i;
	int s,t;
	bool check[250010];

	s = -1;
    for(i=0; i<n; i++){
		if(check[inputSeq[i]]) return 0;
		check[inputSeq[i]] = true;
        if(inputSeq[i] <= n){
            t = i+2-inputSeq[i];
			if(t <= 0) t += n;
			if(s == -1){
				s = t;
			}else if(s != 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 0 ms 2568 KB Output is correct
2 Correct 0 ms 2568 KB Output is correct
3 Correct 0 ms 2568 KB Output is correct
4 Correct 0 ms 2568 KB Output is correct
5 Correct 0 ms 2568 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2568 KB Output is correct
2 Correct 0 ms 2568 KB Output is correct
3 Correct 0 ms 2568 KB Output is correct
4 Correct 0 ms 2568 KB Output is correct
5 Correct 0 ms 2568 KB Output is correct
6 Correct 5 ms 2568 KB Output is correct
7 Correct 12 ms 2492 KB Output is correct
8 Correct 8 ms 2564 KB Output is correct
9 Correct 2 ms 2564 KB Output is correct
10 Correct 11 ms 2568 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2568 KB Output is correct
2 Correct 0 ms 2564 KB Output is correct
3 Correct 0 ms 2564 KB Output is correct
4 Correct 0 ms 2568 KB Output is correct
5 Correct 0 ms 2564 KB Output is correct
6 Correct 6 ms 2568 KB Output is correct
7 Correct 11 ms 2492 KB Output is correct
8 Correct 10 ms 2564 KB Output is correct
9 Correct 3 ms 2568 KB Output is correct
10 Correct 13 ms 2568 KB Output is correct
11 Correct 0 ms 2564 KB Output is correct
12 Correct 0 ms 2564 KB Output is correct
13 Correct 5 ms 2564 KB Output is correct
14 Correct 0 ms 2564 KB Output is correct
15 Correct 10 ms 2500 KB Output is correct

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2448 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -