oj.uz

Submission #964300

# Submission time Handle Problem Language Result Execution time Memory
964300 2024-04-16T15:22:10 Z Pekiban Meteors (POI11_met) C++17
74 / 100
 313 ms 34980 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int mxN = 3e5+3;
vector<int> a[mxN];
array<int, 3> e[mxN];
ll bit[mxN], p[mxN], ans[mxN], c = -1;
void upd(int idx, int x) {
    while (idx < mxN) {
        bit[idx] += x;
        idx |= (idx + 1);
    }
}
ll sum(ll idx) {
    ll s = 0;
    while (idx >= 0) {
        s += bit[idx];
        idx &= (idx + 1);
        --idx;
    }
    return s;
}
void upd(int l, int r, int x) {
    upd(l, x);
    upd(r+1, -x);
}
int n, m;
void solve(int l, int r, vector<int> &b) {
    if (l == r) {
        for (auto u : b) {
            ans[u] = l;
        }
        return;
    }
    int mid = (l + r)/2;
    while (c < mid) {
        ++c;
        if (e[c][0] <= e[c][1]) {
            upd(e[c][0], e[c][1], e[c][2]);
        }
        else {
            upd(e[c][0], m-1, e[c][2]);
            upd(0, e[c][1], e[c][2]);
        }
    }
    while (c > mid) {
        if (e[c][0] <= e[c][1]) {
            upd(e[c][0], e[c][1], -e[c][2]);
        }
        else {
            upd(e[c][0], m-1, -e[c][2]);
            upd(0, e[c][1], -e[c][2]);
        }
        --c;
    }
    vector<int> L, R;
    for (auto x : b) {
        ll s = 0;
        for (auto i : a[x]) {
            s += sum(i);
        }
        if (s >= p[x]) {
            ans[x] = mid;
            L.push_back(x);
        }
        else {
            R.push_back(x);
        }
    }
    b.clear();
    if (!L.empty() && l != mid) solve(l, mid, L);
    if (!R.empty()) solve(mid+1, r, R);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int x;
        cin >> x;
        --x;
        a[x].push_back(i);
    }
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
    }
    int k;
    cin >> k;
    for (int i = 0; i < k; ++i) {
        cin >> e[i][0] >> e[i][1] >> e[i][2];
        --e[i][0], --e[i][1];
    }
    e[k] = {0, 0, 0};
    vector<int> b(n);
    iota(b.begin(), b.end(), 0);
    solve(0, k, b);
    for (int i = 0; i < n; ++i) {
        cout << (ans[i] == k ? "NIE" : to_string(ans[i] + 1)) << '\n';
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13660 KB Output is correct
2 Correct 4 ms 13656 KB Output is correct
3 Correct 4 ms 13660 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13660 KB Output is correct
2 Correct 4 ms 13788 KB Output is correct
3 Correct 4 ms 13660 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 15336 KB Output is correct
2 Correct 66 ms 19648 KB Output is correct
3 Correct 59 ms 15636 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 15452 KB Output is correct
2 Correct 67 ms 15452 KB Output is correct
3 Correct 53 ms 19024 KB Output is correct
4 Correct 25 ms 15444 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 15064 KB Output is correct
2 Correct 74 ms 19036 KB Output is correct
3 Correct 30 ms 14168 KB Output is correct
4 Correct 56 ms 16108 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 15128 KB Output is correct
2 Correct 71 ms 15664 KB Output is correct
3 Correct 41 ms 15196 KB Output is correct
4 Correct 85 ms 18636 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 313 ms 34980 KB Output is correct
2 Incorrect 215 ms 25200 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 32952 KB Output is correct
2 Incorrect 217 ms 23268 KB Output isn't correct
3 Halted 0 ms 0 KB -