結果
問題 |
No.3041 非対称じゃんけん
|
ユーザー |
|
提出日時 | 2025-02-28 22:08:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,284 ms / 2,200 ms |
コード長 | 7,485 bytes |
コンパイル時間 | 4,568 ms |
コンパイル使用メモリ | 270,336 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2025-02-28 22:09:07 |
合計ジャッジ時間 | 13,297 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template <typename T> long long binary_search(long long ok, long long ng, T check){ while(abs(ok - ng) > 1){ long long mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } template <typename T> long double binary_search_real(long double ok, long double ng, T check, int iter = 100){ for(int i = 0; i < iter; ++i){ long double mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } template <typename T> long long trisum(T a, T b){ long long res = ((b - a + 1) * (a + b)) / 2; return res; } template <typename T> T intpow(T x, int n){ T ret = 1; while(n > 0) { if(n & 1) (ret *= x); (x *= x); n >>= 1; } return ret; } template <typename T> T getReminder(T a, T b){ if(b == 0) return -1; if(a >= 0 && b > 0){ return a % b; } else if(a < 0 && b > 0){ return ((a % b) + b) % b; } else if(a >= 0 && b < 0){ return a % b; } else{ return (abs(b) - abs(a % b)) % b; } } template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll T; void input(){ in(T); } void solve(){ ll n, f; in(n, f); vll a(n), b(n), c(n); in(a, b, c); vll ans(n); bitset<150001> tmp1; bitset<300001> tmp2; bitset<450001> tmp3; bitset<600001> tmp4; bitset<750001> tmp5; bitset<900001> tmp6; { bitset<150001> bs, nbs; bs[0] = 1; rep(i, min(2500LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp1 = bs; } if(n >= 2500){ bitset<300001> bs, nbs; rep(i, 150001) bs[i] = tmp1[i]; rep(i, 2500, min(5000LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp2 = bs; } if(n >= 5000){ bitset<450001> bs, nbs; rep(i, 300001) bs[i] = tmp2[i]; rep(i, 5000, min(7500LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp3 = bs; } if(n >= 7500){ bitset<600001> bs, nbs; rep(i, 450001) bs[i] = tmp3[i]; rep(i, 7500, min(10000LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp4 = bs; } if(n >= 10000){ bitset<750001> bs, nbs; rep(i, 600001) bs[i] = tmp4[i]; rep(i, 10000, min(12500LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp5 = bs; } if(n >= 12500){ bitset<900001> bs, nbs; rep(i, 750001) bs[i] = tmp5[i]; rep(i, 12500, min(15000LL, n)){ nbs = bs << a[i]; nbs |= bs << b[i]; nbs |= bs << c[i]; ans[i] = nbs.count(); swap(bs, nbs); } tmp6 = bs; } vout(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); T = 1; // input(); while(T--) solve(); }