oj.uz

답안 #709791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709791 2023-03-14T12:26:25 Z groshi Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 188560 KB 
#include<iostream>
#include<vector>
using namespace std;
const int T = 1<<20;
vector<vector<int> > drzewo;
int wynik[2*T];
int maxx=0;
int wynikk=0;
int pot=1;
void dodaj(int x)
{
    wynikk=max(wynikk,wynik[x]);
    if(drzewo[x].size()==0)
        return;
    int mam=drzewo[x].back();
    int gdzie=lower_bound(drzewo[x].begin(),drzewo[x].end(),maxx)-drzewo[x].begin();
    if(gdzie>=1)
        wynikk=max(wynikk,maxx+drzewo[x][gdzie-1]);
    maxx=max(maxx,mam);
}
void zapp(int x,int l,int r,int a,int b)
{
    if(l>b || r<a)
        return;
    if(a<=l && r<=b)
    {
        dodaj(x);
        return;
    }
    int mid=(l+r)/2;
    zapp(x*2,l,mid,a,b);
    zapp(x*2+1,mid+1,r,a,b);
}
int32_t main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int n,zap,x;
    cin>>n>>zap;
    while(pot<=n)
        pot*=2;
    pot--;
    drzewo.resize(2*pot+2);
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        drzewo[i+pot].push_back(x);
    }
    for(int i=pot;i>=1;i--)
    {
        ///merguje i*2 z i*2+1
        wynik[i]=max(wynik[i*2],wynik[i*2+1]);
        if(drzewo[i*2].size()>0)
        {
            int jest=drzewo[i*2].back();
            int gdzie=lower_bound(drzewo[i*2+1].begin(),drzewo[i*2+1].end(),jest)-drzewo[i*2+1].begin();
            if(gdzie>=1)
                wynik[i]=max(wynik[i],jest+drzewo[i*2+1][gdzie-1]);
        }
        int l=0,r=0;
        while(l<drzewo[i*2].size() && r<drzewo[i*2+1].size())
        {
            if(drzewo[i*2][l]<=drzewo[i*2+1][r])
            {
                drzewo[i].push_back(drzewo[i*2][l]);
                l++;
            }
            else{
                drzewo[i].push_back(drzewo[i*2+1][r]);
                r++;
            }
        }
        while(r<drzewo[i*2+1].size())
        {
            drzewo[i].push_back(drzewo[i*2+1][r]);
            r++;
        }
        while(l<drzewo[i*2].size())
        {
            drzewo[i].push_back(drzewo[i*2][l]);
            l++;
        }
    }
    while(zap--)
    {
        int x,y,z;
        cin>>x>>y>>z;
        maxx=0;
        wynikk=0;
        zapp(1,pot+1,pot*2+1,x+pot,y+pot);
        if(wynikk>z)
            cout<<"0\n";
        else cout<<"1\n";
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int32_t main()':
sortbooks.cpp:62:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         while(l<drzewo[i*2].size() && r<drzewo[i*2+1].size())
      |               ~^~~~~~~~~~~~~~~~~~~
sortbooks.cpp:62:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         while(l<drzewo[i*2].size() && r<drzewo[i*2+1].size())
      |                                       ~^~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:74:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         while(r<drzewo[i*2+1].size())
      |               ~^~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:79:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         while(l<drzewo[i*2].size())
      |               ~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 5 ms 1364 KB Output is correct
14 Correct 7 ms 1376 KB Output is correct
15 Correct 7 ms 1364 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 8 ms 1364 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 20688 KB Output is correct
2 Correct 180 ms 20652 KB Output is correct
3 Correct 202 ms 20616 KB Output is correct
4 Correct 194 ms 20528 KB Output is correct
5 Correct 172 ms 20504 KB Output is correct
6 Correct 124 ms 20596 KB Output is correct
7 Correct 121 ms 20592 KB Output is correct
8 Correct 152 ms 20548 KB Output is correct
9 Correct 35 ms 1840 KB Output is correct
10 Correct 172 ms 20580 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 5 ms 1364 KB Output is correct
14 Correct 7 ms 1376 KB Output is correct
15 Correct 7 ms 1364 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 8 ms 1364 KB Output is correct
19 Correct 529 ms 39820 KB Output is correct
20 Correct 538 ms 39800 KB Output is correct
21 Correct 371 ms 39800 KB Output is correct
22 Correct 392 ms 39756 KB Output is correct
23 Correct 363 ms 39720 KB Output is correct
24 Correct 287 ms 39808 KB Output is correct
25 Correct 295 ms 39824 KB Output is correct
26 Correct 411 ms 39796 KB Output is correct
27 Correct 408 ms 39804 KB Output is correct
28 Correct 447 ms 39728 KB Output is correct
29 Correct 419 ms 39804 KB Output is correct
30 Correct 408 ms 39888 KB Output is correct
31 Correct 423 ms 39768 KB Output is correct
32 Correct 436 ms 39752 KB Output is correct
33 Correct 403 ms 39876 KB Output is correct
34 Correct 252 ms 39708 KB Output is correct
35 Correct 261 ms 39748 KB Output is correct
36 Correct 241 ms 39724 KB Output is correct
37 Correct 253 ms 39772 KB Output is correct
38 Correct 252 ms 39768 KB Output is correct
39 Correct 345 ms 39824 KB Output is correct
40 Correct 222 ms 31552 KB Output is correct
41 Correct 337 ms 39844 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 5 ms 1364 KB Output is correct
13 Correct 5 ms 1364 KB Output is correct
14 Correct 7 ms 1376 KB Output is correct
15 Correct 7 ms 1364 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 8 ms 1364 KB Output is correct
19 Execution timed out 3037 ms 188560 KB Time limit exceeded
20 Halted 0 ms 0 KB -