oj.uz

Submission #967416

# Submission time Handle Problem Language Result Execution time Memory
967416 2024-04-22T05:19:15 Z 12345678 Meteors (POI11_met) C++17
74 / 100
 761 ms 38224 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=19, 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();
        }
        for (int i=1; i<=m+1; 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 6 ms 20828 KB Output is correct
2 Correct 7 ms 21336 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 6 ms 20824 KB Output is correct
2 Correct 7 ms 20828 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 72 ms 22560 KB Output is correct
2 Correct 130 ms 24784 KB Output is correct
3 Correct 95 ms 23924 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 23484 KB Output is correct
2 Correct 118 ms 23500 KB Output is correct
3 Correct 141 ms 24268 KB Output is correct
4 Correct 31 ms 23044 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 22988 KB Output is correct
2 Correct 119 ms 25036 KB Output is correct
3 Correct 131 ms 21740 KB Output is correct
4 Correct 96 ms 24264 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 22200 KB Output is correct
2 Correct 130 ms 23312 KB Output is correct
3 Correct 80 ms 22616 KB Output is correct
4 Correct 127 ms 25544 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 750 ms 38224 KB Output is correct
2 Incorrect 502 ms 27600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 761 ms 37080 KB Output is correct
2 Incorrect 683 ms 27468 KB Output isn't correct
3 Halted 0 ms 0 KB -