oj.uz

Submission #171707

# Submission time Handle Problem Language Result Execution time Memory
171707 2019-12-30T06:55:46 Z gs18103 Gondola (IOI14_gondola) C++14
20 / 100
 19 ms 1348 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 101010;
const int INF = INT_MAX >> 1;
const ll LINF = LLONG_MAX >> 1;

int valid(int n, int arr[]) {
	vector <bool> chk(250050);
	int idx = -1;
	for(int i = 0; i < n; i++) {
		if(arr[i] <= n && idx == -1) {
			idx = i;
		}
		else if(arr[i] <= n) {
			int temp = arr[idx] + i - idx;
			temp %= n;
			if(temp == 0) temp = n;
			if(temp != arr[i]) return 0;
		}
	}
	sort(arr, arr+n);
	for(int i = 1; i < n; i++) {
		if(arr[i] == arr[i-1]) 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 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 #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 504 KB Output is correct
6 Correct 9 ms 632 KB Output is correct
7 Correct 13 ms 1144 KB Output is correct
8 Correct 14 ms 1016 KB Output is correct
9 Correct 7 ms 504 KB Output is correct
10 Correct 19 ms 1144 KB Output is correct

Subtask #3
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 9 ms 760 KB Output is correct
7 Correct 14 ms 1348 KB Output is correct
8 Correct 14 ms 1020 KB Output is correct
9 Correct 7 ms 508 KB Output is correct
10 Correct 19 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 760 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 14 ms 1160 KB Output is correct

Subtask #4
0 / 5.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 #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 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 256 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 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -