제출 #589129

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
589129		FatihSolak	곤돌라 (IOI14_gondola)	C++17	75 / 100	111 ms	10496 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]){
	set<int> s;
	map<int,int> pos;
	for(int i = 0;i<n;i++){
		s.insert(inputSeq[i]);
		pos[inputSeq[i]] = i;
	}
	if(s.size() != n)return 0;
	int num = *s.begin() + 1;
	while(num <= n){
		if(s.count(num) && pos[num] != (pos[*s.begin()] + num - *s.begin())%n){
			return 0;
		}
		num++;
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	int pos_mini = 0;
	int maxi = 0;
	for(int i = 0;i<n;i++){
		if(gondolaSeq[i] < gondolaSeq[pos_mini]){
			pos_mini = i;
		}
		maxi = max(maxi,gondolaSeq[i]);
	}
	for(int i = 0;i<n;i++){
		if(gondolaSeq[i] <= n){
			pos_mini = (i - gondolaSeq[i]  + 1 + n)%n;
		}
	}
	int tmp[n];
	map<int,int> mp;
	for(int i = 0;i<n;i++)tmp[i] = gondolaSeq[i];
	for(int i = 0;i<n;i++){
		gondolaSeq[i] = tmp[(pos_mini + i)%n];
		mp[gondolaSeq[i]] = i + 1;
		//cout << gondolaSeq[i] << " ";
	}
	//cout << endl;
	for(int i = n+1;i<=maxi;i++){
		if(mp[i]){
			replacementSeq[i - n - 1] = mp[i];
		}
		else{
			replacementSeq[i - n - 1] = mp[maxi];
			mp[maxi] = i;
		}
	}
	return maxi - n;
}

//----------------------
const int mod = 1e9 + 9;
int countReplacement(int n, int gondolaSeq[]){
	if(!valid(n,gondolaSeq))return 0;
	int pos_mini = 0;
	int maxi = 0;
	for(int i = 0;i<n;i++){
		if(gondolaSeq[i] < gondolaSeq[pos_mini]){
			pos_mini = i;
		}
		maxi = max(maxi,gondolaSeq[i]);
	}
	for(int i = 0;i<n;i++){
		if(gondolaSeq[i] <= n){
			pos_mini = (i - gondolaSeq[i]  + 1 + n)%n;
		}
	}
	int tmp[n];
	map<int,int> mp;
	for(int i = 0;i<n;i++)tmp[i] = gondolaSeq[i];
	for(int i = 0;i<n;i++){
		gondolaSeq[i] = tmp[(pos_mini + i)%n];
		mp[gondolaSeq[i]] = i + 1;
		//cout << gondolaSeq[i] << " ";
	}
	//cout << endl;
	int unfixed = 0;
	for(int i = 0;i<n;i++){
		if(gondolaSeq[i] > n)unfixed++;
	}
	int ret = 1;
	if(unfixed == n){
		for(int i = 1;i<=n;i++){
			ret = (long long)ret * i %mod;
		}
	}
	for(int i = n+1;i<=maxi;i++){
		if(mp[i]){
			unfixed--;
		}
		else{
			ret = (long long)ret * unfixed % mod;
		}
	}
	return ret;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:11:14: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 |  if(s.size() != n)return 0;
      |     ~~~~~~~~~^~~~

• 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: 0 / 15
• Subtask 10: 0 / 10