#773603 (C++17) No.1990 Candy Boxes

提出ソース

結果

問題	No.1990 Candy Boxes
ユーザー	heno239
提出日時	2022-06-24 23:04:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,029 bytes
コンパイル時間	2,165 ms
コンパイル使用メモリ	153,576 KB
実行使用メモリ	15,384 KB
最終ジャッジ日時	2024-11-20 15:30:55
合計ジャッジ時間	6,510 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	20 ms 11,596 KB
testcase_01	AC	20 ms 11,720 KB
testcase_02	AC	20 ms 11,716 KB
testcase_03	AC	20 ms 11,724 KB
testcase_04	AC	19 ms 11,720 KB
testcase_05	WA	-
testcase_06	AC	20 ms 11,844 KB
testcase_07	WA	-
testcase_08	AC	20 ms 11,596 KB
testcase_09	AC	20 ms 11,724 KB
testcase_10	AC	19 ms 11,844 KB
testcase_11	AC	20 ms 11,844 KB
testcase_12	AC	37 ms 12,356 KB
testcase_13	AC	38 ms 12,488 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	35 ms 12,744 KB
testcase_20	AC	39 ms 12,748 KB
testcase_21	AC	35 ms 12,488 KB
testcase_22	AC	34 ms 12,356 KB
testcase_23	AC	38 ms 12,612 KB
testcase_24	AC	37 ms 12,612 KB
testcase_25	AC	45 ms 12,996 KB
testcase_26	AC	39 ms 13,000 KB
testcase_27	AC	38 ms 13,000 KB
testcase_28	AC	35 ms 13,128 KB
testcase_29	AC	39 ms 13,004 KB
testcase_30	AC	35 ms 12,740 KB
testcase_31	AC	40 ms 13,128 KB
testcase_32	AC	30 ms 12,228 KB
testcase_33	AC	35 ms 12,744 KB
testcase_34	AC	33 ms 14,116 KB
testcase_35	AC	40 ms 15,296 KB
testcase_36	AC	40 ms 15,240 KB
testcase_37	AC	36 ms 13,468 KB
testcase_38	AC	33 ms 13,360 KB
testcase_39	AC	36 ms 14,360 KB
testcase_40	AC	33 ms 12,748 KB
testcase_41	AC	33 ms 12,744 KB
testcase_42	AC	28 ms 12,360 KB
testcase_43	AC	31 ms 12,488 KB
testcase_44	AC	31 ms 12,488 KB
testcase_45	AC	29 ms 12,616 KB
testcase_46	AC	36 ms 12,616 KB
testcase_47	AC	42 ms 12,744 KB
testcase_48	AC	38 ms 12,872 KB
testcase_49	AC	20 ms 11,720 KB
testcase_50	AC	20 ms 11,724 KB
testcase_51	AC	20 ms 11,720 KB
testcase_52	AC	20 ms 11,720 KB
testcase_53	AC	19 ms 11,724 KB
testcase_54	AC	20 ms 11,720 KB
testcase_55	AC	20 ms 11,720 KB
testcase_56	AC	20 ms 11,720 KB
testcase_57	AC	19 ms 11,724 KB
testcase_58	AC	20 ms 11,720 KB
testcase_59	AC	20 ms 11,716 KB
testcase_60	AC	21 ms 11,724 KB
testcase_61	AC	19 ms 11,720 KB
testcase_62	AC	20 ms 11,848 KB
testcase_63	AC	20 ms 11,720 KB
testcase_64	AC	20 ms 11,720 KB
testcase_65	AC	41 ms 14,264 KB
testcase_66	AC	37 ms 13,960 KB
testcase_67	AC	38 ms 14,048 KB
testcase_68	AC	31 ms 13,256 KB
testcase_69	AC	40 ms 15,344 KB
testcase_70	AC	41 ms 15,384 KB
testcase_71	AC	37 ms 12,744 KB
testcase_72	AC	41 ms 13,004 KB
testcase_73	AC	39 ms 13,000 KB
testcase_74	AC	34 ms 12,488 KB
testcase_75	AC	30 ms 12,620 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

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



bool isok(vector<int> c) {
	int n = c.size();
	int l = 0;
	while (l < n && c[l]%2 == 0)l++;
	if (l == n)return true;
	int r = n - 1;
	while (c[r]%2 == 0)r--;
	//[l,r]
	
	vector<int> bel(n);
	vector<int> st;
	int tmp = 0;
	Rep1(i, l, r) {
		int le = i;
		while (i + 1 <= r && c[i]%2 == c[i + 1]%2)i++;
		int col = tmp; tmp ^= 1;
		int len = i - le + 1;
		bool isad = false;
		if (len % 2 == 0) {
			isad = true;
			if (c[i] % 2 == 0 && st.empty())isad = false;
		}
		if (isad) {
			if (st.size() && st.back() == col)st.pop_back();
			else st.push_back(col);
		}
		Rep1(j, le, i) {
			bel[j] = st.size();
		}
	}
	if (st.size())return false;
	Rep1(i, l, r)if (bel[i] > c[i])return false;
	return true;
}
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<int> b(n - 1);
	rep(i, n - 1) {
		b[i] = a[i]; if (i > 0)b[i] -= b[i - 1];
		if (b[i] < 0) {
			cout << "No\n"; return;
		}
	}
	int l = 0;
	rep(i, n-1) {
		if (b[i] == 0) {
			//[l,i)
			vector<int> c;
			Rep(j, l, i) {
				c.push_back(b[j]);
			}
			if (!isok(c)) {
				cout << "No\n"; return;
			}
			l = i + 1;
		}
	}
	vector<int> c;
	Rep(j, l, n-1) {
		c.push_back(b[j]);
	}
	if (!isok(c)) {
		cout << "No\n"; return;
	}
	cout << "Yes\n";
}

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

yukicoder

結果

テストケース

ソースコード