oj.uz

Submission #1008348

# Submission time Handle Problem Language Result Execution time Memory
1008348 2024-06-26T09:42:03 Z DucNguyen2007 Meteors (POI11_met) C++14
74 / 100
 781 ms 37800 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=3e5+5;
const ll inf=2e18;
int n,m,a[maxN+1],k,ans[maxN+1];
vector<int> v[maxN+1],pos[maxN+1];
struct query
{
    int l,r;
    ll x;
}q[maxN+1];
struct met
{
    int l,r,mid,b;
}p[maxN+1];
struct BIT
{
    ll a[maxN+1];
    BIT()
    {
        memset(a, 0, sizeof a);
    }
    void clr()
    {
        memset(a, 0, sizeof a);
    }
    void Update(int p, ll v)
    {
        for(; p <= m; p += p & -p)
            a[p] += v;
    }
    void update_range(int l,int r,ll v)
    {
        Update(l,v);
        Update(r+1,-v);
    }
    ll get(int p)
    {
        ll ans = 0;
        for(; p > 0; p -= p & -p)
            ans += a[p];
        return ans;
    }
} f;
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a[i];
        assert(a[i]<=maxN);
        pos[a[i]].push_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        cin>>p[i].b;
    }
    cin>>k;
    for(int i=1;i<=k;i++)
    {
        cin>>q[i].l>>q[i].r>>q[i].x;
        assert(q[i].l<=maxN);
        assert(q[i].r<=maxN);
    }
    for(int i=1;i<=n;i++)
    {
        p[i].l=1;
        p[i].r=k;
        ans[i]=-1;
    }
    while(1)
    {
        bool ok=false;
        for(int i=1;i<=n;i++)
        {
            if(p[i].l<=p[i].r)
            {
                p[i].mid=(p[i].l+p[i].r)/2;
                ok=true;
                assert(p[i].mid>=0&&p[i].mid<=maxN);
                v[p[i].mid].push_back(i);
            }
        }
        f.clr();
        if(!ok)
        {
            break;
        }
        for(int i=1;i<=k;i++)
        {
            if(q[i].l>q[i].r)
            {
                f.update_range(q[i].l,m,q[i].x);
                f.update_range(1,q[i].r,q[i].x);
            }
            else f.update_range(q[i].l,q[i].r,q[i].x);
            for(auto j:v[i])
            {
                ll res=0;
                for(auto id:pos[j])
                {
                    res+=f.get(id);
                }
                if(res>=p[j].b)
                {
                    ans[j]=p[j].mid;
                    p[j].r=p[j].mid-1;
                }
                else p[j].l=p[j].mid+1;
            }
            v[i].clear();
        }
    }
    for(int i=1;i<=n;i++)
    {
        assert(p[i].l>p[i].r);
        if(p[i].l>k)
        {
            cout<<"NIE";
        }
        else
        {
            assert(ans[i]>=1&&ans[i]<=k);
            cout<<p[i].l;
        }
        cout<<'\n';
    }
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19544 KB Output is correct
2 Correct 5 ms 19292 KB Output is correct
3 Correct 5 ms 19292 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 19292 KB Output is correct
2 Correct 6 ms 19292 KB Output is correct
3 Correct 6 ms 19288 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 20816 KB Output is correct
2 Correct 91 ms 23120 KB Output is correct
3 Correct 73 ms 22524 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 22096 KB Output is correct
2 Correct 70 ms 21992 KB Output is correct
3 Correct 87 ms 23032 KB Output is correct
4 Correct 21 ms 21340 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 21332 KB Output is correct
2 Correct 65 ms 23660 KB Output is correct
3 Correct 33 ms 20060 KB Output is correct
4 Correct 69 ms 23048 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 20316 KB Output is correct
2 Correct 78 ms 22100 KB Output is correct
3 Correct 45 ms 20820 KB Output is correct
4 Correct 84 ms 24392 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 781 ms 37800 KB Output is correct
2 Incorrect 540 ms 24924 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 745 ms 36360 KB Output is correct
2 Incorrect 577 ms 25052 KB Output isn't correct
3 Halted 0 ms 0 KB -