結果
問題 | No.2581 [Cherry Anniversary 3] 28輪の桜のブーケ |
ユーザー |
|
提出日時 | 2023-12-28 18:11:12 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 370 ms / 3,000 ms |
コード長 | 4,605 bytes |
コンパイル時間 | 4,693 ms |
コンパイル使用メモリ | 262,804 KB |
最終ジャッジ日時 | 2025-02-18 14:54:20 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using ld=long double; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<long double>; using vectp=vector<tp>; using vectpll=vector<tpll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;} template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr int inf=numeric_limits<int>::max() / 2; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int m;cin>>m; modint::set_mod(m); int n = 28, hn = n / 2; vecll a(n), b(n); rep(i, n) cin>>a[i]; rep(i, n) cin>>b[i]; vector<map<int, ll>> mpa(hn + 1), mpb(hn + 1); rep(i, 1 << hn){ int cnt = __builtin_popcount(i); modint s = 0; rep(j, hn){ if(i >> j & 1) s += a[j]; else s += b[j]; } mpa[cnt][s.val()]++; } rep(i, 1 << hn){ int cnt = __builtin_popcount(i); modint s = 0; rep(j, hn){ if(i >> j & 1) s += a[j + hn]; else s += b[j + hn]; } mpb[cnt][s.val()]++; } rep(i, hn + 1){ ll s = 0; map<int, ll> nmp; for(auto& [l, r] : mpb[i]){ s += r; nmp[l] = s; } swap(mpb[i], nmp); } int q;cin>>q; while(q--){ int k, x;cin>>k>>x; ll ans = 0; rep(i, min(hn, k) + 1){ for(auto& [l, r] : mpa[i]) if(k - i <= hn && mpb[k - i].size()){ if(l <= x){ auto it = mpb[k - i].lower_bound(x - l); auto it2 = mpb[k - i].lower_bound(m - l); if(it2 == mpb[k - i].begin() || it == it2) continue; it2--; ll s = 0; if(it != mpb[k - i].begin()){ it--; s = it->se; } ans += r * (it2->se - s); }else{ auto it = mpb[k - i].lower_bound(m - l); auto it2 = mpb[k - i].lower_bound(m - l + x); if(it != mpb[k - i].begin()){ it--; if(it == it2){ ans += r * mpb[k - i].rbegin()->se; continue; } ans += r * it->se; } ll s = 0; if(it2 != mpb[k - i].begin()){ it2--; s = it2->se; } ans += r * (mpb[k - i].rbegin()->se - s); } } } cout<<ans<<endl; } }