結果

問題 No.1834 1D Gravity
ユーザー heno239heno239
提出日時 2022-02-12 17:59:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 6,989 bytes
コンパイル時間 1,911 ms
コンパイル使用メモリ 153,108 KB
実行使用メモリ 14,840 KB
最終ジャッジ日時 2023-09-11 05:51:44
合計ジャッジ時間 4,468 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 20 ms
11,700 KB
testcase_01 AC 40 ms
13,868 KB
testcase_02 AC 41 ms
14,800 KB
testcase_03 AC 40 ms
13,872 KB
testcase_04 AC 41 ms
14,840 KB
testcase_05 AC 40 ms
14,332 KB
testcase_06 AC 40 ms
14,544 KB
testcase_07 AC 20 ms
11,824 KB
testcase_08 AC 19 ms
11,580 KB
testcase_09 AC 19 ms
11,576 KB
testcase_10 AC 19 ms
11,576 KB
testcase_11 AC 19 ms
11,524 KB
testcase_12 AC 20 ms
11,636 KB
testcase_13 AC 49 ms
13,756 KB
testcase_14 AC 48 ms
13,656 KB
testcase_15 AC 45 ms
13,852 KB
testcase_16 AC 41 ms
14,704 KB
testcase_17 AC 40 ms
14,324 KB
testcase_18 AC 44 ms
13,984 KB
testcase_19 AC 43 ms
13,688 KB
testcase_20 AC 49 ms
13,808 KB
testcase_21 AC 41 ms
14,440 KB
testcase_22 AC 40 ms
13,732 KB
testcase_23 AC 40 ms
14,052 KB
testcase_24 AC 39 ms
13,500 KB
testcase_25 AC 39 ms
13,832 KB
testcase_26 AC 19 ms
11,576 KB
testcase_27 AC 20 ms
11,612 KB
testcase_28 AC 19 ms
11,736 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:284:33: 警告: ‘0[4611686018427387903]’ may be used uninitialized [-Wmaybe-uninitialized]
  284 |                 int cr = vl.back(); vl.pop_back();
      |                          ~~~~~~~^~

ソースコード

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


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


void solve() {
	int n; cin >> n;
	vector<int> p(n);
	rep(i, n)cin >> p[i];
	if (n == 2) {
		cout << 0 << " " << 1 << "\n"; return;
	}
	vector<int> b(n);
	rep(i, n) {
		int le = 0, ri = 0;
		if (i > 0)le = p[i - 1];
		if (i + 1 < n)ri = p[i + 1];
		if (le < ri)b[i] = true;
		else b[i] = false;
	}
	vector<P> ps;
	rep(i, n) {
		int le = i;
		while (i + 1 < n && b[i] == b[i + 1])i++;
		ps.push_back({ le,i + 1 });
	}
	int ans1 = 0, ans2 = 0;
	function<int(int, int, vector<int>&, vector<int>&)> calc = [&](int cl, int cr, vector<int>& vl, vector<int>& vr) {
		int res = 0;
		while (vl.size() || vr.size()) {
			bool bl, br;
			int le = 0;
			if (vl.size())le = vl.back();
			int ri = cr;
			if (le < ri)bl = true;
			else bl = false;
			le = cl;
			ri = 0;
			if (vr.size())ri = vr.back();
			if (le < ri)br = true;
			else br = false;
			if (bl && br) {
				res++;
				assert(vr.size());
				cl = max(cl, vr.back()); vr.pop_back();
				if (vr.size()) {
					cr = max(cr, vr.back()); vr.pop_back();
				}
			}
			else if (!bl && !br) {
				res++;
				assert(vl.size());
				cr = max(cr, vl.back()); vl.pop_back();
				if (vl.size()) {
					cl = max(cl, vl.back()); vl.pop_back();
				}
			}
			else if (bl && !br) {
				res++;
				swap(cl, cr);
				if (vl.size()) {
					cl = max(cl, vl.back()); vl.pop_back();
				}
				if (vr.size()) {
					cr = max(cr, vr.back()); vr.pop_back();
				}
			}
			else {
				assert(vl.size() && vr.size());
				ans2++;
				int val = 0;
				vector<int> cc;
				int ncl = vl.back(); vl.pop_back();
				int ncr = cl;
				chmax(val, calc(ncl, ncr, vl, cc));

				ncl = cr;
				ncr = vr.back(); vr.pop_back();
				chmax(val, calc(ncl, ncr, cc, vr));

				res += val;
				break;
			}
		}
		return res;
	};
	assert(ps.size() % 2 == 0);
	rep(i, ps.size()) {
		//cout << "hello " << i << " " << ans2 << "\n";
		assert(i % 2 == 0);
		assert(i + 1 < ps.size());
		int ri = i + 1;
		while (ri + 1 < ps.size() && ps[ri].second - ps[ri].first == 1 && ps[ri + 1].second - ps[ri + 1].first == 1) {
			ri += 2;
		}
		//[i,ri]
		int len = ri - i + 1;
		len /= 2;
		int ad = len;
		vector<int> vl, vr;
		Rep(j, ps[i].first, ps[i].second)vl.push_back(p[j]);
		Rep(j, ps[ri].first, ps[ri].second)vr.push_back(p[j]);
		reverse(all(vr));
		int cl = vr.back(); vr.pop_back();
		int cr = vl.back(); vl.pop_back();
		if (vl.size()) {
			chmax(cl, vl.back()); vl.pop_back();
		}
		if (vr.size()) {
			chmax(cr, vr.back()); vr.pop_back();
		}
		ans2++;
		int val = calc(cl, cr, vl, vr);
		chmax(ans1, val + ad);

		i = ri;
	}
	cout << ans1 << " " << ans2 << "\n";
}
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