Submission #298253

#	Time	Username	Problem	Language	Result	Execution time	Memory
298253		Hemimor	Gondola (IOI14_gondola)	C++14	100 / 100	71 ms	6136 KiB

gondola

#include "gondola.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+9;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

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

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vp a;
	int id=0,x=1;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i]>n) a.push_back({gondolaSeq[i],i});
		else id=i,x=gondolaSeq[i];
	}
	sort(a.begin(),a.end());
	int I=0,mx=n;
	for(auto p:a){
		replacementSeq[I++]=(p.second-id+x-1+2*n)%n+1;
		mx++;
		while(mx<p.first){
			replacementSeq[I++]=mx;
			mx++;
		}
	}
	return I;
}

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

ll Pow(ll n,ll p){
	ll r=1;
	for(;p>0;p>>=1){
		if(p&1) r=(r*n)%mod;
		n=(n*n)%mod;
	}
	return r;
}

int countReplacement(int n, int inputSeq[]){
	if(!valid(n,inputSeq)) return 0;
	vl a;
	bool B=1;
	for(int i=0;i<n;i++){
		if(inputSeq[i]>n) a.push_back(inputSeq[i]);
		else B=0;
	}
	sort(a.begin(),a.end());
	ll res=(B?n:1),m=a.size();
	for(int i=0;i<m-1;i++) (res*=Pow(m-i,a[i]-(i?a[i-1]:n)-1))%=mod;
	return (int)res;
}

Compilation message (stderr)

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

• 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