oj.uz

Submission #443074

# Submission time Handle Problem Language Result Execution time Memory
443074 2021-07-09T15:30:34 Z MladenP Meteors (POI11_met) C++17
74 / 100
 1119 ms 36088 KB 
#include <bits/stdc++.h>
#define MAXN 300010
#define MAXBIN 20
#define MAXV 300000
#define lld long long
#define endl '\n'
#define PRINT(x) cerr<<flush<<#x<<'='<<x<<endl;
using namespace std;
int N, M, K, l[MAXN], r[MAXN], L[MAXN], R[MAXN], rez[MAXN];
lld bit[MAXN], p[MAXN], x[MAXN];
vector<int> sec[MAXN], q[MAXN];
void update(int idx, lld val) {
    while(idx < MAXN) {
        bit[idx] += val;
        idx += idx&-idx;
    }
}
lld query(int idx) {
    lld sum = 0;
    while(idx) {
        sum += bit[idx];
        idx -= idx&-idx;
    }
    return sum;
}
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> N >> M;
    for(int i = 1; i <= M; i++) {
        int o; cin >> o;
        sec[o].push_back(i);
    }
    for(int i = 1; i <= N; i++) cin >> p[i];
    cin >> K;
    for(int i = 1; i <= K; i++) {
        cin >> l[i] >> r[i] >> x[i];
    }
    for(int i = 1; i <= N; i++) {
        L[i] = 1, R[i] = K, rez[i] = K+1;
    }
    int t = MAXBIN;
    while(t--) {
        fill(bit, bit+MAXN, 0LL);
        for(int i = 1; i <= K+1; i++) q[i].clear();

        for(int i = 1; i <= N; i++) {
            if(L[i] <= R[i]) {
                int mid = (L[i]+R[i])/2;
                q[mid].push_back(i);
            }
        }

        for(int i = 1; i <= K; i++) {
            if(l[i] <= r[i]) {
                update(l[i], x[i]);
                update(r[i]+1, -x[i]);
            } else {
                update(1, x[i]);
                update(r[i]+1, -x[i]);
                update(l[i], x[i]);
                update(M+1, -x[i]);
            }
            for(auto x : q[i]) {
                lld sum = 0;
                for(int s : sec[x]) {
                    sum += query(s);
                }
                if(sum >= p[x]) {
                    R[x] = i-1;
                    rez[x] = i;
                } else {
                    L[x] = i+1;
                }
            }
        }
    }
    for(int i = 1; i <= N; i++) {
        if(rez[i] == K+1) cout << "NIE" << endl;
        else cout << rez[i] << endl;
    }
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16844 KB Output is correct
2 Correct 15 ms 16792 KB Output is correct
3 Correct 16 ms 16860 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 16852 KB Output is correct
2 Correct 16 ms 16844 KB Output is correct
3 Correct 16 ms 16912 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 18312 KB Output is correct
2 Correct 206 ms 20564 KB Output is correct
3 Correct 148 ms 20092 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 19516 KB Output is correct
2 Correct 175 ms 19396 KB Output is correct
3 Correct 217 ms 20568 KB Output is correct
4 Correct 46 ms 18756 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 18760 KB Output is correct
2 Correct 211 ms 21124 KB Output is correct
3 Correct 225 ms 17608 KB Output is correct
4 Correct 150 ms 20420 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 17860 KB Output is correct
2 Correct 194 ms 19480 KB Output is correct
3 Correct 119 ms 18308 KB Output is correct
4 Correct 191 ms 21924 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1119 ms 36088 KB Output is correct
2 Incorrect 745 ms 22820 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1085 ms 34312 KB Output is correct
2 Incorrect 758 ms 22836 KB Output isn't correct
3 Halted 0 ms 0 KB -