oj.uz

Submission #491709

# Submission time Handle Problem Language Result Execution time Memory
491709 2021-12-03T22:44:22 Z faresbasbs Meteors (POI11_met) C++14
0 / 100
 4311 ms 38904 KB 
#include <bits/stdc++.h>
using namespace std;

struct p{
    long long l1,r1,l2,r2,val;
};

const int sq = sqrt(300001);
long long n,m,k,t,type[300001],val[300001],sum[300001];
pair<long long,long long> lst[300001];
vector<long long> segment,all[300001];
bool done[300001];
p event[300001];

void upd(int a , int b , int v , int curr , int l , int r){
    if(b < l || a > r){
        return ;
    }
    if(a <= l && b >= r){
        segment[curr] += v;
        return ;
    }
    int mid = (l+r)/2;
    upd(a,b,v,2*curr,l,mid),upd(a,b,v,2*curr+1,mid+1,r);
}

long long getsum(int idx){
    idx += t-1;
    long long ret = 0;
    while(idx){
        ret += segment[idx];
        idx /= 2;
    }
    return ret;
}

long long num(int l , int r , int idx){
    return (upper_bound(all[idx].begin(),all[idx].end(),r)-all[idx].begin())-(lower_bound(all[idx].begin(),all[idx].end(),l)-all[idx].begin());
}

long long getval(int idx , int ev){
    long long numb = num(event[ev].l1,event[ev].r1,idx)+(event[ev].l2 == -1 ? 0ll : num(event[ev].l2,event[ev].r2,idx));
    return event[ev].val*numb;
}

void check(int idx){
    for(int i = 1 ; i <= n ; i += 1){
        sum[i] = 0;
    }
    for(int i = 1 ; i <= m ; i += 1){
        if(done[type[i]]){
            continue;
        }
        sum[type[i]] += getsum(i);
    }
    for(int i = 1 ; i <= n ; i += 1){
        if(sum[i] >= val[i]){
            done[i] = 1;
        }
        if(done[i]){
            continue;
        }
        lst[i] = {sum[i],idx};
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    cin >> n >> m;
    t = pow(2,ceil(log2(m)));
    segment.resize(2*t,0);
    for(int i = 1 ; i <= m ; i += 1){
        cin >> type[i];
        all[type[i]].push_back(i);
    }
    for(int i = 1 ; i <= n ; i += 1){
        cin >> val[i];
        lst[i] = {0,0};
    }
    cin >> k;
    for(int i = 1 ; i <= k ; i += 1){
        int l,r,v;
        cin >> l >> r >> v;
        if(r >= l){
            event[i] = {l,r,-1,-1,v};
            upd(l,r,v,1,1,t);
        }else{
            event[i] = {l,m,1,r,v};
            upd(l,m,v,1,1,t),upd(1,r,v,1,1,t);
        }
        if(i%sq == 0){
            check(i);
        }
    }
    check(m);
    for(int i = 1 ; i <= n ; i += 1){
        if(!done[i]){
            cout << "NIE\n";
            continue;
        }
        pair<long long,long long> curr = lst[i];
        while(curr.first <= val[i]){
            curr.second += 1;
            curr.first += getval(i,curr.second);
        }
        cout << curr.second << '\n';
    }
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7484 KB Output is correct
2 Correct 5 ms 7400 KB Output is correct
3 Incorrect 17 ms 7540 KB Output isn't correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 11516 KB Output is correct
2 Incorrect 121 ms 12508 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 11232 KB Output is correct
2 Correct 93 ms 11772 KB Output is correct
3 Correct 112 ms 11444 KB Output is correct
4 Incorrect 200 ms 12612 KB Output isn't correct

Subtask #7
0 / 13.0

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

Subtask #8
0 / 13.0

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