제출 #1025766

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025766		socpite	곤돌라 (IOI14_gondola)	C++17	100 / 100	46 ms	5964 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

const int maxn = 3e5+5;
const int mod = 1e9+9;

long long binpow(long long x, int e){
	long long re = 1;
	while(e){
		if(e&1)re = re*x%mod;
		x = x*x%mod;
		e>>=1;
	}
	return re;
}

int valid(int n, int inputSeq[])
{
	map<int, int> vis;
	int dist = -1;
	for(int i = 0; i < n; i++)inputSeq[i]--;
	for(int i = 0; i < n; i++){
		if(vis[inputSeq[i]])return 0;
		vis[inputSeq[i]] = 1;
		if(inputSeq[i] < n){
			int d = (i + n - inputSeq[i])%n;
			if(dist == -1)dist = d;
			else if(dist != d)return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vector<pair<int, int>> vec;
	int dist = 0;
	for(int i = 0; i < n; i++){
		gondolaSeq[i]--;
		if(gondolaSeq[i] < n){
			dist = (gondolaSeq[i] - i + n)%n;
		}
		else {
			vec.push_back({gondolaSeq[i], i});
		}
	}
	int crr = 0;
	sort(vec.begin(), vec.end());
	for(auto v: vec){
		replacementSeq[crr++] = (v.second + dist)%n + 1;
		while(crr+n <= v.first){
			replacementSeq[crr] = crr + n;
			crr++;
		}
	}
	return crr;
}

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

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq))return 0;
	vector<int> vec;
	int dist = 0;
	for(int i = 0; i < n; i++){
		if(inputSeq[i] >= n)vec.push_back(inputSeq[i]);
	}
	int prv = n-1;
	sort(vec.begin(), vec.end());
	int sz = vec.size();
	long long ans = 1;
	for(int i = 0; i < sz; i++){
		ans = ans*binpow(sz - i, vec[i] - prv-1)%mod;
		prv = vec[i];
	}
	if(sz == n)ans = ans*n%mod;
	return ans;
}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:68:6: warning: unused variable 'dist' [-Wunused-variable]
   68 |  int dist = 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: 15 / 15
• Subtask 10: 10 / 10