제출 #232097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
232097		spdskatr	곤돌라 (IOI14_gondola)	C++14	45 / 100	31 ms	2548 KiB

gondola

#include "gondola.h"
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <utility>
#define fi first
#define se second

using namespace std;
typedef pair<int, int> pii;

int valid(int n, int inputSeq[]) {
	int offset = -1;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] <= n) {
			offset = (i - inputSeq[i] + 1 + n) % n;
			break;
		}
	}
	if (offset == -1) return 1;
	else {
		for (int i = 0; i < n; i++) {
			int ind = (offset+i) % n;
			if (inputSeq[ind] < n && inputSeq[ind] != i+1) return 0;
		}
	}
	return 1;
}

//----------------------
namespace T2 {
	int original[100005], cnt;
	vector<pii> elems;

	int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
		int offset = -1;
		for (int i = 0; i < n; i++) {
			if (gondolaSeq[i] <= n) {
				offset = (i - gondolaSeq[i] + 1 + n) % n;
				break;
			}
		}
		if (offset == -1) {
			for (int i = 0; i < n; i++) original[i] = i+1;
		} else {
			for (int i = 0; i < n; i++) {
				original[(offset+i)%n] = i+1;
			}
		}
		for (int i = 0; i < n; i++) {
			if (gondolaSeq[i] > n) {
				elems.push_back({ gondolaSeq[i], i });
			}
		}
		sort(elems.begin(), elems.end());
		int cur = n+1;
		for (int i = 0; i < elems.size(); i++) {
			while (elems[i].fi >= cur) {
				replacementSeq[cnt++] = original[elems[i].se];
				original[elems[i].se] = cur++;
			}
		}
		return cnt;
	}
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	return T2::replacement(n, gondolaSeq, replacementSeq);
}

//----------------------

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

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int T2::replacement(int, int*, int*)':
gondola.cpp:58:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < elems.size(); i++) {
                   ~~^~~~~~~~~~~~~~

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