oj.uz

Submission #145598

# Submission time Handle Problem Language Result Execution time Memory
145598 2019-08-20T13:31:30 Z davitmarg Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 247368 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;
char readchar() {
    char c = getchar();
    while (c <= 33) {
        c = getchar();
    }
    return c;
}
 
 
int readint() {
    char c = getchar();
    while (c <= 33) {
        c = getchar();
    }
    bool sign = false;
    if (c == '-') {
        sign = true;
        c = getchar();
    }
    int t = 0;
    while (c >= '0' && c <= '9') {
        t = (t << 3) + (t << 1) + c - '0';
        c = getchar();
    }
    return (sign ? -t: t);
}



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;
    for(int i=0;i<b.size();i++)
        if(b[i]<a.back())
            d=a.back()+b[i];
    while(p<a.size())
    {
        while(q<b.size() && b[q]<a[p])
            c.PB(b[q++]);
        c.PB(a[p++]);
    }
    while(q<b.size())
        c.PB(b[q++]);

    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++)
        a[i]=readint();
    build(1,1,n);

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


        printf("%c",'0'+(k>=ans));
        putchar(10);
    }

	return 0;
}



/*

3 2 
5 4 4 
1 3 9 
1 3 8 


*/

Compilation message

sortbooks.cpp: In function 'int mergeSerge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
sortbooks.cpp:62:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<b.size();i++)
                 ~^~~~~~~~~
sortbooks.cpp:65:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(p<a.size())
           ~^~~~~~~~~
sortbooks.cpp:67:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(q<b.size() && b[q]<a[p])
               ~^~~~~~~~~
sortbooks.cpp:71:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q<b.size())
           ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 94328 KB Output is correct
2 Correct 90 ms 94300 KB Output is correct
3 Correct 107 ms 94328 KB Output is correct
4 Correct 90 ms 94332 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 89 ms 94324 KB Output is correct
7 Correct 91 ms 94328 KB Output is correct
8 Correct 89 ms 94328 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 90 ms 94456 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 94328 KB Output is correct
2 Correct 90 ms 94300 KB Output is correct
3 Correct 107 ms 94328 KB Output is correct
4 Correct 90 ms 94332 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 89 ms 94324 KB Output is correct
7 Correct 91 ms 94328 KB Output is correct
8 Correct 89 ms 94328 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 90 ms 94456 KB Output is correct
11 Correct 93 ms 94584 KB Output is correct
12 Correct 95 ms 95156 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 98 ms 95224 KB Output is correct
15 Correct 98 ms 95224 KB Output is correct
16 Correct 96 ms 95100 KB Output is correct
17 Correct 96 ms 94972 KB Output is correct
18 Correct 108 ms 95064 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 335 ms 111520 KB Output is correct
2 Correct 307 ms 111632 KB Output is correct
3 Correct 264 ms 111624 KB Output is correct
4 Correct 278 ms 111896 KB Output is correct
5 Correct 261 ms 111740 KB Output is correct
6 Correct 215 ms 111472 KB Output is correct
7 Correct 214 ms 111600 KB Output is correct
8 Correct 251 ms 111520 KB Output is correct
9 Correct 127 ms 95864 KB Output is correct
10 Correct 242 ms 111344 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 94328 KB Output is correct
2 Correct 90 ms 94300 KB Output is correct
3 Correct 107 ms 94328 KB Output is correct
4 Correct 90 ms 94332 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 89 ms 94324 KB Output is correct
7 Correct 91 ms 94328 KB Output is correct
8 Correct 89 ms 94328 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 90 ms 94456 KB Output is correct
11 Correct 93 ms 94584 KB Output is correct
12 Correct 95 ms 95156 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 98 ms 95224 KB Output is correct
15 Correct 98 ms 95224 KB Output is correct
16 Correct 96 ms 95100 KB Output is correct
17 Correct 96 ms 94972 KB Output is correct
18 Correct 108 ms 95064 KB Output is correct
19 Correct 686 ms 132332 KB Output is correct
20 Correct 691 ms 132484 KB Output is correct
21 Correct 622 ms 132332 KB Output is correct
22 Correct 594 ms 132304 KB Output is correct
23 Correct 589 ms 132204 KB Output is correct
24 Correct 419 ms 132136 KB Output is correct
25 Correct 416 ms 132076 KB Output is correct
26 Correct 502 ms 132528 KB Output is correct
27 Correct 510 ms 132332 KB Output is correct
28 Correct 500 ms 132452 KB Output is correct
29 Correct 536 ms 132588 KB Output is correct
30 Correct 516 ms 132436 KB Output is correct
31 Correct 503 ms 132460 KB Output is correct
32 Correct 520 ms 132460 KB Output is correct
33 Correct 512 ms 132588 KB Output is correct
34 Correct 392 ms 132092 KB Output is correct
35 Correct 413 ms 132044 KB Output is correct
36 Correct 378 ms 131820 KB Output is correct
37 Correct 390 ms 131820 KB Output is correct
38 Correct 386 ms 131948 KB Output is correct
39 Correct 505 ms 131080 KB Output is correct
40 Correct 334 ms 116876 KB Output is correct
41 Correct 463 ms 130544 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 94328 KB Output is correct
2 Correct 90 ms 94300 KB Output is correct
3 Correct 107 ms 94328 KB Output is correct
4 Correct 90 ms 94332 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 89 ms 94324 KB Output is correct
7 Correct 91 ms 94328 KB Output is correct
8 Correct 89 ms 94328 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 90 ms 94456 KB Output is correct
11 Correct 93 ms 94584 KB Output is correct
12 Correct 95 ms 95156 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 98 ms 95224 KB Output is correct
15 Correct 98 ms 95224 KB Output is correct
16 Correct 96 ms 95100 KB Output is correct
17 Correct 96 ms 94972 KB Output is correct
18 Correct 108 ms 95064 KB Output is correct
19 Execution timed out 3054 ms 247368 KB Time limit exceeded
20 Halted 0 ms 0 KB -