제출 #257426

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

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <unordered_map>
#define pii pair<int, int>
#define fst first
#define snd second
#define ll long long
const int MD = 1e9 + 9;

using namespace std;

inline ll pw(ll b, ll e)
{
	ll t = 1;
	while (e)
	{
		if (e & 1) {t = (t * b) % MD;}
		b = (b * b) % MD; e >>= 1;
	}
	return t;
}

int valid(int n, int inputSeq[])
{
	unordered_map<int, int> cnt; int sp = -1;
	for (int i = 0; i < n; i++)
	{
		if (inputSeq[i] <= n)
		{
			if (sp == -1) sp = (i + (n + 1 - inputSeq[i])) % n;
			else if (sp != (i + (n + 1 - inputSeq[i])) % n) {return 0;}
		}
		cnt[inputSeq[i]]++;
		if (cnt[inputSeq[i]] > 1) {return 0;}
	}	
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int sp = -1, lg = 0;
	vector<pii> v;
	for (int i = 0; i < n; i++)
	{
		if (gondolaSeq[i] <= n) {sp = (i + (n + 1 - gondolaSeq[i])) % n;}
		else {v.push_back({gondolaSeq[i], i});}
	}
	if (sp == -1) {sp = 0;}

	sort(v.begin(), v.end());
	for (auto &x : v)
	{
		replacementSeq[lg++] = (x.snd + n - sp) % n + 1;
		while (lg + n < x.fst) {replacementSeq[lg] = n + lg; lg++;}
	}
	return lg;
}

int countReplacement(int n, int inputSeq[])
{
	if (!valid(n, inputSeq)) {return 0;}
	vector<int> v; int sp = -1;
	for (int i = 0; i < n; i++)
	{
		if (inputSeq[i] > n) {v.push_back(inputSeq[i]);}
		else {sp = 0;}
	}
	sort(v.begin(), v.end());
	int pv = n; long long res = 1;
	for (int i = 0; i < v.size(); i++)
	{
		res = (res * pw(v.size() - i, v[i] - pv - 1)) % MD;
		pv = v[i];
	}
	if (sp == -1) {res = (res * n) % MD;}
	return res;
}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++)
                  ~~^~~~~~~~~~

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