oj.uz

Submission #942031

# Submission time Handle Problem Language Result Execution time Memory
942031 2024-03-10T03:26:43 Z riariti Meteors (POI11_met) C++17
100 / 100
 4844 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define F first
#define S second
using namespace std;
const ll N = 3e5 + 5;
const ll NN = 2e6 + 5;
const ll INF = -1e1;
const ll MOD = 1e9 + 7;
const ll LG = 18;
int z[N], x[N];
ll t[4 * N], b[N], c[N];
pair<int, int> seq[N];
set<int> MID[N];
vector<int> rg[N];
void build(int v, int l, int r) {
    t[v] = 0;
    if (l == r) {
        t[v] = 0;
        return;
    }
    int mid = (l + r) / 2;
    build(v + v, l, mid);
    build(v + v + 1, mid + 1, r);
}
void upd(int v, int l, int r, int ql, int qr, ll x) {
    if (ql <= l && r <= qr) {
        t[v] += x;
        return;
    }
    if (ql > r || qr < l)
        return;
    int mid = (l + r) / 2;
    upd(v + v, l, mid, ql, qr, x);
    upd(v + v + 1, mid + 1, r, ql, qr, x);
}
ll get(int v, int l, int r, int pos, ll sum) {
    sum += t[v];
    if (l == r)
        return sum;
    int mid = (l + r) / 2;
    if (pos <= mid)
        return get(v + v, l, mid, pos, sum);
    else
        return get(v + v + 1, mid + 1, r, pos, sum);
}
void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int u;
        cin >> u;
        rg[u].pb(i);
    }
    for (int i = 1; i <= n; i++) {
        cin >> b[i];
    }
    int q;
    cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> z[i] >> x[i] >> c[i];
    }
    for (int i = 1; i <= n; i++) {
        seq[i] = {1, q};
    }
    int tt = 19;
    while (tt--) {
        for (int i = 1; i <= n; i++) {
            int md = (seq[i].F + seq[i].S) / 2;
            MID[md].insert(i);
        }
        build(1, 1, m);
        for (int i = 1; i <= q; i++) {
            if (z[i] > x[i]) {
                upd(1, 1, m, 1, x[i], c[i]);
                upd(1, 1, m, z[i], m, c[i]);
            } else {
                upd(1, 1, m, z[i], x[i], c[i]);
            }
            for (int to : MID[i]) {
                ll sum = 0;
                for (int d : rg[to]) {
                    sum += get(1, 1, m, d, 0);
                    if (sum >= b[to])
                        break;
                }
                if (sum >= b[to]) {
                    seq[to].S = i;
                } else {
                    seq[to].F = i + 1;
                }
            }
        }
        for (int i = 1; i <= q; i++) {
            MID[i].clear();
        }
    }
    for (int i = 1; i <= n; i++) {
        if (seq[i].F <= q) {
            cout << seq[i].F << '\n';
        } else {
            cout << "NIE\n";
        }
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    ll abd = 1;
    // cin >> abd;
    for (ll i = 1; i <= abd; i++) {
        //        cout << "Case " << i << ":\n";
        solve();
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 31320 KB Output is correct
2 Correct 12 ms 31320 KB Output is correct
3 Correct 11 ms 31572 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 31324 KB Output is correct
2 Correct 13 ms 31460 KB Output is correct
3 Correct 12 ms 31320 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 34844 KB Output is correct
2 Correct 415 ms 36456 KB Output is correct
3 Correct 374 ms 35680 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 35392 KB Output is correct
2 Correct 359 ms 35420 KB Output is correct
3 Correct 422 ms 36572 KB Output is correct
4 Correct 118 ms 35156 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 34864 KB Output is correct
2 Correct 273 ms 36588 KB Output is correct
3 Correct 157 ms 32004 KB Output is correct
4 Correct 363 ms 35932 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 34776 KB Output is correct
2 Correct 306 ms 35420 KB Output is correct
3 Correct 316 ms 34892 KB Output is correct
4 Correct 405 ms 36640 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3153 ms 57252 KB Output is correct
2 Correct 1135 ms 49556 KB Output is correct
3 Correct 715 ms 34388 KB Output is correct
4 Correct 4694 ms 65308 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3055 ms 55924 KB Output is correct
2 Correct 781 ms 48032 KB Output is correct
3 Correct 584 ms 35012 KB Output is correct
4 Correct 4844 ms 65536 KB Output is correct