oj.uz

Submission #1015661

# Submission time Handle Problem Language Result Execution time Memory
1015661 2024-07-06T16:12:04 Z vjudge1 Meteors (POI11_met) C++17
24 / 100
 127 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)

int n, m, q;
int sum;

struct Kind {
    Kind *L, *R;
    int Cur = 0;
};


Kind *update(Kind *id, int u, int v, int c, int l, int r) {
    if (!id) {
        id = new Kind();
    }
    if (l > v || r < u) {
        return id;
    }

    if (u <= l && r <= v) {
        Kind *temp = new Kind();
        temp->L = id->L;
        temp->R = id->R;
        temp->Cur = min(id->Cur + c, (int)1e9);
        return temp;
    }

    int md = (l + r) / 2;
    Kind *temp = new Kind();
    temp->L = update(id->L, u, v, c, l, md + 0);
    temp->R = update(id->R, u, v, c, md + 1, r);
    temp->Cur = id->Cur;
    return temp;
}

void get(Kind *id, int u, int v, int l, int r) {
    if (!id) {
        id = new Kind();
    }
    if (l > v || r < u) {
        return;
    }


    sum = min(sum + id->Cur, (int)1e9);
    if (l >= u && r <= v) {
        return;
    }

    int md = (l + r) / 2;
    get(id->L, u, v, l, md + 0),
    get(id->R, u, v, md + 1, r);
}

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin >> n >> m;

    vector<vector<int>> Ind(n + 1);
    for (int i = 1; i <= m; i++) {
        int a;
        cin >> a;
        Ind[a].push_back(i);
    }

    vector<int> A(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> A[i];
    }
    vector<Kind*> Head;
    cin >> q;
    int qq = q;
    while (qq--) {
        int l, r, x;
        cin >> l >> r >> x;
        if (l <= r) {
            Head.push_back(update((Head.empty() ? new Kind() : Head.back()), l, r, x, 1, m));
        }
        else {
            auto temp = update((Head.empty() ? new Kind() : Head.back()), l, m, x, 1, m);
            Head.push_back(update(temp, 1, r, x, 1, m));
        }
    }

    for (int i = 1; i <= n; i++) {
        int l = 0, r = Head.size() - 1, res  = -1;
        while (l <= r) {
            int md = (l + r) / 2;

            auto cur = Head[md];
            sum = 0;
            for (auto pos : Ind[i]) {
                get(cur, pos, pos, 1, m);
            }

            if (sum >= A[i]) {
                res = md, r = md - 1;
            }
            else {
                l = md + 1;
            }
        }
        if (res == -1) {
            cout << "NIE" << endl;
        }
        else {
            cout << res + 1 << endl;
        }
    }

}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1624 KB Output is correct
2 Correct 3 ms 1312 KB Output is correct
3 Correct 2 ms 1628 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3160 KB Output is correct
2 Correct 4 ms 3164 KB Output is correct
3 Correct 2 ms 1628 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 87 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 97 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 127 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 90 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 114 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 126 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -