Submission #534100

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#define ALL(v) begin(v),end(v)
#else
#define ALL(v) (v).begin(),(v).end()
#endif

using namespace std;


namespace{
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8


template <class Tp>
struct fenwick_tree{
	typedef unsigned size_type;
	std::vector<Tp> bit;

	fenwick_tree(){}
	explicit fenwick_tree(size_type n){
		init(n);
	}
	void init(size_type n){
		bit.assign(n + 1, Tp());
	}
	Tp sum(size_type i) const{
		Tp s = 0;
		while(i){
			s += bit[i];
			i -= i & -i;
		}
		return s;
	}
	Tp summod(size_type i, Tp mod) const{
		Tp s = 0;
		while(i){
			s = (s + bit[i]) % mod;
			i -= i & -i;
		}
		if(s < 0){ s += mod; }
		return s;
	}
	void add(size_type i, Tp x){
		size_type sz = bit.size();
		while(i < sz){
			bit[i] += x;
			i += i & -i;
		}
	}
	void addmod(size_type i, Tp x, Tp mod){
		size_type sz = bit.size();
		x %= mod;
		if(x < 0){ x += mod; }
		while(i < sz){
			bit[i] = (bit[i] + x) % mod;
			i += i & -i;
		}
	}
	void clear(){
		bit.clear();
	}
	void swap(fenwick_tree &f){
		bit.swap(f.bit);
	}
};

LL calcinv(const vector<int> &v){
	int n = v.size();
	fenwick_tree<int> fw(n + 1);
	LL ans = 0;
	for(int i = 0; i < n; ++i){
		ans += i - fw.sum(v[i]);
		fw.add(v[i], 1);
	}
	return ans;
}

LL solve(){
	int n;
	scanf("%d", &n);
	vector<int> a(n), b(n);
	for(int &x : a){ scanf("%d", &x); }
	for(int &x : b){ scanf("%d", &x); }
	
	vector<int> rg(n);
	for(int i = 0; i < n; ++i){
		if(a[i] < b[0]){ return -1; }
		rg[i] = upper_bound(ALL(b), a[i]) - b.begin() - 1;
	}
	
	VV(int) pp(n);
	for(int i = 0; i < n; ++i){
		pp[rg[i]].push_back(i);
	}
	
	priority_queue<LL> pq;
	vector<int> v(n);
	for(int i = n - 1; i >= 0; --i){
		for(int x : pp[i]){
			pq.push(x);
		}
		if(pq.empty()){
			return -1;
		}
		v[i] = pq.top() + 1;
		pq.pop();
	}
	
	LL ans = calcinv(v);
	return ans;
}

void mainmain(){
	cout << solve() << endl;
}



}
int main() try{
//	ios::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	cerr << fixed << setprecision(4);
	mainmain();
}
catch(...){}

Submission Info

Compile Error

./Main.cpp: In function ‘{anonymous}::LL {anonymous}::solve()’:
./Main.cpp:146:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:148:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int &x : a){ scanf("%d", &x); }
                                  ^
./Main.cpp:149:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int &x : b){ scanf("%d", &x); }
                                  ^

Judge Result