Submission #890615

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
890615	2023-12-21T16:02:40 Z	armashka	Meteors (POI11_met)	C++17	100 / 100	3872 ms	65536 KB

#include<bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;

void dgb_out() { cerr << "\n"; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << " " << H; dgb_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 5e5 + 10;
const int M = 2e7 + 5;
const int B = 316;
const ll msize = 2;
const ll mod1 = 1e9 + 7;
const ll mod2 = 998244353;
const long double Phi = acos(-1);
const long long inf = 2e9;

ll binmul(ll x, ll ti, ll m);
ll binpow(ll x, ll ti, ll m);

struct Query {
    ll l, r, x;
} q[N];

struct Bp {
    ll l, r, ans;
} d[N];

ll n, m, k, a[N], b[N], t[N * 4];
vector <ll> loc[N];

ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = m) {
    if(l <= tl && tr <= r) return t[v];
    if(tr < l || r < tl) return 0;
    ll tm = (tl + tr) / 2;
    return get(l, r, v + v, tl, tm) + get(l, r, v + v + 1, tm + 1, tr) + t[v];
}
 
void upd(ll l, ll r, ll val, ll v = 1, ll tl = 1, ll tr = m) {
    if (tr < l || r < tl) return;
    if (l <= tl && tr <= r) {
        t[v] += val;
        return;
    }
    int tm = (tl + tr) / 2;
    upd(l, r, val, v + v, tl, tm);
    upd(l, r, val, v + v + 1, tm + 1, tr);
}

const void solve() {
    cin >> n >> m;
    for (int i = 1; i <= m; ++ i) cin >> a[i], loc[a[i]].pb(i);
    for (int i = 1; i <= n; ++ i) cin >> b[i];

    cin >> k;
    for (int i = 1; i <= k; ++ i) cin >> q[i].l >> q[i].r >> q[i].x;

    for (int i = 1; i <= n; ++ i) d[i] = {1, k, -1};

    for (int i = 1; i <= 20; ++ i) {
        vector <int> g[k + 5];
        for (int j = 1; j <= n; ++ j) {
            if (d[j].l <= d[j].r) {
                ll mid = (d[j].r + d[j].l) / 2;
                g[mid].pb(j);
            }
        }

        for (int j = 1; j <= k; ++ j) {
            if (q[j].l <= q[j].r) {
                upd(q[j].l, q[j].r, q[j].x);
            } else {
                upd(1, q[j].r, q[j].x);
                upd(q[j].l, m, q[j].x);
            }

            for (auto pos : g[j]) {
                ll sum = 0;
                for (auto location : loc[pos]) {
                    if (sum < b[pos])
                        sum += get(location, location);
                    // cout << pos << ": " << location << " " << j << " -> " << get(location) << " " << sum[pos] << "\n";
                }
                int mid = (d[pos].l + d[pos].r) / 2;
                if (sum >= b[pos]) {
                    d[pos].r = mid - 1;
                    d[pos].ans = mid;
                } else {
                    d[pos].l = mid + 1;
                }
            }
        }

        for (int j = 1; j <= m * 4; ++ j) t[j] = 0;
    }

    for (int i = 1; i <= n; ++ i) {
        if (d[i].ans == -1) cout << "NIE\n";
        else cout << d[i].ans << "\n";
    }
}  

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    srand(time(NULL));

    //file("monsters");

    int tt = 1;
    // cin >> tt;
    for (int i = 1; i <= tt; ++ i) {
        solve();
    }

    return 0;
} 


// Template functions
ll binmul(ll x, ll ti, ll m) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= m; res %= m;} return res;}
ll binpow(ll x, ll ti, ll m) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x,m);x=binmul(x,x,m);ti >>= 1; x %= m; res %= m;} return res;}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	21084 KB	Output is correct
2	Correct	8 ms	21080 KB	Output is correct
3	Correct	8 ms	21080 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	21084 KB	Output is correct
2	Correct	7 ms	21156 KB	Output is correct
3	Correct	7 ms	21084 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	265 ms	27028 KB	Output is correct
2	Correct	382 ms	27536 KB	Output is correct
3	Correct	355 ms	27476 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	333 ms	27432 KB	Output is correct
2	Correct	336 ms	27296 KB	Output is correct
3	Correct	332 ms	27492 KB	Output is correct
4	Correct	84 ms	24156 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	161 ms	27216 KB	Output is correct
2	Correct	212 ms	27512 KB	Output is correct
3	Correct	137 ms	24156 KB	Output is correct
4	Correct	335 ms	27400 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	292 ms	26840 KB	Output is correct
2	Correct	272 ms	27140 KB	Output is correct
3	Correct	306 ms	26972 KB	Output is correct
4	Correct	361 ms	27904 KB	Output is correct

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3034 ms	63476 KB	Output is correct
2	Correct	894 ms	57420 KB	Output is correct
3	Correct	671 ms	35484 KB	Output is correct
4	Correct	3872 ms	65536 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3055 ms	63300 KB	Output is correct
2	Correct	752 ms	56292 KB	Output is correct
3	Correct	550 ms	34828 KB	Output is correct
4	Correct	3673 ms	65536 KB	Output is correct

Submission #890615

Compilation message