oj.uz

Submission #17244

# Submission time Handle Problem Language Result Execution time Memory
17244 2015-11-10T13:41:32 Z erdemkiraz Gondola (IOI14_gondola) C++
20 / 100
 36 ms 6920 KB 
#include <bits/stdc++.h>

using namespace std;

#define type(x) __typeof((x).begin())
#define foreach(it, x) for(type(x) it = (x).begin(); it != (x).end(); it++)
typedef long long ll;
typedef pair < int, int > ii;

const int inf = 1e9 + 333;
const ll linf = 1e18 + inf;

#include "gondola.h"

int valid(int n, int inputSeq[]) {
	int ind = -1, x = -1;
	for(int i = 0; i < n; i++) {
		if(inputSeq[i] <= n) {
			ind = i;
			x = inputSeq[i];
			break;
		}
	}
	for(int i = ind + 1; i < n; i++) {
		if(inputSeq[i] <= n and (x + i - ind - 1) % n + 1 != inputSeq[i])
			return 0;
	}
	set < int > s;
	for(int i = 0; i < n; i++)
		s.insert(inputSeq[i]);
	return s.size() == n;
}

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

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 3092 KB Output is correct
2 Correct 0 ms 3092 KB Output is correct
3 Correct 0 ms 3092 KB Output is correct
4 Correct 0 ms 3092 KB Output is correct
5 Correct 0 ms 3092 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3092 KB Output is correct
2 Correct 0 ms 3092 KB Output is correct
3 Correct 0 ms 3092 KB Output is correct
4 Correct 0 ms 3092 KB Output is correct
5 Correct 0 ms 3092 KB Output is correct
6 Correct 8 ms 4808 KB Output is correct
7 Correct 0 ms 3092 KB Output is correct
8 Correct 30 ms 6392 KB Output is correct
9 Correct 9 ms 4148 KB Output is correct
10 Correct 26 ms 6920 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3092 KB Output is correct
2 Correct 0 ms 3092 KB Output is correct
3 Correct 0 ms 3092 KB Output is correct
4 Correct 0 ms 3092 KB Output is correct
5 Correct 0 ms 3092 KB Output is correct
6 Correct 15 ms 4808 KB Output is correct
7 Correct 15 ms 3092 KB Output is correct
8 Correct 30 ms 6392 KB Output is correct
9 Correct 0 ms 4148 KB Output is correct
10 Correct 36 ms 6920 KB Output is correct
11 Correct 0 ms 3092 KB Output is correct
12 Correct 0 ms 3092 KB Output is correct
13 Correct 3 ms 3092 KB Output is correct
14 Correct 0 ms 3092 KB Output is correct
15 Correct 0 ms 3092 KB Output is correct

Subtask #4
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3092 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 3092 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 3092 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 3092 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 3092 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 3092 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 3092 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -