oj.uz

답안 #129458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129458 2019-07-12T09:12:52 Z antimirage 곤돌라 (IOI14_gondola) C++14
20 / 100
 15 ms 4216 KB 
#include "gondola.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int b[N], ind[N], mx, sz, cnt[N];

int valid(int n, int a[]) {
	int pos = -1;
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			pos = i;
		}
		cnt[a[i]]++;
		
		if (cnt[a[i]] > 1)
			return 0;
	}
	if (pos == -1) {
		return 1;
	} else {
		assert(a[pos] <= n);
		int cn = a[pos];
		for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n) {
			cn++;
			if (cn > n)
				cn -= n;
			if (a[i] > n) {
				continue;
			}
			if (a[i] != cn) {
				return 0;
			}
		}
	}
	return 1;
}
int replacement(int n, int a[], int ans[]) {
	memset(ind, -1, sizeof(ind));
	int pos = -1;
	
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			pos = i;
		}
		if (a[i] > a[mx]) {
			mx = i;
		}
		ind[a[i]] = i;
	}
	if (pos == -1) {
		for (int i = 0; i < n; i++) {
			b[i] = i + 1;
		}
	}
	else {
		int cn = a[pos];
		b[pos] = a[pos];
		for (int i = (pos + 1) % n; i != pos; i = (i + 1) % n) {
			cn++;
			if (cn > n)
				cn -= n;
			b[i] = a[pos] + cn;
			
		}
	}
	for (int i = n + 1; i <= a[mx]; i++) {
		if (ind[i] == -1) {
			ans[sz++] = b[mx];
			b[mx] = i;
		}
		else {
			ans[sz++] = b[ind[i]];
			b[ind[i]] = i;
		}
	}
	return sz;
}

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 7 ms 632 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 12 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
10.0 / 10.0

# 결과 실행 시간 메모리 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 256 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 13 ms 1016 KB Output is correct
8 Correct 12 ms 888 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 13 ms 1020 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 8 ms 1272 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 15 ms 1656 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 4216 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 352 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -