Submission #496510

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
496510	2021-12-21T11:42:07 Z	Nalrimet	Meteors (POI11_met)	C++17	100 / 100	4818 ms	65536 KB

#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb emplace_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
 
using namespace std;
typedef int ll;
typedef long long i64;
 
//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 3e5 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }
 
ll zxc = 1, n, m, q, a[N];
i64 t[4 * N];
ll x[N];
ll l[N], r[N];
ll lw[N], hg[N];
 
vector<ll> v[N], vq[N];
 
void recalc(ll v) {
    t[v] = t[left(v)] + t[right(v)];
}
 
i64 get(ll v, ll tl, ll tr, ll l, ll r) {
    if(l <= tl && tr <= r) return t[v];
    if(tr < l || r < tl) return 0;
    ll tm = (tl + tr) / 2;
    return get(left(v), tl, tm, l, r) + get(right(v), tm + 1, tr, l, r) + t[v];
}
 
void upd(ll v, ll tl, ll tr, ll ql, ll qr, ll val) {
    if (tr < ql || qr < tl) return;
    if (ql <= tl && tr <= qr) {
		t[v] += val;
        return;
    }
    int mid = (tl + tr) >> 1;
    upd(left(v), tl, mid, ql, qr, val);
    upd(right(v), mid + 1, tr, ql, qr, val);
}
 
void solve() {
 
    cin >> n >> m;
 
    for(ll i = 1; i <= m; i++) {
      	int x;
	    cin >> x;
        v[x].pb(i);
    }
 
    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
    }
 
    cin >> q;
 
    for(ll i = 1; i <= n; i++)
        lw[i] = 1, hg[i] = q + 1;
 
    for(ll i = 1; i <= q; i++) {
        cin >> l[i] >> r[i] >> x[i];
    }
 
    ll ok = 1;
    while(ok) {
        ok = 0;
//        cout << "OK\n";
 		memset(t, 0, sizeof(t));
 
 
 
        for(ll i = 1; i <= n; i++) {
            if(lw[i] != hg[i])
                vq[(lw[i] + hg[i]) / 2].pb(i);
        }
 
        for(ll i = 1; i <= q; i++) {
 
            if(l[i] <= r[i])
                upd(1, 1, m, l[i], r[i], x[i]);
 
            else upd(1, 1, m, l[i], m, x[i]), upd(1, 1, m, 1, r[i], x[i]);
 
            for (auto id : vq[i]) {
                ok = 1;
                i64 sum = 0;
                for(ll x : v[id]) {
                    sum += get(1, 1, m, x, x);
                    if (sum >= a[id]) break;
                }
                if(sum >= a[id]) hg[id] = i;
                else lw[id] = i + 1;
            }
          	vq[i].clear();
        }
    }
 
    for(ll i = 1; i <= n; i++) {
        cout << (lw[i] <= q ? to_string(lw[i]) : "NIE") << "\n";
    }
}
 
int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	23756 KB	Output is correct
2	Correct	30 ms	23852 KB	Output is correct
3	Correct	24 ms	23868 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	23756 KB	Output is correct
2	Correct	24 ms	23756 KB	Output is correct
3	Correct	25 ms	23892 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	298 ms	25056 KB	Output is correct
2	Correct	416 ms	27024 KB	Output is correct
3	Correct	418 ms	26868 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	383 ms	26220 KB	Output is correct
2	Correct	395 ms	26272 KB	Output is correct
3	Correct	388 ms	27252 KB	Output is correct
4	Correct	137 ms	25588 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	220 ms	25636 KB	Output is correct
2	Correct	309 ms	27752 KB	Output is correct
3	Correct	166 ms	24704 KB	Output is correct
4	Correct	389 ms	27120 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	349 ms	24736 KB	Output is correct
2	Correct	315 ms	26192 KB	Output is correct
3	Correct	355 ms	25100 KB	Output is correct
4	Correct	430 ms	28468 KB	Output is correct

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3683 ms	41132 KB	Output is correct
2	Correct	1218 ms	28736 KB	Output is correct
3	Correct	753 ms	26936 KB	Output is correct
4	Correct	4818 ms	60376 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3801 ms	39624 KB	Output is correct
2	Correct	1000 ms	28744 KB	Output is correct
3	Correct	620 ms	26140 KB	Output is correct
4	Correct	4453 ms	65536 KB	Output is correct

Submission #496510

Compilation message