結果

問題 No.1051 PQ Permutation
コンテスト
ユーザー heno239
提出日時 2020-05-08 22:38:37
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 5,036 bytes
コンパイル時間 1,490 ms
コンパイル使用メモリ 131,652 KB
実行使用メモリ 18,328 KB
最終ジャッジ日時 2024-07-05 19:50:32
合計ジャッジ時間 5,900 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 35 WA * 6 RE * 5
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void solve()':
main.cpp:149:9: warning: 'locp' may be used uninitialized [-Wmaybe-uninitialized]
  149 |         if (locp < locq) {
      |         ^~
main.cpp:143:13: note: 'locp' was declared here
  143 |         int locp, locq;
      |             ^~~~
main.cpp:149:9: warning: 'locq' may be used uninitialized [-Wmaybe-uninitialized]
  149 |         if (locp < locq) {
      |         ^~
main.cpp:143:19: note: 'locq' was declared here
  143 |         int locp, locq;
      |                   ^~~~

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

vector<int> proc(vector<int> p) {
	stack<int> q;
	int n = p.size();
	q.push(p[n - 1]);
	per(i, n - 1) {
		if (q.top() > p[i]) {
			vector<int> rest;
			rest.push_back(p[i]);
			while (!q.empty()) {
				rest.push_back(q.top()); q.pop();
			}
			sort(all(rest));
			rep(j, rest.size()) {
				if (rest[j] > p[i]) {
					p[i] = rest[j];
					rest.erase(rest.begin() + j);
					break;
				}
			}
			rep(j, rest.size()) {
				p[i + 1 + j] = rest[j];
			}
			return p;
		}
		q.push(p[i]);
	}

	return {};
}

void arrayout(vector<int> &a) {
	int n = a.size();
	rep(i, n) {
		if (i > 0)cout << " ";
		cout << a[i] + 1;
	}
	cout << endl;
}
void solve() {
	int n, p, q; cin >> n >> p >> q; p--; q--;
	vector<int> a(n);
	int locp, locq;
	rep(i, n) {
		cin >> a[i]; a[i]--;
		if (a[i] == p)locp = i;
		if (a[i] == q)locq = i;
	}
	if (locp < locq) {
		a = proc(a);
		if (a.empty()) {
			cout << -1 << endl; return;
		}
		rep(i, n) {
			if (a[i] == p)locp = i;
			if (a[i] == q)locq = i;
		}
		if (locp < locq) {
			arrayout(a); return;
		}
	}


	vector<int> inc(n,-1);
	set<int> st;
	rep(i, n)st.insert(i);
	rep(i, n-1) {
		auto itr = st.find(a[i]);
		itr++;
		if (itr != st.end()) {
			inc[i] = *itr;
		}
		st.erase(a[i]);
	}
	int chk = -1;
	for (int i = locq; i >= 0; i--) {
		if (inc[i] >= 0) {
			chk = i; break;
		}
	}
	if (chk < 0) {
		cout << -1 << endl; return;
	}
	vector<int> rest;
	Rep(i, chk, n) {
		if (a[i] != inc[chk]) {
			rest.push_back(a[i]);
		}
	}

	sort(all(rest));
	vector<int> ans = a;
	ans[chk] = inc[chk];
	if (inc[chk] == p) {
		assert(false);
		ans.resize(chk + 1);
		rep(i, rest.size()) {
			if (rest[i] < q)ans.push_back(rest[i]);
		}
		rep(i, rest.size()) {
			if (q < rest[i] && rest[i] < p)ans.push_back(rest[i]);
		}
		//ans.push_back(p);
		ans.push_back(q);
		rep(i, rest.size()) {
			if (p < rest[i])ans.push_back(rest[i]);
		}
		arrayout(ans);
	}
	else if (p<q) {
		rep(i, rest.size()) {
			ans[chk + 1 + i] = rest[i];
		}
		arrayout(ans); return;
	}
	else {
		ans.resize(chk + 1);
		rep(i, rest.size()) {
			if (rest[i] < q)ans.push_back(rest[i]);
		}
		rep(i, rest.size()) {
			if (q < rest[i] && rest[i] < p)ans.push_back(rest[i]);
		}
		ans.push_back(p);
		ans.push_back(q);
		rep(i, rest.size()) {
			if (p < rest[i])ans.push_back(rest[i]);
		}
		arrayout(ans);
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	solve();
	stop
		return 0;
}
0