結果
問題 | No.868 ハイパー部分和問題 |
ユーザー |
![]() |
提出日時 | 2019-08-16 23:27:04 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 1,958 ms / 7,000 ms |
コード長 | 2,876 bytes |
コンパイル時間 | 1,679 ms |
コンパイル使用メモリ | 166,852 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-24 07:10:41 |
合計ジャッジ時間 | 29,677 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
#include <bits/stdc++.h>#define ADD(a, b) a = (a + ll(b)) % mod#define MUL(a, b) a = (a * ll(b)) % mod#define MAX(a, b) a = max(a, b)#define MIN(a, b) a = min(a, b)#define rep(i, a, b) for(int i = int(a); i < int(b); i++)#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)#define all(a) (a).begin(), (a).end()#define sz(v) (int)(v).size()#define pb push_back#define sec second#define fst first#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)using namespace std;typedef long long ll;typedef unsigned long long ull;typedef pair<int, int> pi;typedef pair<ll, ll> pl;typedef pair<int, pi> ppi;typedef vector<int> vi;typedef vector<ll> vl;typedef vector<vl> mat;typedef complex<double> comp;void Debug() {cerr << '\n'; }template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){cerr<<arg<<" ";Debug(rest...);}template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){out<<"("<<v.first<<", "<<v.second<<")";return out;}const int MAX_N = 500010;const int MAX_V = 100010;const double eps = 1e-6;const ll mod = 1000000007;const int inf = 1 << 30;const ll linf = 1LL << 60;const double PI = 3.14159265358979323846;mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)///////////////////////////////////////////////////////////////////////////////////////////////////int N, K, Q;int SB = 122;int A[15010];int X[15010], V[15010];bool used[15010];void get(bitset<15010>& b, int a) {b = b | (b << a);}void solve() {cin >> N >> K;rep(i, 0, N) cin >> A[i];cin >> Q;rep(i, 0, Q) {cin >> X[i] >> V[i]; X[i]--;}int d = (Q + SB - 1) / SB;rep(q, 0, d) {int lv = q * SB, rv = min((q + 1) * SB, Q);// debug(q);memset(used, 0, sizeof(used));vi vx;rep(i, lv, rv) {used[X[i]] = true;vx.pb(X[i]);}sort(all(vx));vx.erase(unique(all(vx)), vx.end());bitset<15010> bit;bit[0] = 1;rep(i, 0, N) {if(used[i]) continue;get(bit, A[i]);}rep(i, lv, rv) {A[X[i]] = V[i];auto tmp = bit;rep(j, 0, sz(vx)) {get(tmp, A[vx[j]]);}if(tmp[K]) cout << 1 << "\n";else cout << 0 << "\n";}}}uint32_t rd() {uint32_t res;#ifdef __MINGW32__asm volatile("rdrand %0" :"=a"(res) ::"cc");#elseres = std::random_device()();#endifreturn res;}int main() {#ifndef LOCALios::sync_with_stdio(false);cin.tie(0);#endifcout << fixed;cout.precision(20);cerr << fixed;cerr.precision(6);rng.seed(rd());#ifdef LOCAL//freopen("in.txt", "wt", stdout); //for testerif(!freopen("in.txt", "rt", stdin)) return 1;#endifsolve();cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";return 0;}