oj.uz

Submission #415503

# Submission time Handle Problem Language Result Execution time Memory
415503 2021-06-01T07:41:00 Z qwerasdfzxcl Meteors (POI11_met) C++17
74 / 100
 3554 ms 65540 KB 
#include <bits/stdc++.h>
#define ll __int128_t
#define int long long

using namespace std;
struct Seg{
    ll tree[600600];
    int sz;
    void init(){
        for (int i=1;i<((sz)<<1);i++) tree[i] = 0;
    }
    void update_p(int i, int p){
        i += sz;
        for (tree[i]+=p;i>1;i>>=1) tree[i>>1] = tree[i]+tree[i^1];
    }
    void update(int l, int r, int p){
        update_p(l, p);
        if (r<sz-1) update_p(r+1, -p);
    }
    ll query(int l, int r){
        ll ret = 0;
        for (l += sz, r += sz;l<r;l>>=1, r>>=1){
            if (l&1) ret += tree[l++];
            if (r&1) ret += tree[--r];
        }
        return ret;
    }
}tree;
struct Query{
    int l, r, a;
}query[300300];
vector<int> ar[300300], q[300300];
int l[300300], r[300300], ans[300300];
int val[300300];

signed main(){
    int n, m;
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    cin >> n >> m;
    tree.sz = m+1;
    for (int i=1;i<=m;i++){
        int x;
        cin >> x;
        ar[x-1].push_back(i);
    }
    for (int i=0;i<n;i++) cin >> val[i];
    int tmp;
    cin >> tmp;
    for (int i=0;i<tmp;i++){
        cin >> query[i].l >> query[i].r >> query[i].a;
    }
    for (int i=0;i<n;i++) l[i] = 0, r[i] = tmp;
    while(1){
        //assert(c<12);
        bool chk=0;
        for (int i=0;i<=tmp;i++) q[i].clear();
        for (int i=0;i<n;i++) if (l[i]!=r[i]){
            q[(l[i]+r[i])>>1].push_back(i);
            chk=1;
        }
        if (!chk) break;
        tree.init();
        for (int i=0;i<tmp;i++){
            if (query[i].l<=query[i].r) tree.update(query[i].l, query[i].r, query[i].a);
            else{
                tree.update(1, query[i].r, query[i].a);
                tree.update(query[i].l, m, query[i].a);
            }
            for (auto &j:q[i]){
                ll tmp1 = 0;
                for (auto &x:ar[j]){
                    tmp1 += tree.query(1, x+1);
                }
                if (tmp1>=val[j]){
                    r[j] = i;
                    ans[j] = i+1;
                }
                else l[j] = i+1;
            }
            //tree.debug();
        }
    }
    for (int i=0;i<n;i++){
        if (l[i] == tmp) cout << "NIE\n";
        else cout << ans[i] << '\n';
    }
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14540 KB Output is correct
2 Correct 14 ms 14540 KB Output is correct
3 Correct 13 ms 14556 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14492 KB Output is correct
2 Correct 11 ms 14540 KB Output is correct
3 Correct 12 ms 14540 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 18568 KB Output is correct
2 Correct 224 ms 21876 KB Output is correct
3 Correct 233 ms 20920 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 20308 KB Output is correct
2 Correct 207 ms 20164 KB Output is correct
3 Correct 244 ms 22412 KB Output is correct
4 Correct 79 ms 19124 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 19048 KB Output is correct
2 Correct 181 ms 22568 KB Output is correct
3 Correct 63 ms 15704 KB Output is correct
4 Correct 201 ms 21552 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 17772 KB Output is correct
2 Correct 189 ms 20048 KB Output is correct
3 Correct 168 ms 18276 KB Output is correct
4 Correct 244 ms 23760 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3554 ms 55576 KB Output is correct
2 Correct 1035 ms 33416 KB Output is correct
3 Correct 298 ms 20516 KB Output is correct
4 Runtime error 3005 ms 65540 KB Execution killed with signal 9

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3417 ms 53364 KB Output is correct
2 Correct 855 ms 33372 KB Output is correct
3 Correct 286 ms 19248 KB Output is correct
4 Runtime error 1643 ms 65540 KB Execution killed with signal 9