제출 #120399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
120399		turbat	Gondola (IOI14_gondola)	C++14	0 / 100	6 ms	1100 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define N 100005

int arr[N], mx, pos[3 * N];
bool note[3 * N];
long long mod = 1e9 + 7, ans;

int valid(int n, int inputSeq[]){
	memset(arr, 0, sizeof arr);
	memset(note, 0, sizeof note);
	for (int i = 0;i < n;i++){
		pos[inputSeq[i]] = i;
		if (note[inputSeq[i]]) return 0;
		note[inputSeq[i]] = 1;
	}
	for (int i = 0;i < n;i++)
		if (inputSeq[i] <= n){
			int now = inputSeq[i];
			arr[i] = now;
			for (int j = i + 1;j < n;j++){
				now++;
				arr[j] = now;
			}
			for (int j = 0;j < i;j++){
				now++;
				arr[j] = now;
			}
			break;
		}
	int ok = 1;
	for (int i = 0;i < n;i++)
		if (inputSeq[i] <= n && inputSeq[i] != arr[i])
			ok = 0;
	return ok;
}


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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10