結果
問題 |
No.2359 A in S ?
|
ユーザー |
|
提出日時 | 2025-07-16 18:04:19 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,480 bytes |
コンパイル時間 | 2,940 ms |
コンパイル使用メモリ | 289,148 KB |
実行使用メモリ | 255,852 KB |
最終ジャッジ日時 | 2025-07-16 18:04:30 |
合計ジャッジ時間 | 9,736 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 1 |
other | AC * 3 WA * 15 |
ソースコード
#include<bits/stdc++.h> #if __has_include(<atcoder/all>) #include<atcoder/modint> #endif using namespace std; #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define RDVV(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);vin(__VA_ARGS__) #define VV(n,...) RDVV(ll,n,__VA_ARGS__) #define FO(n) for(ll IJK=n;IJK-->0;) #define fo(i,...) for(auto[i,i##stop,i##step]=for_range(0,__VA_ARGS__);i<i##stop;i+=i##step) #define of(i,...) for(auto[i,i##stop,i##step]=for_range(1,__VA_ARGS__);i>=i##stop;i+=i##step) #define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a) #define bit_sizeof(T) ll(sizeof(T)*CHAR_BIT) #define defpp void pp(const auto&...a){const char*c="";((cout<<c<<a,c=" "),...);cout<<'\n';} #define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{ namespace my{ void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);} using ll=long long; using ui32=uint32_t; using ui64=uint64_t; constexpr auto refs(auto&...a){return array{ref(a)...};} constexpr auto for_range(ll s,ll b){ll a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};} constexpr auto for_range(ll s,ll a,ll b,ll c=1){return array{a-s,b,(1-s*2)*c};} void lin(auto&...a){(cin>>...>>a);} void vin(auto&...a){fo(i,(a.size()&...))(cin>>...>>a[i]);} auto ceil(auto x,auto y){if(y<0)x=-x,y=-y;return x<=0?x/y:(x-1)/y+1;} auto lower_bound_modulo(auto k,auto r,auto m){return ceil(k-r,m)*m+r;} constexpr ui64 kth_root_floor(ui64 a,ll k){ if (k==1)return a; auto within=[&](ui32 x){ui64 t=1;FO(k)if(__builtin_mul_overflow(t,x,&t))return false;return t<=a;}; ui64 r=0; of(i,bit_sizeof(ui32))if(within(r|(1u<<i)))r|=1u<<i; return r; } constexpr auto sqrt_floor(auto x){return kth_root_floor(x,2);} template<class A,class B=A>struct pair{ A a;B b; pair()=default; pair(A aa,B bb):a(aa),b(bb){} auto operator<=>(const pair&)const=default; }; template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>; } namespace my{ template<class V>concept vectorial=is_base_of_v<vector<typename remove_cvref_t<V>::value_type>,remove_cvref_t<V>>; template<class V>constexpr int depth=0; template<vectorial V>constexpr int depth<V> =depth<typename V::value_type>+1; template<class T>struct core_t_helper{using type=T;}; template<vectorial V>struct core_t_helper<V>{using type=typename core_t_helper<typename V::value_type>::type;}; template<class T>using core_t=core_t_helper<T>::type; template<class V>struct vec; template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;}; template<class T>struct hvec_helper<0,T>{using type=T;}; template<int D,class T>using hvec=hvec_helper<D,T>::type; template<class V>struct vec:vector<V>{ static constexpr int D=depth<vec<V>>; using C=core_t<V>; using vector<V>::vector; vec(const auto&...a)requires(sizeof...(a)>=3){resizes(a...);} void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else*this=make(a...);} static auto make(ll n,const auto&...a){ if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]); else return vec<decltype(make(a...))>(n,make(a...)); } auto&operator+=(const vec&u){vec&v=*this;assert(v.size()==u.size());fo(i,v.size())v[i]+=u[i];return v;} vec&operator++(){fe(*this,e)++e;return*this;} ll size()const{return vector<V>::size();} auto fold(const auto&f)const{ pair<C,bool>r{}; fe(*this,e){ if constexpr(!vectorial<V>){ if(r.b)f(r.a,e); else r={e,1}; }else { } } return r; } auto max()const{return fold([](auto&a,auto b){if(a<b)a=b;}).a;} auto&segment_imos_residue(ll a,ll b,ll r,ll m,C x){ a=lower_bound_modulo(a,r,m); b=lower_bound_modulo(a,r,m); if(a<size())(*this)[a]+=x; if(b<size())(*this)[b]-=x; return*this; } vec zeta_residue(ll m)const{vec v=*this;fo(i,m,size())v[i]+=v[i-m];return v;} }; template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>; } namespace my{entry void main(){ LL(N,Q); VV(N,L,R,X,Y);++R; ll T=sqrt_floor(N); vec cnt(T,R.max(),0LL); vec<ll>res(R.max()); fo(i,N){ L[i]=lower_bound_modulo(L[i],Y[i],X[i]); R[i]=lower_bound_modulo(R[i],Y[i],X[i]); if(X[i]<T){ cnt[X[i]].segment_imos_residue(L[i],R[i],Y[i],X[i],1); }else{ fo(j,L[i],R[i],X[i])res[j]++; } } fo(x,T)res+=cnt[x].zeta_residue(x); FO(Q){ LL(i); pp(i<res.size()?res[i]:0); } }}