oj.uz

답안 #145501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145501 2019-08-20T09:26:24 Z davitmarg Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 249580 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;
    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++)
        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:34:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<b.size();i++)
                 ~^~~~~~~~~
sortbooks.cpp:37:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(p<a.size())
           ~^~~~~~~~~
sortbooks.cpp:39:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(q<b.size() && b[q]<a[p])
               ~^~~~~~~~~
sortbooks.cpp:43:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(q<b.size())
           ~^~~~~~~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:94:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",a+i);
         ~~~~~^~~~~~~~~~
sortbooks.cpp:101: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);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 94404 KB Output is correct
2 Correct 90 ms 94200 KB Output is correct
3 Correct 90 ms 94328 KB Output is correct
4 Correct 89 ms 94320 KB Output is correct
5 Correct 89 ms 94328 KB Output is correct
6 Correct 90 ms 94300 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 98 ms 94420 KB Output is correct
9 Correct 89 ms 94328 KB Output is correct
10 Correct 91 ms 94436 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 94404 KB Output is correct
2 Correct 90 ms 94200 KB Output is correct
3 Correct 90 ms 94328 KB Output is correct
4 Correct 89 ms 94320 KB Output is correct
5 Correct 89 ms 94328 KB Output is correct
6 Correct 90 ms 94300 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 98 ms 94420 KB Output is correct
9 Correct 89 ms 94328 KB Output is correct
10 Correct 91 ms 94436 KB Output is correct
11 Correct 92 ms 94520 KB Output is correct
12 Correct 96 ms 95172 KB Output is correct
13 Correct 99 ms 95096 KB Output is correct
14 Correct 99 ms 95344 KB Output is correct
15 Correct 99 ms 95224 KB Output is correct
16 Correct 97 ms 95096 KB Output is correct
17 Correct 95 ms 94840 KB Output is correct
18 Correct 95 ms 95100 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3060 ms 249580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 360 ms 111600 KB Output is correct
2 Correct 361 ms 111636 KB Output is correct
3 Correct 290 ms 111600 KB Output is correct
4 Correct 286 ms 111728 KB Output is correct
5 Correct 289 ms 111600 KB Output is correct
6 Correct 231 ms 111472 KB Output is correct
7 Correct 262 ms 111456 KB Output is correct
8 Correct 275 ms 111348 KB Output is correct
9 Correct 141 ms 95800 KB Output is correct
10 Correct 272 ms 111484 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 94404 KB Output is correct
2 Correct 90 ms 94200 KB Output is correct
3 Correct 90 ms 94328 KB Output is correct
4 Correct 89 ms 94320 KB Output is correct
5 Correct 89 ms 94328 KB Output is correct
6 Correct 90 ms 94300 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 98 ms 94420 KB Output is correct
9 Correct 89 ms 94328 KB Output is correct
10 Correct 91 ms 94436 KB Output is correct
11 Correct 92 ms 94520 KB Output is correct
12 Correct 96 ms 95172 KB Output is correct
13 Correct 99 ms 95096 KB Output is correct
14 Correct 99 ms 95344 KB Output is correct
15 Correct 99 ms 95224 KB Output is correct
16 Correct 97 ms 95096 KB Output is correct
17 Correct 95 ms 94840 KB Output is correct
18 Correct 95 ms 95100 KB Output is correct
19 Correct 752 ms 132568 KB Output is correct
20 Correct 718 ms 132552 KB Output is correct
21 Correct 608 ms 132348 KB Output is correct
22 Correct 663 ms 132460 KB Output is correct
23 Correct 625 ms 132432 KB Output is correct
24 Correct 442 ms 132256 KB Output is correct
25 Correct 488 ms 132332 KB Output is correct
26 Correct 526 ms 132460 KB Output is correct
27 Correct 531 ms 132560 KB Output is correct
28 Correct 549 ms 132468 KB Output is correct
29 Correct 559 ms 132372 KB Output is correct
30 Correct 585 ms 132628 KB Output is correct
31 Correct 549 ms 132460 KB Output is correct
32 Correct 559 ms 132372 KB Output is correct
33 Correct 567 ms 132460 KB Output is correct
34 Correct 418 ms 131980 KB Output is correct
35 Correct 419 ms 132172 KB Output is correct
36 Correct 432 ms 131920 KB Output is correct
37 Correct 444 ms 131820 KB Output is correct
38 Correct 421 ms 131948 KB Output is correct
39 Correct 526 ms 130924 KB Output is correct
40 Correct 368 ms 116976 KB Output is correct
41 Correct 515 ms 130512 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 94404 KB Output is correct
2 Correct 90 ms 94200 KB Output is correct
3 Correct 90 ms 94328 KB Output is correct
4 Correct 89 ms 94320 KB Output is correct
5 Correct 89 ms 94328 KB Output is correct
6 Correct 90 ms 94300 KB Output is correct
7 Correct 90 ms 94376 KB Output is correct
8 Correct 98 ms 94420 KB Output is correct
9 Correct 89 ms 94328 KB Output is correct
10 Correct 91 ms 94436 KB Output is correct
11 Correct 92 ms 94520 KB Output is correct
12 Correct 96 ms 95172 KB Output is correct
13 Correct 99 ms 95096 KB Output is correct
14 Correct 99 ms 95344 KB Output is correct
15 Correct 99 ms 95224 KB Output is correct
16 Correct 97 ms 95096 KB Output is correct
17 Correct 95 ms 94840 KB Output is correct
18 Correct 95 ms 95100 KB Output is correct
19 Execution timed out 3060 ms 249580 KB Time limit exceeded
20 Halted 0 ms 0 KB -