oj.uz

Submission #993585

# Submission time Handle Problem Language Result Execution time Memory
993585 2024-06-06T05:36:21 Z vivkostov Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
30 / 100
 928 ms 47088 KB 
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
struct cell
{
    int l,r,c,in;
    void read()
    {
        cin>>l>>r>>c;
    }
};
bool cmp(cell a1,cell a2)
{
    if(a1.r<a2.r)return true;
    if(a1.r>a2.r)return false;
    if(a1.l<a2.l)return true;
    return false;
}
cell b[1000005];
int n,m,a[1000005],l,r,c,p[4000005],otg[1000005];
void update(int l,int r,int ql,int qr,int h,int x)
{
    if(l>qr||r<ql)return;
    if(l>=ql&&r<=qr)
    {
        p[h]=max(x,p[h]);
        return;
    }
    int m=(l+r)/2;
    update(l,m,ql,qr,h*2,x);
    update(m+1,r,ql,qr,h*2+1,x);
    p[h]=max(max(p[h*2],p[h*2+1]),p[h]);
}
int query(int l,int r,int ql,int qr,int h)
{
    if(l>qr||r<ql)return 0;
    if(l>=ql&&r<=qr)return p[h];
    int m=(l+r)/2;
    return max(query(l,m,ql,qr,h*2),query(m+1,r,ql,qr,h*2+1));
}
stack<int>s;
stack<int>in;
void read()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=m;i++)
    {
        b[i].read();
        b[i].in=i;
    }
    sort(b+1,b+m+1,cmp);
    int pos=0;
    for(int i=1;i<=m;i++)
    {
        for(int j=max(pos,b[i].l);j<=b[i].r;j++)
        {
            while(!s.empty()&&s.top()<=a[j])
            {
                s.pop();
                in.pop();
            }
            if(s.empty())
            {
                s.push(a[j]);
                in.push(j);
            }
            else
            {
                update(1,n,in.top(),in.top(),1,a[j]+s.top());
                s.push(a[j]);
                in.push(j);
            }
        }
        if(b[i].c>=query(1,n,b[i].l,b[i].r,1))otg[b[i].in]=1;
        pos=b[i].r+1;
    }
    for(int i=1;i<=m;i++)
    {
        cout<<otg[i]<<endl;
    }
}
int main()
{
    speed();
    read();
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 925 ms 46500 KB Output is correct
2 Correct 874 ms 47088 KB Output is correct
3 Correct 928 ms 46980 KB Output is correct
4 Correct 916 ms 47048 KB Output is correct
5 Correct 702 ms 43040 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 5264 KB Output is correct
2 Correct 73 ms 5268 KB Output is correct
3 Correct 59 ms 4144 KB Output is correct
4 Correct 60 ms 4176 KB Output is correct
5 Correct 63 ms 4388 KB Output is correct
6 Correct 56 ms 3664 KB Output is correct
7 Correct 53 ms 3664 KB Output is correct
8 Correct 56 ms 4068 KB Output is correct
9 Correct 37 ms 3448 KB Output is correct
10 Correct 55 ms 4052 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -