#include "gondola.h"
#include <vector>
#include <algorithm>
#define mod 1000000009
vector<int> used;
using namespace std;
long long us(int x, int y) {
if(y==0) return 1;
if(y==1) return x%mod;
if(y&1) return (us(x,y>>1) + us(x, (y>>1)+1))%mod;
return (us(x, y>>1)*2)%mod;
}
int valid(int n, int inputSeq[])
{
for (int i = 0; i < n-1; ++i)
{
used.push_back(inputSeq[i]);
if(inputSeq[i]<=n and inputSeq[i+1]<=n and inputSeq[i+1]!=1 and inputSeq[i]>inputSeq[i+1]) return 0;
}
used.push_back(inputSeq[n-1]);
sort(used.begin(), used.end());
for(int i=0; i<used.size()-1; i++) if(used[i]==used[i+1]) return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
int res = 1, ctr=0;
if(!valid(n, inputSeq)) return -1;
bool flag = true;
vector<int> v;
for (int i = 0; i < n; ++i) {
if(inputSeq[i]>n) flag = false;
if(i!=n-1 and inputSeq[i+1] != (inputSeq[i]+1) and inputSeq[i+1]!=1) flag = false;
if(inputSeq[i]>n) {
ctr++;
v.push_back(inputSeq[i]);
}
}
sort(v.begin(), v.end());
if(flag) return 1;
int last = n+1;
for(int i= 0; i<v.size(); i++) {
res*= us(v[i]-last, v.size()-i);
last = v[i]+1;
}
return res;
}
Compilation message
gondola.cpp:5:1: error: 'vector' does not name a type
vector<int> used;
^
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:20:4: error: 'used' was not declared in this scope
used.push_back(inputSeq[i]);
^
gondola.cpp:23:3: error: 'used' was not declared in this scope
used.push_back(inputSeq[n-1]);
^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:55:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i= 0; i<v.size(); i++) {
^
