#include <bits/stdc++.h>
#include <gondola.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define mod (ll)(1e9+7)
__attribute__((constructor))
void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int valid(int n, int inputSeq[]) {
int d = 0, z = -1;
map<int, int> mp;
rep(i, 0, n) {
if(mp[inputSeq[i]]) return 0;
mp[inputSeq[i]] = 1;
if(inputSeq[i] <= n) {
if(z > inputSeq[i]) {
if(d) return 0;
else d = 1;
}else if(z != -1) {
if(z != inputSeq[i]) return 0;
}
z = inputSeq[i];
}
z++;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
int a[100001] = {};
int kr;
int mx = 0, mn = INT_MAX, mni;
rep(i, 0, n) {
if(mn > gondolaSeq[i]) {
mn = gondolaSeq[i];
mni = i;
}
}
if(mn <= n) {
rep(i, 0, n) {
a[mni + i] = mn;
mn++;
}
}
map<int, int> mp;
rep(i, 0, n) {
mx = max(mx, gondolaSeq[i]);
mp[gondolaSeq[i]] = 1;
}
int c = 0;
rep(i, 0, n) {
if(gondolaSeq[i] > n && gondolaSeq[i] - n <= n) {
replacementSeq[gondolaSeq[i] - n - 1] = a[i];
mp[a[i]] = 1;
c++;
}
}
int ri = 0;
rep(i, 1, mx + 1) {
if(!mp[i]) {
while(replacementSeq[ri]) ri++;
replacementSeq[ri] = i;
ri++;
}
}
int c = 0;
rep(i, 0, n) {
if(replacementSeq[i]) c++;
}
return c;
}
int countReplacement(int n, int inputSeq[]) {
if(!valid(n, inputSeq)) return 0;
int r[100001];
if(replacement(n, inputSeq, r) <= n) return 1;
vector<int> v;
int no = 0;
rep(i, 0, n) {
if(inputSeq[i] > n) v.pb(i);
else no++;
}
return 1;
}
// int main() {
// int n;
// cin >> n;
// int g[10001], gg[10001];
// rep(i, 0, n) cin >> g[i];
// cout << replacement(n, g, gg) << endl;
// rep(i, 0, n) cout << gg[i] << " ";
// cout << endl;
// }
Compilation message
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:76:7: error: redeclaration of 'int c'
int c = 0;
^
gondola.cpp:60:7: note: 'int c' previously declared here
int c = 0;
^
gondola.cpp:41:7: warning: unused variable 'kr' [-Wunused-variable]
int kr;
^
