oj.uz

Submission #145499

# Submission time Handle Problem Language Result Execution time Memory
145499 2019-08-20T09:22:18 Z davitmarg Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 262144 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

int n,m,a[1000006];
int ans;
vector<int> g[4*1000006];
int t[4*1000006],mx[4*1000006];

int mergeSerge(vector<int>& a,vector<int>& b,vector<int> &c)
{
    // int p=0,q=0,d=0;
    // while(p<a.size())
    // {
    //     while(q<b.size() && b[q]<a[p])
    //     {
    //         d=max(d,a[p]+b[q]);
    //         c.PB(b[q++]);
    //     }
    //     c.PB(a[p++]);
    // }
    // while(q<b.size())
    //     c.PB(b[q++]);

    int d,MX=0;
    for(int i=0;i<a.size();i++)
        c.PB(a[i]);
    for(int i=0;i<b.size();i++)
        c.PB(b[i]);
    for(int i=0;i<c.size();i++)
    {
        if(MX>c[i])
            d=max(MX+c[i],d);
        MX=max(MX,c[i]);
    }
    return d;
}

void build(int v,int l,int r)
{
    if(l==r)
    {
        t[v]=a[l];
        g[v].PB(a[l]);
        return;
    }
    int m=(l+r)/2;
    build(v*2,l,m);
    build(v*2+1,m+1,r);
    mx[v]=mergeSerge(g[v*2],g[v*2+1],g[v]);
    mx[v]=max(mx[v],max(mx[v*2],mx[v*2+1]));
    t[v]=max(t[v*2],t[v*2+1]);
}

int get(int v,int l,int r,int i,int j,int lmax)
{
    if(i>j)
        return -1;
    if(l==i && r==j)
    {
        //cout<<"["<<l<<":"<<r<<"]"<<" "<<lmax<<endl;
        if(g[v][0]<lmax)
            ans=max(ans,lmax+(*(lower_bound(all(g[v]),lmax)-1)));
        ans=max(ans,mx[v]);
        return t[v];
    }
    int m=(l+r)>>1;
    
    int p1,p2;

    p1=get(v*2,l,m,i,min(j,m),lmax);
    lmax=max(lmax,p1);

    p2=get(v*2+1,m+1,r,max(m+1,i),j,lmax);
    lmax=max(lmax,p2);

    return lmax;
}

int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        scanf("%d",a+i);
    build(1,1,n);

    while(m--)
    {
        int l,r,k;  
        ans=0;
        scanf("%d%d%d",&l,&r,&k);
        get(1,1,n,l,r,-1);
        //cout<<ans<<endl;
        printf("%d\n",(k>=ans));
    }

	return 0;
}
 
/*

3 1 
5 4 4 
1 3 9 

*/

Compilation message

sortbooks.cpp: In function 'int mergeSerge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
sortbooks.cpp:47:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<a.size();i++)
                 ~^~~~~~~~~
sortbooks.cpp:49:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<b.size();i++)
                 ~^~~~~~~~~
sortbooks.cpp:51:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<c.size();i++)
                 ~^~~~~~~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:105:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",a+i);
         ~~~~~^~~~~~~~~~
sortbooks.cpp:112:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&l,&r,&k);
         ~~~~~^~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'int mergeSerge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
sortbooks.cpp:57:12: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized]
     return d;
            ^

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 94328 KB Output is correct
2 Correct 89 ms 94300 KB Output is correct
3 Incorrect 89 ms 94312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 94328 KB Output is correct
2 Correct 89 ms 94300 KB Output is correct
3 Incorrect 89 ms 94312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3026 ms 262144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 335 ms 111736 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 94328 KB Output is correct
2 Correct 89 ms 94300 KB Output is correct
3 Incorrect 89 ms 94312 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 94328 KB Output is correct
2 Correct 89 ms 94300 KB Output is correct
3 Incorrect 89 ms 94312 KB Output isn't correct
4 Halted 0 ms 0 KB -