oj.uz

Submission #964302

# Submission time Handle Problem Language Result Execution time Memory
964302 2024-04-16T15:24:59 Z Pekiban Meteors (POI11_met) C++17
0 / 100
 365 ms 34976 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 (r < l)  return;
    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()) solve(l, mid-1, 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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 13792 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 13816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 15292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 15452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 15072 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 15112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 365 ms 34976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 299 ms 32940 KB Output isn't correct
2 Halted 0 ms 0 KB -