제출 #521287

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

gondola

#include "gondola.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int M = 1e9+9;

ll pw(ll a, ll b){
	ll r = 1;
	while(b){
		if(b&1)r = r*a%M;
		b>>=1;
		a = a*a%M;
	}
	return r;
}

int valid(int n, int inputSeq[]){
	set<int> S;
	int x = 0;
	for(int i = 0; i < n; ++i){
		if(S.count(inputSeq[i]))return 0;
		S.insert(inputSeq[i]);
		if(inputSeq[i] <= n)x = (inputSeq[i]-i+n-1)%(n)+1;
	}
	for(int i = 0; i < n; ++i){
		if(inputSeq[i] != (x+i-1)%(n)+1 && inputSeq[i] <= n)return 0;
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<pair<int,int>> v;
	int x = 1;
	for(int i = 0; i < n; ++i){
		if(gondolaSeq[i] <= n)x = (gondolaSeq[i]-i+n-1)%(n)+1;
	}
	for(int i = 0; i < n; ++i){
		if(gondolaSeq[i] > n){
			v.emplace_back(gondolaSeq[i],(x+i-1)%n+1);
		}
	}
	sort(v.begin(),v.end());
	int cn = 0;
	for(int i = 0; i < v.size(); ++i){
		replacementSeq[cn++] = v[i].second;
		while(cn + n < v[i].first){
			replacementSeq[cn] = cn+n;
			cn++;
		}
	}
	return cn;
}

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

int countReplacement(int n, int gondolaSeq[]){
	if(!valid(n,gondolaSeq))return 0;
	vector<ll> v;
	bool ok = 0;
	for(int i = 0; i < n; ++i){
		if(gondolaSeq[i] > n){
			v.emplace_back((ll)gondolaSeq[i]);
		}
		else ok = 1;
	}
	sort(v.begin(),v.end());
	ll z = v.size();
	if(z == 0)return 1;
	ll ans = pw(z,v[0]-n-1);
	for(int i = 1; i < z; ++i){
		ans = (ans * pw(z-i,v[i]-v[i-1]-1)) % M;
	}
	if(!ok)ans = (ans*n)%M;
	return ans;
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:49:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  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