Submission #96282

#	Time	Username	Problem	Language	Result	Execution time	Memory
96282		figter001	Gondola (IOI14_gondola)	C++14	60 / 100	20 ms	2276 KiB

gondola

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

using namespace std;

typedef long long ll;
const int maxs = 3e5;
const int maxn = 1e5;
const int mod = 1e9+7;

int f[maxs],o[maxn];

int valid(int n, int s[]){
	int st = -1,mn = n+1;
	for(int i=0;i<n;i++){
		if(f[s[i]])return 0;
		f[s[i]] = 1;
		if(s[i] < mn){
			st = i;
			mn = s[i];
		}
	}
	if(st == -1)return 1;
	for(int i=st;i<n;i++){
		if(s[i] <= n && s[i] != mn)return 0;
		mn++;
	}
	for(int i=0;i<st;i++){
		if(s[i] <= n && s[i] != mn)return 0;
		mn++;
	}
	return 1;
}

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

int replacement(int n, int s[], int rep[]){
	int l=0;
	int st = -1,mn = n+1;
	vector<pair<int,int>> to;
	for(int i=0;i<n;i++){
		if(s[i] <= mn){
			st = i;
			mn = s[i];
		}
		if(s[i] > n)to.push_back({s[i],i});
	}
	sort(to.begin(),to.end());
	if(st == -1){
		st = 0;
		mn = 1;
	}
	for(int i=st;i<n;i++){
		o[i] = mn++;
		mn%=(n+1);
		if(!mn)mn++;
	}
	for(int i=0;i<st;i++){
		o[i] = mn++;
		mn%=(n+1);
		if(!mn)mn++;
	}
	int cur = n+1;
	for(int i=0;i<(int)to.size();i++){
		int id = to[i].second;
		while(o[id] < to[i].first){
			rep[l++] = o[id];
			o[id] = cur;
			cur++;
		}
	}
	return l;
}

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

int countReplacement(int n, int s[]){
	if(!valid(n,s))return 0;
	vector<int> v;
	v.push_back(n);
	for(int i=0;i<n;i++){
		if(s[i] > n)v.push_back(s[i]);
	}
	sort(v.begin(),v.end());
	ll ans = 1;
	for(int i=1;i<v.size()-1;i++){
		ans = (ans * (v[i] - v[i-1]))%mod;
	}
	if(v.size() == n+1)ans = (ans * n)%mod;
	return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:86:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<v.size()-1;i++){
              ~^~~~~~~~~~~
gondola.cpp:89:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v.size() == n+1)ans = (ans * n)%mod;
     ~~~~~~~~~^~~~~~

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