#include <bits/stdc++.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;
}
z = inputSeq[i];
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
map<int, int> mp;
int mx = 0;
rep(i, 0, n) {
mx = max(mx, gondolaSeq[i]);
mp[gondolaSeq[i]] = 1;
}
int ri = 0;
rep(i, 1, mx) {
if(!mp[i]) {
replacementSeq[ri] = i;
ri++;
}
}
return ri;
}
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 c[10], h[10], p[10];
// rep(i, 0, n) cin >> c[i];
// rep(i, 1, n) cin >> h[i] >> p[i];
// cout << findSample(n, c, h, p) << endl;
// }
Compilation message
/tmp/ccLD6v7f.o: In function `main':
grader.cpp:(.text.startup+0xcb): undefined reference to `countReplacement'
grader.cpp:(.text.startup+0xea): undefined reference to `valid'
grader.cpp:(.text.startup+0x10e): undefined reference to `replacement'
collect2: error: ld returned 1 exit status
