oj.uz

Submission #479168

# Submission time Handle Problem Language Result Execution time Memory
479168 2021-10-10T14:01:53 Z Bogdan1110 Meteors (POI11_met) C++14
74 / 100
 1540 ms 40160 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define n_4 10010
#define n_5 100010
#define n_6 1000010
#define n_7 10000010
#define n_8 100000010
#define pii pair<int,int>
#define pll pair<long long,long long>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
#define ordered_set tree<ld, null_type,less<ld>, rb_tree_tag,tree_order_statistics_node_update>
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element
const int NMAX = 30 + 3*1e5;
int N, M, K, l[NMAX], r[NMAX], L[NMAX], R[NMAX], res[NMAX];
ll bit[NMAX], potrebno[NMAX], x[NMAX];
vector<int>sec[NMAX];
vector<int>q[NMAX];


void update(int ind, ll koliko) {
    while(ind < NMAX) {
        bit[ind] += koliko;
        ind += ind&(-ind);
    }
}

ll query(int ind) {
    ll sum = 0;
    while(ind > 0) {
        sum += bit[ind];
        ind -= ind&-ind;
    }
    return sum;
}

void solve() {
    cin >> N >> M;
    for (int i = 1 ; i <= M ; i++ ) {
        int o;
        cin >> o;
        sec[o].pb(i);
    }
    for (int i = 1 ; i <= N ; i++ ) {
        int p ;
        cin >> p;
        potrebno[i] = p;
    }

    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;
        res[i] = K+1;
        //cout << sec[i].size() << endl;
    }

    bool changed = 1;
    while(changed) {
        changed = 0;
        fill(bit, bit+NMAX, 0LL);
        for (int i = 1 ; i <= K ; i++ ) q[i].clear();

        for (int i = 1 ; i <= N ; i++ ) {
            if ( L[i] <= R[i] ) {
                changed = 1;
                int mid = (L[i] + R[i])/2;
                q[mid].pb(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]);
            }

            for (auto u : q[i]) {
                ll sum = 0;
                for (int s : sec[u]) {
                    sum += query(s);
                    //if ( sum >= potrebno[u] ) break;
                }
                if ( sum >= potrebno[u] ) {
                    res[u] = i;
                    R[u] = i-1;
                }
                else L[u] = i+1;
                //cout << i << ' ' << u << ' ' << sum << endl ;
            }
        }


    }

    for (int i = 1 ; i <= N ; i++ ) {
        //cout << L[i] << ' ' << R[i] << ' ';
        if ( res[i] == K+1 ) {
            puts("NIE");
        }
        else cout << res[i] << endl ;
    }

} 
 
int main () {
        solve(); 
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16760 KB Output is correct
2 Correct 12 ms 16844 KB Output is correct
3 Correct 13 ms 16716 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16716 KB Output is correct
2 Correct 12 ms 16716 KB Output is correct
3 Correct 13 ms 16824 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 18372 KB Output is correct
2 Correct 227 ms 20520 KB Output is correct
3 Correct 179 ms 20020 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 19432 KB Output is correct
2 Correct 192 ms 19396 KB Output is correct
3 Correct 233 ms 20748 KB Output is correct
4 Correct 75 ms 18956 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 18764 KB Output is correct
2 Correct 239 ms 21092 KB Output is correct
3 Correct 176 ms 17572 KB Output is correct
4 Correct 178 ms 20420 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 17884 KB Output is correct
2 Correct 197 ms 19472 KB Output is correct
3 Correct 141 ms 18172 KB Output is correct
4 Correct 218 ms 21728 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1540 ms 40160 KB Output is correct
2 Incorrect 1070 ms 30664 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1401 ms 38792 KB Output is correct
2 Incorrect 1016 ms 29096 KB Output isn't correct
3 Halted 0 ms 0 KB -