제출 #171646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171646		gs18103	곤돌라 (IOI14_gondola)	C++14	10 / 100	15 ms	1148 KiB

gondola

#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, val;
	for(int i = 0; i < n; i++) {
		if(arr[i] <= n) {
			idx = i;
			val = arr[i];
			break;
		}
	}
	if(idx == -1) return 1;
	for(int i = 0; i < n; i++) {
		if(chk[arr[i]]) return 0;
		chk[arr[i]] = true;
		if(arr[(idx+i)%n] <= n && arr[(idx+i)%n] % n != (val + i) % n) 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 / 5
• Subtask 2: 5 / 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