結果

問題 No.2240 WAC
ユーザー mikammikam
提出日時 2023-03-10 21:54:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 89 ms / 2,000 ms
コード長 4,009 bytes
コンパイル時間 4,765 ms
コンパイル使用メモリ 273,876 KB
実行使用メモリ 18,596 KB
最終ジャッジ日時 2023-10-18 07:39:19
合計ジャッジ時間 7,291 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 87 ms
18,596 KB
testcase_11 AC 89 ms
18,596 KB
testcase_12 AC 82 ms
18,596 KB
testcase_13 AC 21 ms
8,672 KB
testcase_14 AC 9 ms
5,704 KB
testcase_15 AC 42 ms
15,324 KB
testcase_16 AC 72 ms
16,372 KB
testcase_17 AC 32 ms
10,732 KB
testcase_18 AC 19 ms
6,248 KB
testcase_19 AC 22 ms
6,776 KB
testcase_20 AC 45 ms
15,856 KB
testcase_21 AC 35 ms
9,224 KB
testcase_22 AC 27 ms
9,740 KB
testcase_23 AC 20 ms
8,680 KB
testcase_24 AC 40 ms
12,248 KB
testcase_25 AC 57 ms
11,524 KB
testcase_26 AC 17 ms
7,236 KB
testcase_27 AC 11 ms
6,264 KB
testcase_28 AC 18 ms
7,700 KB
testcase_29 AC 7 ms
5,188 KB
testcase_30 AC 27 ms
9,764 KB
testcase_31 AC 54 ms
17,344 KB
testcase_32 AC 17 ms
6,076 KB
testcase_33 AC 30 ms
10,180 KB
testcase_34 AC 36 ms
11,480 KB
testcase_35 AC 6 ms
4,884 KB
testcase_36 AC 63 ms
15,304 KB
testcase_37 AC 50 ms
16,580 KB
testcase_38 AC 18 ms
7,788 KB
testcase_39 AC 56 ms
17,676 KB
testcase_40 AC 27 ms
9,776 KB
testcase_41 AC 36 ms
11,696 KB
testcase_42 AC 35 ms
11,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
template<class T> void print(T& a){cout <<a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout<< a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
void yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;}
void YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m);
    STR(s);
    set<int> A;
    rep(i,s.size())if(s[i]=='A')A.insert(i);
    priority_queue_greater<P> pq;
    rep(i,s.size()){
        if(s[i]=='C'){
            pq.push({i,0});
        }
        else if(s[i]=='W'){
            pq.push({s.size()-i-1,1});
        }
    }
    while(pq.size()){
        auto [i,v] = pq.top();pq.pop();
        if(v){
            i -= s.size()-1;
            i *= -1;
            auto it = prev(A.end());
            if(*it<i){
                print("No");
                exit(0);
            }
            A.erase(it);
        }
        else{
            auto it = A.begin();
            if(*it>i){
                print("No");
                exit(0);
            }
            A.erase(it);
        }
    }
    print("Yes");
    return 0;
}
0