oj.uz

Submission #738579

# Submission time Handle Problem Language Result Execution time Memory
738579 2023-05-09T06:12:31 Z boyliguanhan Meteors (POI11_met) C++17
74 / 100
 698 ms 37728 KB 
#include<bits/stdc++.h>
//#pragma GCC optimize(2)
#define N 300001
#define rep(i,j,k) for(I i=j;i<=k;i++)
using namespace std;
#define I long long
I bit[N],ans[N],L[N],R[N],a[N];
struct c{I g, id;vector<I>st;};
void u(I x, I y) {
    for(;x<N;x+=x&-x)
        bit[x]+=y;
}
void upd(I l, I r, I x) {
    u(l,x),u(r+1,-x);
    if(l>r)u(1,x);
}
I q(I x) {
    I r = 0;
    while(x)r+=bit[x],x-=x&-x;
    return r;
}
c X[N];
void solve(I l, I r, vector<int> cs){
    if(l==r) {
        for(auto i: cs) ans[X[i].id] = l;
        l++;
    }
    if(cs.empty()||l>r) return;
    I m=l+r>>1;
    rep(i,l,m)
        upd(L[i],R[i],a[i]);
    vector<int>c1,c2;
    for(auto i: cs) {
        I x=0;
        for(auto j:X[i].st)x+=q(j);
        if(x<X[i].g) X[i].g-=x,c2.push_back(i);
        else c1.push_back(i);
    }
    cs.clear();
    rep(i,l,m) upd(L[i],R[i],-a[i]);
    solve(l,m,c1);
    solve(m+1,r,c2);
}
int main() {
    I n,m,k;
    cin>>n>>m;
    vector<int> v(n);
    iota(v.begin(),v.end(),0);
    rep(i,1,m){
        I x;
        cin>>x;
        X[x-1].st.push_back(i);
    }
    rep(i,0,n-1)cin>>X[i].g,X[i].id=i+1;
    cin>>k;
    rep(i,1,k)cin>>L[i]>>R[i]>>a[i];
    L[k+1]=1,R[k+1]=m,a[k+1]=1e18;
    solve(1,k+1,v);
    rep(i,1,n)
        if(ans[i]<=k)
            cout << ans[i] <<'\n';
        else
            cout << "NIE\n";
}

Compilation message

met.cpp: In function 'void solve(long long int, long long int, std::vector<int>)':
met.cpp:29:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |     I m=l+r>>1;
      |         ~^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12116 KB Output is correct
2 Correct 9 ms 12196 KB Output is correct
3 Correct 8 ms 12116 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12116 KB Output is correct
2 Correct 8 ms 12196 KB Output is correct
3 Correct 8 ms 12192 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 14908 KB Output is correct
2 Correct 125 ms 17888 KB Output is correct
3 Correct 121 ms 15960 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 14828 KB Output is correct
2 Correct 140 ms 15744 KB Output is correct
3 Correct 111 ms 17872 KB Output is correct
4 Correct 41 ms 14920 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 14680 KB Output is correct
2 Correct 183 ms 18112 KB Output is correct
3 Correct 66 ms 13772 KB Output is correct
4 Correct 121 ms 16336 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 14172 KB Output is correct
2 Correct 159 ms 14796 KB Output is correct
3 Correct 85 ms 14252 KB Output is correct
4 Correct 152 ms 16168 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 698 ms 37728 KB Output is correct
2 Incorrect 497 ms 31696 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 651 ms 34432 KB Output is correct
2 Incorrect 462 ms 29976 KB Output isn't correct
3 Halted 0 ms 0 KB -