#include <bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }
void cio(){
ios::sync_with_stdio(false);
cin.tie(NULL);
}
#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define endl '\n'
typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
const ll mod = 1e9+7;
#include "king.h"
int N;
int vis[500500];
long long SendInfo(std::vector<int> W, std::vector<int> C) {
// N = sz(W);
// sort(all(W)); sort(all(C));
// int ans = 0;
// set<pll> S;
// for (int i = 0; i < N; i++) S.insert({C[i], i});
// int mx = -1;
// for ( int i = 0; i < N ; i++) {
// auto it = S.lower_bound({W[i], -1000000});
// if( it == S.end() ) continue;
// vis[it->second] = 1;
// mx = max(mx, (int) it->second);
// }
// Debug(mx);
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include "king.h"
#include "vassal.h"
static int N, chk[101010];
static std::vector<int> W, C;
static void my_assert(int TF, const char* message){
if(!TF){ puts(message); exit(0); }
}
int main(){
my_assert(scanf("%d", &N) == 1, "Error: Invalid Input");
my_assert(1 <= N && N <= 100000, "Error: Invalid Input");
W.resize(N);
for(int i = 0; i < N; i++){
my_assert(scanf("%d", &W[i]) == 1, "Error: Invalid Input");
my_assert(1 <= W[i] && W[i] <= 1000000, "Error: Invalid Input");
}
C.resize(N);
for(int i = 0; i < N; i++){
my_assert(scanf("%d", &C[i]) == 1, "Error: Invalid Input");
my_assert(1 <= C[i] && C[i] <= 1000000, "Error: Invalid Input");
if(i) my_assert(C[i-1] <= C[i], "Error: Invalid Input");
}
long long num = SendInfo(W, C);
my_assert(0 <= num && num < (1ll << 60), "Wrong[1] : Invalid Number");
int chair_cnt = 0;
Init(num, C);
for(int i = 0; i < N; i++){
int ci = Maid(W[i]);
my_assert(-1 <= ci && ci < N, "Wrong[2] : Invalid Chair Number");
my_assert(-1 == ci || !chk[ci], "Wrong[2] : Invalid Chair Number");
my_assert(-1 == ci || W[i] <= C[ci], "Wrong[2] : Invalid Chair");
if( ci == - 1 ) continue;
chk[ci] = 1;
if(ci) chair_cnt++;
}
printf("Correct\n%d\n", chair_cnt);
return 0;
}
Compilation message
/tmp/ccSBgoNu.o: In function `main':
grader_v.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cccjJx4B.o:vassal.cpp:(.text.startup+0x0): first defined here
/tmp/cccjJx4B.o: In function `main':
vassal.cpp:(.text.startup+0x14c): undefined reference to `SendInfo(std::vector<int, std::allocator<int> >, std::vector<int, std::allocator<int> >)'
vassal.cpp:(.text.startup+0x19b): undefined reference to `Init(long long, std::vector<int, std::allocator<int> >)'
vassal.cpp:(.text.startup+0x1d3): undefined reference to `Maid(int)'
/tmp/ccSBgoNu.o: In function `main':
grader_v.cpp:(.text.startup+0x1b7): undefined reference to `Init(long long, std::vector<int, std::allocator<int> >)'
grader_v.cpp:(.text.startup+0x22d): undefined reference to `Maid(int)'
collect2: error: ld returned 1 exit status
