結果

問題 No.2401 Dirty Shoes and Stairs
ユーザー eQeeQe
提出日時 2023-08-04 21:33:04
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,681 bytes
コンパイル時間 5,556 ms
コンパイル使用メモリ 321,528 KB
実行使用メモリ 17,496 KB
最終ジャッジ日時 2024-10-14 19:31:47
合計ジャッジ時間 6,999 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 2 ms
5,248 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 1 ms
5,248 KB
testcase_29 WA -
testcase_30 AC 2 ms
5,248 KB
testcase_31 WA -
testcase_32 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
template<typename V>struct ve;
using ml=modint;using m1=ve<ml>;
auto&operator>>(std::istream&i,ml&x){long long t;i>>t;x=t;return i;}
auto&operator<<(std::ostream&o,const ml&x){return o<<x.val();}
#define ep(...) emplace(__VA_ARGS__)
#define eb(...) emplace_back(__VA_ARGS__)
#define all(a) begin(a),end(a)
#define wh(...) while(__VA_ARGS__)
#define ef(...) else if(__VA_ARGS__)
#define done(...) rr pp(__VA_ARGS__)
#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define ST(...) RD(str,__VA_ARGS__)
#define UL(n,...) u1 __VA_ARGS__;setsize({n},__VA_ARGS__);li(__VA_ARGS__)
#define UV(n,...) u1 __VA_ARGS__;setsize({n},__VA_ARGS__);vi(__VA_ARGS__)
#define U2(n,m,...) u2 __VA_ARGS__;setsize({n,m},__VA_ARGS__);li(__VA_ARGS__)
#define VE(a,...) au a=vec(__VA_ARGS__)
#define FE(v,e,...) for(au&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):v)
#define FO(n) for(ll jo(i,__LINE__)=n;jo(i,__LINE__)-->0;)
#define FOR(i,...) for(au[i,i##O,i##E]=rng(0,__VA_ARGS__);i<i##O;i+=i##E)
#define fe(v,...) FE(v,__VA_ARGS__)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define of(i,...) for(au[i##O,i,i##E]=rng(1,__VA_ARGS__);i>=i##O;i-=i##E)
#define fs(i,...) for(ll i##E=__VA_ARGS__,i=i##E;i;--i&=i##E)
#define debug(...) pp(#__VA_ARGS__,__VA_ARGS__)
#define JO(a,b) a##b
#define jo(a,b) JO(a,b)
#define I(...) template<__VA_ARGS__>
#define J typename
#define O operator
#define au auto
#define cs const
#define ifc if constexpr
#define rr return
#define uu using
uu std::cin,std::cout,std::begin,std::end,std::rbegin,std::get;
uu std::swap,std::move,std::gcd,std::lcm,std::abs,std::prev,std::next;
uu std::deque,std::tuple,std::array,std::bitset,std::minmax;
uu vo=void;uu bo=bool;
vo solve();
I(J A,J B)constexpr bo same=std::is_same_v<A,B>;
I(bo b,J A,J B)uu ift=std::conditional_t<b,A,B>;
uu is=std::istream;uu os=std::ostream;
uu dd=long double;uu ll=long long;uu ull=unsigned long long;
uu lll=__int128_t;uu ulll=__uint128_t;uu str=std::string;
dd ee=1e-12,pi=acosl(-1);
ll oo=3e18,i998244353=998244353,i1000000007=1000000007;
array<ll,8>dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};
char sp=32,nl=10;
I(J T,J U=T)uu map=std::map<T,U>;
I(J T,J U=T)uu umap=std::unordered_map<T,U>;
I(J T)uu qmax=std::priority_queue<T>;
I(J T)uu qmin=std::priority_queue<T,std::vector<T>,std::greater<>>;
I(J T,ll n)au TP(){ifc(n)rr tuple_cat(tuple(T()),TP<T,n-1>());else rr tuple();}
I(J T,ll n)uu tp=decltype(TP<T,n>());I(ll n)uu tpl=tp<ll,n>;
au rng(bo s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,a=0;rr tuple{a,b-s,c};}

I(J T)T zz(T x){rr x<0?-x:x;}
I(J T)ll len(cs T&a){rr a.size();}

struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};

I(J A,J B=A)struct cp{
  A a={};B b={};
  cp(){}
  cp(A a,B b):a(a),b(b){}
  cp(std::pair<A,B>p):a(p.first),b(p.second){}
  cp O-()cs{rr cp(-a,-b);}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}
  bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}
  bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}
  bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}

  I(J T)cp&O+=(cs T&x){a+=x,b+=x;rr*this;}I(J T)cp O+(cs T&x)cs{rr cp{*this}+=x;}
  I(J T)cp&O-=(cs T&x){a-=x;b-=x;rr*this;}I(J T)cp O-(cs T&x)cs{rr cp{*this}-=x;}
  I(J T)cp&O*=(cs T&x){a*=x;b*=x;rr*this;}I(J T)cp O*(cs T&x)cs{rr cp{*this}*=x;}
  au abs()cs{rr zz(a)+zz(b);}au abs(cs cp&c)cs{rr(*this-c).abs();}
};uu cl=cp<ll>;
I(J A,J B=A,J C=A)struct tr{
  A a={};B b={};C c={};
  tr(){}
  tr(A a,B b,C c):a(a),b(b),c(c){}
  bo O==(cs tr&t)cs{rr a==t.a&&b==t.b&&c==t.c;}
  bo O<(cs tr&t)cs{rr a!=t.a?a<t.a:b!=t.b?b<t.b:c<t.c;}
  bo O>(cs tr&t)cs{rr a!=t.a?a>t.a:b!=t.b?b>t.b:c>t.c;}

};uu tl=tr<ll>;

I(J V)struct ve;
I(J V)constexpr bo isv=0;
I(J V)constexpr bo isv<ve<V>> =1;
I(J V)constexpr bo isv<std::vector<V>> =1;
I(J V)au raw_val(V){ifc(isv<V>)rr raw_val(V(1)[0]);else rr V();}

I(J V)struct ve:std::vector<V>{
  uu std::vector<V>::vector;
  uu raw_type=decltype(raw_val(V()));
  I(J U)ve(cs std::vector<U>&v={}){fe(v,e)this->eb(e);}

  au&O+=(cs ve&u){au&v=*this;fo(i,len(v))v[i]+=u[i];rr v;}
  au&O-=(cs ve&u){au&v=*this;fo(i,len(v))v[i]-=u[i];rr v;}
  au&O^=(cs ve&u){fe(u,e)this->eb(e);rr*this;}
  au&O+=(cs raw_type&c){au&v=*this;fe(v,e)e+=c;rr v;}
  au&O-=(cs raw_type&c){au&v=*this;fe(v,e)e-=c;rr v;}
  au&O*=(cs raw_type&c){au&v=*this;fe(v,e)e*=c;rr v;}
  I(size_t n)au&O+=(cs bitset<n>&a){fo(i,len(*this))(*this)[i]+=a[i];rr*this;}
  I(size_t n)au&O-=(cs bitset<n>&a){fo(i,len(*this))(*this)[i]-=a[i];rr*this;}

  au O+(cs ve&u){rr ve(*this)+=u;}
  au O-(cs ve&u){rr ve(*this)-=u;}
  au O^(cs ve&u){rr ve(*this)^=u;}
  au O+(cs raw_type&c){rr ve(*this)+=c;}au&O++(){rr*this+=1;}
  au O-(cs raw_type&c){rr ve(*this)-=c;}au&O--(){rr*this-=1;}
  au O*(cs raw_type&c){rr ve(*this)*=c;}au O-(){rr ve(*this)*=-1;}

  vo af(V e={}){this->ep(begin(*this),e);}

  I(bo f(raw_type&,cs raw_type&))au scan(){
    cp<raw_type,bo>r;
    fe(*this,e)ifc(!isv<V>)r.b?f(r.a,e),r:r={e,1};ef(au t=e.template scan<f>();t.b)r.b?f(r.a,t.a),r:r=t;rr r;
  }
  au zeta(){ve v=*this;ifc(isv<V>)fe(v,e)e=e.zeta();fo(i,len(v)-1)v[i+1]+=v[i];rr v;}

  au de(cs str&b="a"){
    ift<isv<V>,ve<str>,str>r;
    ifc(isv<V>)fe(*this,e)r.eb(e.de(b));
    else fe(*this,e)r+=len(b)==1?e+b[0]:0<=e&&e<len(b)?b[e]:'|';
    rr r;
  }
};
I(J T=ll,ll n,ll i=0)au vec(cs ll(&s)[n],T x={}){ifc(n==i+1)rr ve<T>(s[i],x);else{au X=vec<T,n,i+1>(s,x);rr ve<decltype(X)>(s[i],X);}}
I(ll n,J...A)vo setsize(cs ll(&l)[n],A&...a){((a=vec(l,raw_val(a))),...);}
I(J T)uu V1=ve<T>;uu u1=V1<ll>;I(J T)uu V2=V1<V1<T>>;uu u2=V2<ll>;
uu strs=V1<str>;uu gra=V2<edg>;uu cls=V1<cl>;uu tls=V1<tl>;

I(J T)decltype(au)rb(T&a){rr*rbegin(a);}
I(J T)au pot(T&a){au r=a.top();a.pop();rr r;}

struct io{io(){cin.tie(0)->sync_with_stdio(0);
  cout<<std::fixed<<std::setprecision(15);std::cerr<<nl;}}io;
os&O<<(os&o,cs ulll&x){rr(x<10?o:o<<x/10)<<ll(x%10);}
os&O<<(os&o,cs lll&x){rr o<<str(x<0,'-')<<ulll(zz(x));}
os&O<<(os&o,cs edg&e){rr o<<e.t<<sp<<e.w;}
I(J T)os&O<<(os&o,cs deque<T>&q){fe(q,e)o<<e<<sp;rr o;}
I(J T)os&O<<(os&o,qmax<T>q){wh(len(q))o<<pot(q)<<sp;rr o;}
I(J T)os&O<<(os&o,qmin<T>q){wh(len(q))o<<pot(q)<<sp;rr o;}
I(size_t n)os&O<<(os&o,cs bitset<n>&b){fo(i,n)o<<b[i];rr o;}
I(J T,J U)os&O<<(os&o,cs cp<T,U>&c){rr o<<c.a<<sp<<c.b;}
I(J T,J U)os&O<<(os&o,cs map<T,U>&m){fe(m,e)o<<cp(e)<<nl;rr o;}
I(J T,J U,J V)os&O<<(os&o,cs tr<T,U,V>&t){rr o<<t.a<<sp<<t.b<<sp<<t.c;}
I(J...A)os&O<<(os&o,cs tuple<A...>&t){
  apply([&](cs au&...a){ll i=0;(((o<<a<<str(++i!=sizeof...(a),sp))),...);},t);rr o;}
I(J V)os&O<<(os&o,cs std::vector<V>&v){fe(v,e)o<<e<<str(&e!=&rb(v),isv<V>?nl:sp);rr o;}
I(J...A)vo pp(cs A&...a){ll i=0;((cout<<a<<str(++i!=sizeof...(a),sp)),...);cout<<nl;}
I(J T,J U)is&O>>(is&i,cp<T,U>&c){rr i>>c.a>>c.b;}
I(J T,J U,J V)is&O>>(is&i,tr<T,U,V>&t){rr i>>t.a>>t.b>>t.c;}
I(J V)is&O>>(is&i,std::vector<V>&v){fe(v,e)i>>e;rr i;}
I(J...A)vo li(A&...a){(cin>>...>>a);}
I(J...A)vo vi(A&...a){fo(i,(len(a)&...))(cin>>...>>a[i]);}

I(J T)struct set:std::set<T>{
  set(cs V1<T>&a={}){fe(a,e)this->ep(e);}

  friend os&O<<(os&o,cs set&s){fe(s,e)o<<e<<str(&e!=&rb(s),sp);rr o;}
};

I(J T)struct mset:std::multiset<T>{
  mset(cs V1<T>&a={}){fe(a,e)this->ep(e);}

  friend os&O<<(os&o,cs mset&s){fe(s,e)o<<e<<str(&e!=&rb(s),sp);rr o;}
};

I(J T)struct uset:std::unordered_set<T>{
  uset(cs V1<T>&a={}){fe(a,e)this->ep(e);}
  friend os&O<<(os&o,cs uset&s){fe(s,e)o<<e<<str(&e!=&rb(s),sp);rr o;}
};

int main(){ll T=1;fo(T)solve();}
vo solve(){
  LL(N);
  LL(M1);
  UL(M1,a);
  LL(M2);
  UL(M2,b);
  a.af(),b.af();
  pp(N+1-len(set<ll>(a.zeta()^b.zeta())));
}
0