結果
問題 | No.2343 (l+r)/2 |
ユーザー |
|
提出日時 | 2023-06-09 22:05:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,302 bytes |
コンパイル時間 | 1,851 ms |
コンパイル使用メモリ | 200,308 KB |
最終ジャッジ日時 | 2025-02-13 23:56:32 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 6 WA * 8 |
ソースコード
/*** author: otera**/#include<bits/stdc++.h>namespace otera{template <typename Container>class run_length {public:using content_type = typename Container::value_type;using value_type = std::pair<content_type, long long>;run_length(const Container &c) noexcept {_compressed = compress(c);}void clear() {_compressed.clear();}int size() const noexcept {return (int)_compressed.size();}const value_type &operator[](int compressed_index) const {return _compressed[compressed_index];}auto begin() const noexcept { return _compressed.begin(); }auto end() const noexcept { return _compressed.end(); }auto rbegin() const noexcept { return _compressed.rbegin(); }auto rend() const noexcept { return _compressed.rend(); }auto back() const noexcept { return _compressed.back(); }auto front() const noexcept { return _compressed.front(); }void push_back(const content_type &val, const long long cnt = 1) {if (_compressed.size() and _compressed.back().first == val) {_compressed.back().second += cnt;} else {_compressed.emplace_back(val, cnt);}}void pop_back(long long cnt = 1) {while(_compressed.size() and cnt > 0) {if(cnt < _compressed.back().second) {_compressed.back().second -= cnt;cnt = 0;} else {cnt -= _compressed.back().second;_compressed.pop_back();}}}static std::vector<value_type> compress(const Container &c) {std::vector<value_type> res;for(auto ite_l = c.begin(), ite_r = c.begin(); ite_l != c.end(); ite_l = ite_r) {while (ite_r != c.end() and *ite_l == *ite_r) ++ite_r;res.emplace_back(*ite_l, ite_r - ite_l);}return res;}private:std::vector<value_type> _compressed;};} // namespace oteranamespace otera {}using namespace std;using namespace otera;struct io_setup {io_setup(int precision = 20) {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(precision);}} io_setup_ {};#define int long longusing ll = long long;using ld = long double;using ull = unsigned long long;using i128 = __int128_t;using u128 = __uint128_t;#define repa(i, n) for(int i = 0; i < (n); ++ i)#define repb(i, a, b) for(int i = (a); i < (b); ++ i)#define repc(i, a, b, c) for(int i = (a); i < (b); i += (c))#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)#define rep1a(i, n) for(int i = 0; i <= (n); ++ i)#define rep1b(i, a, b) for(int i = (a); i <= (b); ++ i)#define rep1c(i, a, b, c) for(int i = (a); i <= (b); i += (c))#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)#define rev_repa(i, n) for(int i=(n)-1;i>=0;i--)#define rev_repb(i, a, b) assert((a) > (b));for(int i=(a);i>(b);i--)#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)#define rev_rep1a(i, n) for(int i=(n);i>=1;i--)#define rev_rep1b(i, a, b) assert((a) >= (b));for(int i=(a);i>=(b);i--)#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)#define for_subset(t, s) for(ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))typedef pair<int, int> P;typedef pair<ll, ll> LP;#define pb push_back#define pf push_front#define ppb pop_back#define ppf pop_front#define eb emplace_back#define mkp make_pair#define mkt make_tuple#define fr first#define sc second#define all(c) std::begin(c), std::end(c)#define rall(c) std::rbegin(c), std::rend(c)#define lb(c, x) distance(std::begin(c), lower_bound(all(c), (x)))#define ub(c, x) distance(std::begin(c), upper_bound(all(c), (x)))#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));(a).erase(unique(all(a)),std::end(a))#define si(c) (int)(c).size()inline ll popcnt(ull a){ return __builtin_popcountll(a); }#define kth_bit(x, k) ((x>>k)&1)#define unless(A) if(!(A))#define elif else ifll modulo(ll n, ll d){ return (n % d + d) % d; };ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template <class T, class U> using umap = unordered_map<T, U>;template<class T> void scan(T& a){ cin >> a; }template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ cout << ' '; }template<class T> void print(const T& a){ cout << a; }template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }int out(){ cout << '\n'; return 0; }template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x#define debug_1(x1) cout<<#x1<<": "<<x1<<endl#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl#ifdef DEBUG#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...)#define dump(...)#endifvoid solve() {INT(n);VEC(int, a, n);if(n >= 9) {out("Yes");return;}vector dp(n + 1, vc<int>(3, 0));dp[0][1] = 1;rep(i, n) {rep(f, 3) {if(!dp[i][f]) continue;int nf = f + (a[i] == 0 ? 1 : -1);if(nf >= 0 and nf < 3) {dp[i + 1][nf] = 1;}if(i - 1 >= 0 and a[i - 1] == a[i]) {dp[i + 1][f] = 1;}}}if(dp[n][1]) out("Yes");else out("No");}signed main() {int testcase = 1;in(testcase);while(testcase--) solve();return 0;}