結果

問題 No.2046 Ans Mod? Mod Ans!
ユーザー eQe
提出日時 2025-01-26 22:20:24
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,968 bytes
コンパイル時間 7,603 ms
コンパイル使用メモリ 331,968 KB
実行使用メモリ 29,980 KB
最終ジャッジ日時 2025-01-26 22:20:35
合計ジャッジ時間 10,316 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 3
other WA * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
namespace my{
#define eb emplace_back
#define done(...) return pp(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define FO(n) for(ll ij=n;ij-->0;)
#define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a)
#define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto range(bool s,auto...a){array<ll,3>r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;if(s)r[2]*=-1;return r;}
constexpr char newline=10;
constexpr char space=32;
constexpr auto Yes(bool y=1){return y?"Yes":"No";}
constexpr auto No(){return Yes(0);}
auto ceil(auto x,auto y){if(y<0)x=-x,y=-y;return x<=0?x/y:(x-1)/y+1;}
auto max(auto...a){return max(initializer_list<common_type_t<decltype(a)...>>{a...});}

template<class A,class B>struct pair{
  A a;B b;
  pair()=default;
  pair(A a,B b):a(a),b(b){}
  pair(const std::pair<A,B>&p):a(p.first),b(p.second){}
  auto operator<=>(const pair&)const=default;
  pair operator+(const pair&p)const{return{a+p.a,b+p.b};}
  friend istream&operator>>(istream&i,pair&p){return i>>p.a>>p.b;}
  friend ostream&operator<<(ostream&o,const pair&p){return o<<p.a<<space<<p.b;}
};

template<class F=less<>>auto&sort(auto&a,F f={}){ranges::sort(a,f);return a;}

template<ll k>auto pack_kth(const auto&...a){return get<k>(make_tuple(a...));}
template<class T,ll n>auto pack_slice(const auto&...a){return[&]<size_t...I>(index_sequence<I...>){return array<T,n>{get<I>(forward_as_tuple(a...))...};}(make_index_sequence<n>{});}

template<class V>concept vectorial=is_base_of_v<vector<typename V::value_type>,V>;
template<class T>struct vec_attr{using core_type=T;static constexpr int rank=0;};
template<vectorial V>struct vec_attr<V>{using core_type=typename vec_attr<typename V::value_type>::core_type;static constexpr int rank=vec_attr<typename V::value_type>::rank+1;};
template<class T>using core_t=vec_attr<T>::core_type;
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>ostream&operator<<(ostream&o,const vector<V>&v){fe(v,e)o<<e<<string(&e!=&v.back(),vectorial<V>?newline:space);return o;}

template<class V>struct vec:vector<V>{
  using vector<V>::vector;
  vec(const vector<V>&v){vector<V>::operator=(v);}

  template<class...A>requires(sizeof...(A)>=3)vec(A...a){const ll n=sizeof...(a)-1;auto t=pack_slice<ll,n>(a...);ll s[n];fo(i,n)s[i]=t[i];*this=make_vec(s,pack_kth<n>(a...));}
  template<class T,ll n,ll i=0>static auto make_vec(const ll(&s)[n],T x){if constexpr(i==n-1)return vec<T>(s[i],x);else{auto X=make_vec<T,n,i+1>(s,x);return vec<decltype(X)>(s[i],X);}}

  vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;}
  vec operator^(const vec&u)const{return vec{*this}^=u;}
  vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;}
  vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;}
  vec operator+(const vec&u)const{return vec{*this}+=u;}
  vec operator-(const vec&u)const{return vec{*this}-=u;}
  vec&operator++(){fe(*this,e)++e;return*this;}
  vec&operator--(){fe(*this,e)--e;return*this;}
  vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;}

  ll size()const{return vector<V>::size();}

  auto pop_back(){auto r=this->back();vector<V>::pop_back();return r;}

  auto scan(const auto&f)const{pair<core_t<V>,bool>r{};fe(*this,e)if constexpr(!vectorial<V>)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;}
  auto max()const{return scan([](auto&a,const auto&b){a<b?a=b:0;}).a;}

  template<class F=less<>>auto sort(F f={})const{vec v=*this;ranges::sort(v,f);return v;}
};
template<ll rank,class T>struct tensor_helper{using type=vec<typename tensor_helper<rank-1,T>::type>;};
template<class T>struct tensor_helper<0,T>{using type=T;};
template<ll rank,class T>using tensor=typename tensor_helper<rank,T>::type;
template<class...A>requires(sizeof...(A)>=2)vec(A...a)->vec<tensor<sizeof...(a)-2,remove_reference_t<decltype(get<sizeof...(a)-1>(declval<tuple<A...>>()))>>>;
vec(ll)->vec<ll>;

void lin(auto&...a){(cin>>...>>a);}
auto sinen(const string&b="a"){string s;lin(s);vec<ll>r;fe(s,e)r.eb(b.size()==1?e-b[0]:b.find_first_of(e));return r;}
auto sinen(ll n,const string&b="a"){vec<vec<ll>>r;fo(n)r.eb(sinen(b));return r;}
template<char c=space>void pp(const auto&...a){ll n=sizeof...(a);((cout<<a<<string(--n>0,c)),...);cout<<newline;}

template<class T=ll>auto iota(auto...a){array<ll,2>v{};ll I=0;((v[I++]=a),...);if(I==1)swap(v[0],v[1]);vec<T>r;fo(i,v[0],v[1])r.eb(i);return r;}
auto vsort(auto f,auto&...a){auto o=iota((a.size()&...));sort(o,f);([&](auto&e){auto c=e;fo(i,e.size())e[i]=c[o[i]];}(a),...);return o;}
template<class T,class U=T>auto rle(const vec<T>&a){vec<pair<T,U>>r;fe(a,e)r.size()&&e==r.back().a?++r.back().b:r.eb(e,1).b;return r;}

ll f(ll D,ll x){
  return max(ceil(D,x)-1,0);
}

auto trim_balanced_brackets(const vec<ll>&a){
  vec<ll>res;
  fe(a,e){
    if(e==0){
      res.eb(0);
    }else{
      if(res.size()&&res.back()==0)res.pop_back();
      else res.eb(1);
    }
  }
  return res;
}

single_testcase
void solve(){
  LL(N);
  auto s=sinen(N,"()");

  vec a(N),b(N);
  fo(i,N){
    auto v=rle(trim_balanced_brackets(s[i]));
    if(v.size()==0)continue;

    if(v.size()==2){
      a[i]=v[1].b;
      b[i]=v[0].b;
    }else{
      if(v[0].a==0)a[i]=v[0].b;
      else b[i]=v[0].b;
    }
  }

  vsort([&](ll i,ll j){
    ll f=(a[i]-b[i]>=0);
    ll g=(a[j]-b[j]>=0);
    if(f!=g)return f>g;

    if(f==1)return b[i]<b[j];
    else return a[i]>a[j];
  },a,b);

  ll cu=0;
  fo(i,N){
    if((cu-=b[i])<0)done(No());
    cu+=a[i];
  }
  pp(Yes(cu==0));
}}
0