結果

問題 No.1888 Odd Insertion
ユーザー heno239heno239
提出日時 2022-03-25 23:22:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 470 ms / 2,000 ms
コード長 8,433 bytes
コンパイル時間 3,052 ms
コンパイル使用メモリ 178,180 KB
実行使用メモリ 40,000 KB
最終ジャッジ日時 2024-10-14 07:34:17
合計ジャッジ時間 21,227 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
11,648 KB
testcase_01 AC 8 ms
11,520 KB
testcase_02 AC 8 ms
11,648 KB
testcase_03 AC 8 ms
11,648 KB
testcase_04 AC 8 ms
11,520 KB
testcase_05 AC 8 ms
11,648 KB
testcase_06 AC 216 ms
32,032 KB
testcase_07 AC 217 ms
31,936 KB
testcase_08 AC 425 ms
36,756 KB
testcase_09 AC 448 ms
37,036 KB
testcase_10 AC 470 ms
36,716 KB
testcase_11 AC 448 ms
37,052 KB
testcase_12 AC 409 ms
36,692 KB
testcase_13 AC 459 ms
36,808 KB
testcase_14 AC 418 ms
36,936 KB
testcase_15 AC 443 ms
36,680 KB
testcase_16 AC 373 ms
34,884 KB
testcase_17 AC 453 ms
36,756 KB
testcase_18 AC 372 ms
34,760 KB
testcase_19 AC 390 ms
34,984 KB
testcase_20 AC 368 ms
34,752 KB
testcase_21 AC 400 ms
35,028 KB
testcase_22 AC 369 ms
34,608 KB
testcase_23 AC 386 ms
35,108 KB
testcase_24 AC 372 ms
34,968 KB
testcase_25 AC 378 ms
35,140 KB
testcase_26 AC 313 ms
36,848 KB
testcase_27 AC 290 ms
33,732 KB
testcase_28 AC 314 ms
40,000 KB
testcase_29 AC 215 ms
33,480 KB
testcase_30 AC 273 ms
33,840 KB
testcase_31 AC 265 ms
33,652 KB
testcase_32 AC 272 ms
33,856 KB
testcase_33 AC 295 ms
36,780 KB
testcase_34 AC 319 ms
36,816 KB
testcase_35 AC 304 ms
34,844 KB
testcase_36 AC 332 ms
34,704 KB
testcase_37 AC 337 ms
37,188 KB
testcase_38 AC 334 ms
35,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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, ll 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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;

string drul = "DRUL";
//DRUL
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

template<typename T>
struct BIT {
private:
	vector<T> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, T w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	T sum(int a) {
		T ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	T sum(int a, int b) {
		return sum(b) - sum(a);
	}
};
template<typename T>
struct SegT {
private:
	int sz; vector<T> node;
	T init_c;
	function<T(T, T)> f;
public:
	SegT(vector<T> v, T _init_c, function<T(T, T)> _f) {
		init_c = _init_c; f = _f;
		int n = v.size();
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
		rep(i, n) {
			node[i + sz - 1] = v[i];
		}
		per(i, sz - 1) {
			node[i] = f(node[2 * i + 1], node[2 * i + 2]);
		}
	}
	SegT(int n, T _init_c, function<T(T, T)> _f) {
		init_c = _init_c; f = _f;
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	void update(int k, T a) {
		k += sz - 1;
		node[k] = a;
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	T query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k];
		else {
			T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
	//k以上でf(x,node[y+sz-1])をtrueにするような最小のy
	int searchloc(int le, T x, function<bool(T, T)> comp) {
		int  k = le + sz - 1;
		if (comp(x, node[k]))return le;
		x = f(x, node[k]);
		while (k > 0) {
			int mem = k;
			k = (k - 1) / 2;
			if (2 * k + 1 == mem) {
				if (comp(x, node[2 * k + 2])) {
					k = 2 * k + 2; break;
				}
				x = f(x, node[2 * k + 2]);
			}
		}
		if (k == 0)return sz;
		while (k < sz - 1) {
			if (comp(x, node[2 * k + 1])) {
				k = 2 * k + 1;
			}
			else {
				x = f(x, node[2 * k + 1]);
				k = 2 * k + 2;
			}
		}
		return k - (sz - 1);
	}
};

struct Data {
	int len;
	int val[2];
};
Data e = { 0,{-1,-1} };
void solve() {
	auto merge = [&](Data a, Data b) {
		if (a.len % 2) {
			swap(b.val[0], b.val[1]);
		}
		Data res;
		res.len = a.len + b.len;
		rep(j, 2) {
			if (a.val[j] >= 0) {
				res.val[j] = a.val[j];
			}
			else {
				res.val[j] = b.val[j];
			}
		}
		return res;
	};
	int n; cin >> n;
	vector<int> p(n);
	rep(i, n)cin >> p[i];
	vector<int> rev(n + 1);
	rep(i, n)rev[p[i]] = i;
	vector<int> pre(n+1);
	BIT<int> bt(n);
	rep1(i, n) {
		int loc = rev[i];
		pre[i] = bt.sum(0, loc) % 2;
		bt.add(loc, 1);
	}
	auto f = [&](int a, int b) {return min(a, b); };
	vector<int> oriev(n,mod),oriod(n,mod);
	rep1(i, n) {
		int loc = rev[i];
		if (pre[i] == 0)oriev[loc] = i;
		else oriod[loc] = i;
	}
	SegT<int> stev(oriev, mod, f), stod(oriod, mod, f);
	vector<bool> can(n + 1);
	vector<int> par(n + 1);
	can[0] = true;
	vector<vector<int>> dec(n + 1);
	SegT<Data>st(n, e, merge);
	rep1(i, n) {
		for (int id : dec[i]) {
			st.update(rev[id], { 1,{-1,-1} });
		}
		stev.update(rev[i], mod);
		stod.update(rev[i], mod);
		if (can[i - 1]) {
			int loc = rev[i];
			int ri = mod;
			chmin(ri, stod.query(0, loc));
			chmin(ri, stev.query(loc + 1, n));
			//cout << i << " " << ri << "\n";
			if(ri<=n)dec[ri].push_back(i);
			st.update(loc, { 1,{i - 1,-1} });
		}
		else {
			st.update(rev[i], { 1,{-1,-1} });
		}

		Data d = st.query(0, n);
		if (d.val[0] >= 0) {
			can[i] = true;
			par[i] = d.val[0];
		}
	}
	//coutarray(can);
	//coutarray(par);
	if (!can[n]) {
		cout << "No\n"; return;
	}
	vector<int> ansid;
	int cur = n;
	while (cur > 0) {
		int p = par[cur];
		ansid.push_back(p + 1);
		for (int i = cur; i > p + 1; i--) {
			ansid.push_back(i);
		}
		cur = p;
	}
	reverse(all(ansid));
	cout << "Yes\n";
	BIT<int> btcur(n);
	rep(i, n) {
		int id = ansid[i];
		int loc = btcur.sum(0, rev[id])+1;
		cout << id << " " << loc << "\n";
		btcur.add(rev[id], 1);
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0