제출 #345691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345691		ogibogi2004	곤돌라 (IOI14_gondola)	C++14	55 / 100	60 ms	6124 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
ll fastpow(ll x,ll p)
{
	if(p==0)return 1;
	ll t=fastpow(x,p/2);
	t*=t;t%=mod;
	if(p%2==1)t*=x;
	t%=mod;
	return t;
}
int valid(int n, int inputSeq[])
{
	vector<int>v;
	set<int>s;
	set<int>s2;
	for(int i=0;i<n;i++)
	{
		s.insert(inputSeq[i]);
		if(inputSeq[i]<=n)
		{
			int t=inputSeq[i]-i;
			if(t<0)t+=n;
			s2.insert(t);
		}
	}
	if(s.size()!=n)return 0;
	if(s2.size()>1)return 0;
	return 1;
	int t=v.size();
	for(int i=0;i<t;i++)v.push_back(v[i]);
	int cnt=0;
	bool ok=0;
	for(int i=1;i<v.size();i++)
	{
		if(v[i]>v[i-1])cnt++;
		else cnt=0;
		if(cnt==t-1)
		{
			ok=1;
		}
	}
	return ok;
	return -1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	if(!valid(n,gondolaSeq))return 0;
	int s=0,j=-1;
	int real[n];
	for(int i=0;i<n;i++)
	{
		if(gondolaSeq[i]<=n)
		{
			j=i;
		}
	}
	if(j==-1)
	{
		for(int i=0;i<n;i++)real[i]=i+1;
	}
	else
	{
		for(int i=0;i<n;i++)
		{
			real[(j+i)%n]=(gondolaSeq[j]+i-1)%n+1;
		}
	}
	vector<pair<int,int> >v;
	for(int i=0;i<n;i++)
	{
		if(gondolaSeq[i]!=real[i])
		{
			v.push_back({gondolaSeq[i],real[i]});
		}
	}
	sort(v.begin(),v.end());
	vector<int>reps;
	int nxt=n+1;
	for(int i=0;i<v.size();i++)
	{
		reps.push_back(v[i].second);
		while(nxt!=v[i].first)
		{
			reps.push_back(nxt);
			nxt++;
		}
		nxt++;
	}
	for(int i=0;i<reps.size();i++)
	{
		replacementSeq[i]=reps[i];
	}
	return reps.size();
}

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

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n,inputSeq))return 0;
	int s=0,j=-1;
	int real[n];
	for(int i=0;i<n;i++)
	{
		if(inputSeq[i]<=n)
		{
			j=i;
		}
	}
	if(j==-1)
	{
		for(int i=0;i<n;i++)real[i]=i+1;
	}
	else
	{
		for(int i=0;i<n;i++)
		{
			real[(j+i)%n]=(inputSeq[j]+i-1)%n+1;
		}
	}
	vector<pair<int,int> >v;
	for(int i=0;i<n;i++)
	{
		if(inputSeq[i]!=real[i])
		{
			v.push_back({inputSeq[i],real[i]});
		}
	}
	int nxt=n+1;
	ll ret=1;
	for(int i=0;i<v.size();i++)
	{
		ret*=fastpow(v.size()-i,v[i].second-nxt);
		ret%=mod;
		nxt=v[i].first+1;
	}
	if(j==-1)
	{
		ret*=n;
		ret%=mod;
	}
	sort(v.begin(),v.end());
	return -3;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:30:13: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |  if(s.size()!=n)return 0;
      |     ~~~~~~~~^~~
gondola.cpp:37:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=1;i<v.size();i++)
      |              ~^~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:86:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
gondola.cpp:96:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |  for(int i=0;i<reps.size();i++)
      |              ~^~~~~~~~~~~~
gondola.cpp:55:6: warning: unused variable 's' [-Wunused-variable]
   55 |  int s=0,j=-1;
      |      ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:138:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
gondola.cpp:108:6: warning: unused variable 's' [-Wunused-variable]
  108 |  int s=0,j=-1;
      |      ^

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