結果

問題 No.2836 Comment Out
ユーザー 👑 binapbinap
提出日時 2024-08-09 21:46:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,820 bytes
コンパイル時間 4,393 ms
コンパイル使用メモリ 262,296 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-08-09 21:46:09
合計ジャッジ時間 7,725 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 32 ms
6,940 KB
testcase_08 AC 32 ms
6,944 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 75 ms
6,940 KB
testcase_15 AC 84 ms
6,940 KB
testcase_16 AC 77 ms
6,944 KB
testcase_17 WA -
testcase_18 AC 77 ms
6,940 KB
testcase_19 WA -
testcase_20 AC 77 ms
6,944 KB
testcase_21 AC 74 ms
6,940 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 38 ms
6,940 KB
testcase_25 AC 51 ms
6,944 KB
testcase_26 AC 21 ms
6,944 KB
testcase_27 AC 57 ms
6,944 KB
testcase_28 WA -
testcase_29 AC 51 ms
6,940 KB
testcase_30 AC 31 ms
6,944 KB
testcase_31 AC 49 ms
6,940 KB
testcase_32 WA -
testcase_33 AC 33 ms
6,944 KB
testcase_34 AC 22 ms
6,944 KB
testcase_35 AC 64 ms
6,944 KB
testcase_36 WA -
testcase_37 AC 62 ms
6,944 KB
testcase_38 AC 43 ms
6,944 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 AC 52 ms
6,944 KB
testcase_42 WA -
testcase_43 AC 15 ms
6,948 KB
testcase_44 AC 2 ms
6,944 KB
testcase_45 WA -
testcase_46 AC 2 ms
6,944 KB
testcase_47 WA -
testcase_48 WA -
testcase_49 AC 1 ms
6,940 KB
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 AC 1 ms
6,944 KB
testcase_55 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

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

int main(){
	int n;
	cin >> n;
	vector<int> a = {0};
	rep(i, n){
		int x;
		cin >> x;
		a.push_back(x);
	}
	a.push_back(0);
	n += 2;
	vector<int> plus;
	vector<int> minus;
	rep(i, n - 1){
		int d = a[i + 1] - a[i];
		if(d > 0){
			rep(j, d){
				plus.push_back(i);
				if(int(plus.size()) > n){
					cout << "No\n";
					return 0;
				}
			}
		}
		if(d < 0){
			rep(j, -d){
				minus.push_back(i);
				if(int(minus.size()) > n){
					cout << "No\n";
					return 0;
				}
			}
		}
	}
	int m = plus.size();
	int l_prev = -1;
	int r_prev = -1;
	rep(i, m){
		int l = plus[i];
		int r = minus[i];
		if(l == l_prev and r == r_prev){
			cout << "No\n";
			return 0;
		}
	}
	cout << "Yes\n";
	return 0;
}
0