oj.uz

Submission #967415

# Submission time Handle Problem Language Result Execution time Memory
967415 2024-04-22T05:17:19 Z 12345678 Meteors (POI11_met) C++17
74 / 100
 790 ms 46588 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5;

int n, m, p[nx], q, l[nx], r[nx], ul, ur, a, cnt=20, t[nx];
vector<int> d[nx], qrs[nx];
vector<pair<int, pair<int, int>>> k;

struct fenwick
{
    ll d[nx];
    void update(int i, int vl) 
    {
        while (i<nx) d[i]+=vl, i+=(i&-i);
    }
    ll query(int i)
    {
        ll res=0;
        while (i>0) res+=d[i], i-=(i&-i);
        return res;
    }
} f;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>p[i], d[p[i]].push_back(i);
    for (int i=1; i<=n; i++) cin>>t[i];
    cin>>q;
    for (int i=0; i<q; i++) cin>>ul>>ur>>a, k.push_back({a, {ul, ur}});
    for (int i=1; i<=n; i++) l[i]=1, r[i]=q+1;
    while (cnt--)
    {
        for (int i=1; i<=n; i++) qrs[(l[i]+r[i])/2].push_back(i);
        for (int i=1; i<=q+1; i++)
        {
            if (i==q+1) continue;
            int x=k[i-1].second.first, y=k[i-1].second.second, z=k[i-1].first;
            if (x<=y) f.update(x, z), f.update(y+1, -z);
            else f.update(1, z), f.update(y+1, -z), f.update(x, z), f.update(m+1, -z);
            //cout<<"fenwick "<<i<<':';
            //for (int j=1; j<=m; j++) cout<<f.query(j)<<' ';
            //cout<<'\n';
            for (auto idx:qrs[i])
            {
                ll sm=0;
                for (auto id:d[idx]) sm+=f.query(id);
                //cout<<"debug "<<cnt<<' '<<idx<<' '<<sm<<'\n';
                if (sm>=t[idx]) r[idx]=i;
                else l[idx]=i+1;
            }
            qrs[i].clear();
        }
        //cout<<cnt<<':'<<'\n';
        //for (int i=1; i<=n; i++) cout<<i<<' '<<l[i]<<' '<<r[i]<<'\n';
        for (int i=1; i<=m; i++) f.d[i]=0;
    }
    for (int i=1; i<=n; i++)
    {
        if (l[i]>q) cout<<"NIE\n";
        else cout<<l[i]<<'\n';
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 20984 KB Output is correct
2 Correct 7 ms 21084 KB Output is correct
3 Correct 7 ms 20828 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 21084 KB Output is correct
2 Correct 7 ms 21072 KB Output is correct
3 Correct 7 ms 21084 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 23496 KB Output is correct
2 Correct 136 ms 26316 KB Output is correct
3 Correct 99 ms 25032 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 24544 KB Output is correct
2 Correct 137 ms 24552 KB Output is correct
3 Correct 141 ms 25676 KB Output is correct
4 Correct 32 ms 23508 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 23756 KB Output is correct
2 Correct 127 ms 26548 KB Output is correct
3 Correct 137 ms 22308 KB Output is correct
4 Correct 107 ms 25596 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 23196 KB Output is correct
2 Correct 143 ms 24508 KB Output is correct
3 Correct 83 ms 23232 KB Output is correct
4 Correct 126 ms 26928 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 790 ms 46588 KB Output is correct
2 Incorrect 503 ms 35792 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 784 ms 45580 KB Output is correct
2 Incorrect 686 ms 33768 KB Output isn't correct
3 Halted 0 ms 0 KB -