fork download
copy 
  1. // ~~ icebear love attttttt ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebearat"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 3e5 + 5;
  38. int n, m, q, a[N], resL[N], resR[N];
  39. ll ft[N], need[N];
  40. vector<int> pos[N], query[N];
  41. int L[N], R[N];
  42. ll K[N];
  43.  
  44. void update(int x, ll val) {
  45.     for(; x <= m; x += x & -x) ft[x] += val;
  46. }
  47.  
  48. ll get(int x) {
  49.     ll ans = 0;
  50.     for(; x; x -= x & -x) ans += ft[x];
  51.     return ans;
  52. }
  53.  
  54. void init(void) {
  55.     cin >> n >> m;
  56.     FOR(i, 1, m) {
  57.         int owner;
  58.         cin >> owner;
  59.         pos[owner].pb(i);
  60.     }
  61.     FOR(i, 1, n) cin >> need[i];
  62.     cin >> q;
  63.     FOR(i, 1, n) resL[i] = 1, resR[i] = q + 1;
  64.     FOR(i, 1, q) cin >> L[i] >> R[i] >> K[i];
  65. }
  66.  
  67. void process(void) {
  68.     REP(tries, 20) {
  69.         FOR(i, 1, n) {
  70.             if (resL[i] == resR[i]) continue;
  71.             query[(resL[i] + resR[i]) >> 1].pb(i);
  72.         }
  73.  
  74.         FOR(i, 1, q) {
  75.             update(L[i], K[i]);
  76.             update(R[i] + 1, -K[i]);
  77.             if (L[i] > R[i]) update(1, K[i]);
  78.  
  79.             for(int id : query[i]) {
  80.                 ll sum = 0;
  81.                 for(int x : pos[id]) sum = min(need[id] + 1, sum + get(x));
  82.                 bool ok = (sum >= need[id]);
  83.                 if (ok) resR[id] = i;
  84.                 else resL[id] = i + 1;
  85.             }
  86.         }
  87.  
  88.         FOR(i, 1, q) query[i].clear();
  89.         FOR(i, 1, m) ft[i] = 0;
  90.     }
  91.  
  92.     FOR(i, 1, n) cout << (resR[i] == q + 1 ? -1 : resR[i]) << '\n';
  93. }
  94.  
  95. int main() {
  96.     ios_base::sync_with_stdio(0);
  97.     cin.tie(0); cout.tie(0);
  98.     if (fopen(task".inp", "r")) {
  99.         freopen(task".inp", "r", stdin);
  100.         freopen(task".out", "w", stdout);
  101.     }
  102.     int tc = 1;
  103. //    cin >> tc;
  104.     while(tc--) {
  105.         init();
  106.         process();
  107.     }
  108.     return 0;
  109. }
  110.  
  111.  
Success #stdin #stdout 0.01s 19872KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/WyU2BQ
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!