oj.uz

Submission #145693

# Submission time Handle Problem Language Result Execution time Memory
145693 2019-08-20T18:58:12 Z davitmarg Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 252016 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],wmin;
int ans,k;
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)
        {
            if( k>wmin)
                ans=max(ans,lmax+(*(lower_bound(all(g[v]),lmax)-1)));
            else
                ans=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;
    wmin=mod*4;
    for(int i=1;i<=n;i++)
    {
        a[i]=readint();
        wmin=min(a[i],wmin);
    }
    build(1,1,n);

    while(m--)
    {
        int l,r;  
        ans=0;
       // scanf("%d%d%d",&l,&r,&k);
        l=readint();
        r=readint();
        k=readint();
        get(1,1,n,l,r,-1);
        printf("%c",'0'+(k>=ans));
        putchar(10);
    }

	return 0;
}



/*


4 4
1 2 1 2
1 4 0
2 3 0
1 3 0
2 4 0

*/

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 88 ms 94328 KB Output is correct
2 Correct 88 ms 94204 KB Output is correct
3 Correct 89 ms 94272 KB Output is correct
4 Correct 89 ms 94200 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 90 ms 94456 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 89 ms 94456 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 88 ms 94328 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 94328 KB Output is correct
2 Correct 88 ms 94204 KB Output is correct
3 Correct 89 ms 94272 KB Output is correct
4 Correct 89 ms 94200 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 90 ms 94456 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 89 ms 94456 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 88 ms 94328 KB Output is correct
11 Correct 91 ms 94536 KB Output is correct
12 Correct 95 ms 95308 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 97 ms 95228 KB Output is correct
15 Correct 96 ms 95224 KB Output is correct
16 Correct 96 ms 95180 KB Output is correct
17 Correct 93 ms 94840 KB Output is correct
18 Correct 100 ms 95116 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 111332 KB Output is correct
2 Correct 312 ms 111612 KB Output is correct
3 Correct 262 ms 111600 KB Output is correct
4 Correct 266 ms 111680 KB Output is correct
5 Correct 267 ms 111668 KB Output is correct
6 Correct 217 ms 111556 KB Output is correct
7 Correct 216 ms 111648 KB Output is correct
8 Correct 252 ms 111348 KB Output is correct
9 Correct 126 ms 95868 KB Output is correct
10 Correct 248 ms 111296 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 94328 KB Output is correct
2 Correct 88 ms 94204 KB Output is correct
3 Correct 89 ms 94272 KB Output is correct
4 Correct 89 ms 94200 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 90 ms 94456 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 89 ms 94456 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 88 ms 94328 KB Output is correct
11 Correct 91 ms 94536 KB Output is correct
12 Correct 95 ms 95308 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 97 ms 95228 KB Output is correct
15 Correct 96 ms 95224 KB Output is correct
16 Correct 96 ms 95180 KB Output is correct
17 Correct 93 ms 94840 KB Output is correct
18 Correct 100 ms 95116 KB Output is correct
19 Correct 695 ms 130448 KB Output is correct
20 Correct 767 ms 130452 KB Output is correct
21 Correct 592 ms 130412 KB Output is correct
22 Correct 593 ms 130340 KB Output is correct
23 Correct 583 ms 130392 KB Output is correct
24 Correct 426 ms 130412 KB Output is correct
25 Correct 411 ms 130104 KB Output is correct
26 Correct 519 ms 130188 KB Output is correct
27 Correct 494 ms 130132 KB Output is correct
28 Correct 518 ms 130060 KB Output is correct
29 Correct 537 ms 130156 KB Output is correct
30 Correct 521 ms 130028 KB Output is correct
31 Correct 526 ms 130156 KB Output is correct
32 Correct 563 ms 130156 KB Output is correct
33 Correct 540 ms 130040 KB Output is correct
34 Correct 422 ms 129736 KB Output is correct
35 Correct 385 ms 129772 KB Output is correct
36 Correct 435 ms 129804 KB Output is correct
37 Correct 401 ms 129772 KB Output is correct
38 Correct 391 ms 129884 KB Output is correct
39 Correct 480 ms 129792 KB Output is correct
40 Correct 360 ms 116592 KB Output is correct
41 Correct 468 ms 129560 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 94328 KB Output is correct
2 Correct 88 ms 94204 KB Output is correct
3 Correct 89 ms 94272 KB Output is correct
4 Correct 89 ms 94200 KB Output is correct
5 Correct 90 ms 94328 KB Output is correct
6 Correct 90 ms 94456 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 89 ms 94456 KB Output is correct
9 Correct 90 ms 94328 KB Output is correct
10 Correct 88 ms 94328 KB Output is correct
11 Correct 91 ms 94536 KB Output is correct
12 Correct 95 ms 95308 KB Output is correct
13 Correct 95 ms 95096 KB Output is correct
14 Correct 97 ms 95228 KB Output is correct
15 Correct 96 ms 95224 KB Output is correct
16 Correct 96 ms 95180 KB Output is correct
17 Correct 93 ms 94840 KB Output is correct
18 Correct 100 ms 95116 KB Output is correct
19 Execution timed out 3036 ms 252016 KB Time limit exceeded
20 Halted 0 ms 0 KB -