제출 #625893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
625893		as111	곤돌라 (IOI14_gondola)	C++14	20 / 100	14 ms	632 KiB

gondola

#include "gondola.h"
#include <iostream>
#include <set>
#include <algorithm>

#define MAXN 100000

using namespace std;

int valid(int n, int inputSeq[]) {
	int start = 0;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			start = i;
			break;
		}
	}
	if (start < n) {
		for (int j = 0; j < n; j++) {
			if (inputSeq[j] <= n && (inputSeq[j] + start) % n != (inputSeq[start] + j) % n) return 0;
		}
	}
	sort(inputSeq, inputSeq + n);
	for (int i = 1; i < n; i++) {
		if (inputSeq[i - 1] == inputSeq[i]) {
			return 0;
		}
	}
	return 1;
}
int og[MAXN + 1]; // original order
set<pair<int, int>> Q; // Q gondolas above n least to greatest
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	int start = 0; // pos of 1 in the sequence
	for (int i = 0; i < n; i++) {
		if (gondolaSeq[i] <= n) {
			start = i + (n - gondolaSeq[i] + 1); // pos of 1
			start %= n; // keep in bounds of array
			break;
		}
	}
	for (int i = 0; i < n; i++) {
		og[i] = n + 1 + (i - start);
		og[i] %= n;
		if (gondolaSeq[i] > n) {
			Q.insert(make_pair(gondolaSeq[i], i));
		}
	}
	int curr = n;
	set<pair<int, int>>::iterator it;
	for (it = Q.begin(); it != Q.end(); it++) {
		pair<int, int> a = *it;
		while (curr < a.first) {
			replacementSeq[curr - n] = og[a.second];
			cout << replacementSeq[curr - n] << endl;
			curr++;
			og[a.second] = curr;
		}
	}
	return curr-n;
}
int countReplacement(int n, int inputSeq[]) {
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 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