#814508 (C++11) No.1990 Candy Boxes

提出ソース

結果

問題	No.1990 Candy Boxes
ユーザー	leaf_1415
提出日時	2022-11-05 01:30:28
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	9,278 bytes
コンパイル時間	1,645 ms
コンパイル使用メモリ	120,276 KB
実行使用メモリ	22,104 KB
最終ジャッジ日時	2024-11-20 15:38:02
合計ジャッジ時間	5,536 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 12,928 KB
testcase_01	AC	6 ms 12,672 KB
testcase_02	AC	6 ms 12,800 KB
testcase_03	AC	5 ms 12,800 KB
testcase_04	AC	5 ms 12,800 KB
testcase_05	WA	-
testcase_06	AC	7 ms 12,800 KB
testcase_07	WA	-
testcase_08	AC	6 ms 12,800 KB
testcase_09	AC	7 ms 12,800 KB
testcase_10	AC	7 ms 12,800 KB
testcase_11	AC	6 ms 12,800 KB
testcase_12	AC	21 ms 14,464 KB
testcase_13	AC	23 ms 14,464 KB
testcase_14	AC	22 ms 17,024 KB
testcase_15	AC	23 ms 17,664 KB
testcase_16	AC	26 ms 17,920 KB
testcase_17	AC	28 ms 18,432 KB
testcase_18	AC	28 ms 18,432 KB
testcase_19	AC	20 ms 14,464 KB
testcase_20	AC	21 ms 14,720 KB
testcase_21	AC	21 ms 14,592 KB
testcase_22	AC	18 ms 13,568 KB
testcase_23	AC	23 ms 13,824 KB
testcase_24	AC	23 ms 13,824 KB
testcase_25	AC	30 ms 14,336 KB
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	27 ms 17,792 KB
testcase_29	WA	-
testcase_30	AC	24 ms 17,152 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	27 ms 18,688 KB
testcase_35	AC	38 ms 21,348 KB
testcase_36	AC	36 ms 20,876 KB
testcase_37	AC	26 ms 17,792 KB
testcase_38	AC	22 ms 16,640 KB
testcase_39	AC	24 ms 17,024 KB
testcase_40	AC	23 ms 16,004 KB
testcase_41	WA	-
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	AC	14 ms 14,464 KB
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	AC	7 ms 12,800 KB
testcase_50	AC	6 ms 12,800 KB
testcase_51	AC	5 ms 12,928 KB
testcase_52	AC	6 ms 12,800 KB
testcase_53	AC	7 ms 12,800 KB
testcase_54	AC	6 ms 12,800 KB
testcase_55	AC	6 ms 12,928 KB
testcase_56	AC	6 ms 12,800 KB
testcase_57	AC	6 ms 12,800 KB
testcase_58	AC	7 ms 12,800 KB
testcase_59	AC	7 ms 12,800 KB
testcase_60	AC	6 ms 12,800 KB
testcase_61	AC	6 ms 12,800 KB
testcase_62	AC	6 ms 12,800 KB
testcase_63	AC	5 ms 12,800 KB
testcase_64	AC	6 ms 12,800 KB
testcase_65	WA	-
testcase_66	WA	-
testcase_67	AC	37 ms 20,992 KB
testcase_68	AC	22 ms 16,768 KB
testcase_69	AC	40 ms 21,760 KB
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	AC	25 ms 14,336 KB
testcase_74	WA	-
testcase_75	AC	16 ms 13,824 KB

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

ソースコード

raw source code

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const int mod = 1000000007;
//const int mod = 998244353;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
template<typename T> T comb2(ll n, ll k){ T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}

vector<int> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}

template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}

ll n;
ll b[200005], d[200005];
vector<P> avec[200005], bvec[200005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	rep(i, 1, n) cin >> b[i];
	
	rep(i, 1, n-1){
		if(b[i] == 0) continue;
		if(b[i] > b[i+1]){
			outl("No");
			return 0;
		}
		b[i+1] -= b[i];
		d[i] = b[i];
	}
	//outa(d, 1, n);
	
	stack<P> stk[2];
	stk[0].push(P(0, 0)), stk[1].push(P(0, -1));
	
	ll id = 0;
	rep(i, 1, n+1){
		while(stk[i%2].top().fi > d[i]){
			ll l = stk[i%2].top().se, r = i, h = stk[i%2].top().fi;
			stk[i%2].pop();
			if((h-d[i])%2 == 0) continue;
			id++;
			avec[l].pb(P(r, id)), bvec[r].pb(P(l, id));
			//outl(l, r);
		}
		if(d[i] == 0) stk[i%2].pop(), stk[i%2].push(P(0, i));
		else if(stk[i%2].top().fi < d[i]) stk[i%2].push(P(d[i], stk[i%2].top().se+2)); 
	}
	
	stack<ll> Stk;
	rep(i, 1, n+1){
		sort(rall(avec[i])), sort(rall(bvec[i]));
		for(auto p : bvec[i]){
			if(sz(Stk) == 0 || Stk.top() != p.se){
				outl("No");
				return 0;
			}
			Stk.pop();//, outl("-", p.se);
		}
		for(auto p : avec[i]) Stk.push(p.se);//, outl("+", p.se);
	}
	outl("Yes");
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード