結果

問題 No.1051 PQ Permutation
コンテスト
ユーザー chocopuu
提出日時 2020-05-08 22:38:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,761 bytes
コンパイル時間 2,780 ms
コンパイル使用メモリ 208,516 KB
最終ジャッジ日時 2025-01-10 09:04:23
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26 WA * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

template<int MOD> struct Fp {
	long long val;
	constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
		if (val < 0) val += MOD;
	}
	constexpr int getmod() { return MOD; }
	constexpr Fp operator - () const noexcept {
		return val ? MOD - val : 0;
	}
	constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
	constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
	constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
	constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
	constexpr Fp& operator += (const Fp& r) noexcept {
		val += r.val;
		if (val >= MOD) val -= MOD;
		return *this;
	}
	constexpr Fp& operator -= (const Fp& r) noexcept {
		val -= r.val;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr Fp& operator *= (const Fp& r) noexcept {
		val = val * r.val % MOD;
		return *this;
	}
	constexpr Fp& operator /= (const Fp& r) noexcept {
		long long a = r.val, b = MOD, u = 1, v = 0;
		while (b) {
			long long t = a / b;
			a -= t * b; swap(a, b);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
		return this->val == r.val;
	}
	constexpr bool operator != (const Fp& r) const noexcept {
		return this->val != r.val;
	}
	friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
		return os << x.val;
	}
	friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
		if (n == 0) return 1;
		auto t = modpow(a, n / 2);
		t = t * t;
		if (n & 1) t = t * a;
		return t;
	}
};
 
// 二項係数ライブラリ
template<class T> struct BiCoef {
	vector<T> fact_, inv_, finv_;
	constexpr BiCoef() {}
	constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
		init(n);
	}
	constexpr void init(int n) noexcept {
		fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
		int MOD = fact_[0].getmod();
		for(int i = 2; i < n; i++){
			fact_[i] = fact_[i-1] * i;
			inv_[i] = -inv_[MOD%i] * (MOD/i);
			finv_[i] = finv_[i-1] * inv_[i];
		}
	}
	constexpr T com(int n, int k) const noexcept {
		if (n < k || n < 0 || k < 0) return 0;
		return fact_[n] * finv_[k] * finv_[n-k];
	}
	constexpr T fact(int n) const noexcept {
		if (n < 0) return 0;
		return fact_[n];
	}
	constexpr T inv(int n) const noexcept {
		if (n < 0) return 0;
		return inv_[n];
	}
	constexpr T finv(int n) const noexcept {
		if (n < 0) return 0;
		return finv_[n];
	}
};
 
const int MOD = 1000000007;
// const int MOD = 
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);

template <typename T>
struct SegmentTree{
	using F = function<T(T,T)>;
	int n;
	F f;
	T ti;
	vector<T> dat;
	SegmentTree(){};
	SegmentTree(F f,T ti):f(f),ti(ti){}
	void init(int n_){
		n=1;
		while(n<n_) n<<=1;
		dat.assign(n<<1,ti);
	}
	void build(const vector<T> &v){
		int n_=v.size();
		init(n_);
		for(int i=0;i<n_;i++) dat[n+i]=v[i];
		for(int i=n-1;i;i--)
			dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
	}
	void set_val(int k,T x){
		dat[k+=n]=x;
		while(k>>=1)
			dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
	}
	T query(int a,int b){
		T vl=ti,vr=ti;
		for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
			if(l&1) vl=f(vl,dat[l++]);
			if(r&1) vr=f(dat[--r],vr);
		}
		return f(vl,vr);
	}
};
//auto f = [](){};
//auto seg = SegmentTree<T,decltype(f)>(f,Ti);

signed main(){
	int N,P,Q;
	cin >> N >> P >> Q;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
		--a[i];
	}
	set<int>st;
	REP(i,N)st.insert(i);
	vector<int>ans(N);
	int pInsert = 0;
	int isOver = 0;
	--P;--Q;
	REP(i,N){
		if(isOver){
			auto itr = st.begin();
			//out("itr",*itr,P);
			if(*itr == Q){
				if(pInsert){
					ans[i] = *itr;
					st.erase(itr);
				}else{
					++itr;
					ans[i] = *itr;
					if(*itr == P)pInsert = true;
					st.erase(itr);
				}
			}else if(*itr == P){
				pInsert = true;
				ans[i] = *itr;
				st.erase(itr);
			}else{
				ans[i] = *itr;
				st.erase(itr);
			}
			/*out("pInsert",pInsert);
			REP(i,ans.size())cout << ans[i] << " \n"[i+1 == ans.size()];
			for(auto e:st)cout << e << " ";
			cout << endl;*/
			continue;
		}
		auto itr = st.lower_bound(a[i]);
		if(*itr == Q){
			if(pInsert){
				ans[i] = *itr;
				st.erase(itr);
			}else{
				if(next(itr) == st.end()){
					out(-1);
					return 0;
				}
				++itr;
				if(*itr == P)pInsert = true;
				ans[i] = *itr;
				st.erase(itr);
			}
		}else if(*itr == P){
			pInsert = true;
			ans[i] = *itr;
			st.erase(itr);
		}else{
			ans[i] = *itr;
			st.erase(itr);
		}
		if(ans[i] > a[i])isOver = true;
		//REP(i,ans.size())cout << ans[i] << " \n"[i+1 == ans.size()];
	}
	if(ans == a){
		SegmentTree<pair<int,int>>seg([](pair<int,int>a,pair<int,int>b){return min(a,b);},{INF,INF});
		seg.build(vector<pair<int,int>>(N));
		REP(i,N)seg.set_val(i,{a[i],i});
		RREP(i,N - 1){
			auto[hoge,idx] = seg.query(i + 1,N);
			if(hoge > a[i]){
				swap(ans[i],ans[idx]);
				break;
			}
		}
	}
	if(ans == a){
		out(-1);
		return 0;
	}
	REP(i,ans.size())cout << ans[i] + 1 << " \n"[i+1 == ans.size()];
}
0