제출 #284214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284214		Bill_00	곤돌라 (IOI14_gondola)	C++14	65 / 100	49 ms	7204 KiB

gondola

#include <stdlib.h>
#include "gondola.h"
#include <bits/stdc++.h>
#define MOD 1000000009
#define ll long long
using namespace std;
long long pow(long long a,long long b){
	if(b==1) return a;
	long long c=1;
	if(b%2==1) c=a;
	long long d=pow(a,b/2);
	return ((d*d)%MOD*c)%MOD;
}
int valid(int n, int a[])
{
	int k[250000]={0};
	int y[250000]={0},d=0;
	for(int i=0;i<n;i++){
		k[a[i]]++;
	}
	for(int i=0;i<n;i++){
		if(k[a[i]]>1) return 0;
	}
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			if(y[(a[i]-i+n)%n]==0) d++;
			y[(a[i]-i+n)%n]++;
		}
	}
	if(d<=1) return 1;
	return 0;
	
}

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

int replacement(int n, int a[], int replacementSeq[])
{
	int y[100000]={0};
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			y[(a[i]-i+n)%n]++;
		}
	}
	int e=0;
	for(int i=0;i<n;i++){
		e=max(e,y[i]);
	}
	return n-e;
}

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

int countReplacement(int n, int a[])
{
	unordered_map<ll,ll>k,y;
	long long e=0;
	long long d=0;
	vector<long long>v;
	for(int i=0;i<n;i++){
		k[a[i]]++;
	}
	v.push_back((ll)n);
	for(int i=0;i<n;i++){
		if(k[a[i]]>1) return 0;
	}
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			e++;
			if(y[(a[i]-i+n)%n]==0) d++;
			y[(a[i]-i+n)%n]++;
		}
		else v.push_back((ll)a[i]);
	}
	if(d>1) return 0;
	if(d==1 && e==(ll)n) return 1;
	sort(v.begin(),v.end());
	e=(ll)n-e;
	long long ans=1;
	for(long long i=1;i<v.size();i++){
		long long p=(ll)v[i]-(ll)v[i-1]-(ll)1;
		if(p==(ll)0) continue;
		ans=(ans*pow((ll)(e-i+1),p))%MOD;
	}
	if(e==(long long)n){
		ans=(ans*(ll)n)%MOD;
	}
	return ans;
}

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:80:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for(long long i=1;i<v.size();i++){
      |                    ~^~~~~~~~~

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