Submission #1163059

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>
 
using namespace std;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
 
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;
typedef vector<pii> vp;

#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;

template<typename T> struct BIT {
	vector<T> bit;
	int n;
	
	BIT() {}
	BIT(int n) : bit(vector<T>(n + 2, 0)), n(n) {}
	
	T sum(int i) {
		i++;
		T s = 0;
		while (i > 0) {
			s += bit[i];
			i -= i & -i;
		}
		return s;
	}
	
	void add(int i, T x) {
		i++;
		while (i <= n) {
			bit[i] += x;
			i += i & -i;
		}
	}
	
	int lower_bound(T x) {
		int l = 0, r = bit.size() + 1;
		while (r - l > 1) {
			int m = (l + r) / 2;
			
			if (sum(m) >= x) r = m;
			else l = m;
		}
		if (r == bit.size() + 1) r = -1;
		return r;
	}
};

int n;
int a[112345], b[112345];
int conv[112345], rev[112345];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", a + i);
	REP(i, n) scanf("%d", b + i);
	
	REP(i, n) conv[ a[i] ] = i + 1;
	REP(i, n) rev[ i + 1 ] = a[i];
	
	
	BIT<int> bit(112345);
	ll d = 0;
	
	REP(i, n) b[i] = conv[ b[i] ];
	
	REP(i, n) {
		d += bit.sum(112345) - bit.sum(b[i]);
		bit.add(b[i], 1);
	}
	
	if (d & 1) puts("-1");
	else {
		d /= 2;
		
		int pos = 0;
		while (d >= n - pos - 1) {
			a[n - pos - 1] = pos + 1;
			d -= n - pos - 1;
			pos++;
		}
		REP(i, n - pos) a[i] = i + 1 + pos;
		
		FOR(i, 1, n - pos) {
			if (d == 0) break;
			
			swap(a[i], a[i - 1]);
		}
		
		REP(i, n) a[i] = rev[ a[i] ];
		
		REP(i, n) printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
	}
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:82:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, n) scanf("%d", a + i);
                              ^
./Main.cpp:83:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, n) scanf("%d", b + i);
                              ^

Judge Result