oj.uz

답안 #153688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153688 2019-09-15T06:36:45 Z semiauto Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
77 / 100
 3000 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,l,r,ans,N=1024*1024;
int mas[1000001],val[1000001],tree[2048*1024];
pair <int,int> p[1000001][20];
vector <int> v[1000001];
inline int maxi(int a,int b) {
    if (a>b)
        return a;
    return b;
}
void dfs(int u) {
    int i;
    for (i=1;i<20;i++)
        if (p[p[u][i-1].first][i-1].first)
            p[u][i]={p[p[u][i-1].first][i-1].first,maxi(p[u][i-1].second,p[p[u][i-1].first][i-1].second)};
    for (i=0;i<(v[u].size());i++)
        dfs(v[u][i]);
}
int solve(int x,int y,int p,int l,int r) {
    if (l>y || x>r)
        return 0;
    if (l>=x && r<=y)
        return tree[p];
    return maxi(solve(x,y,2*p,l,(l+r)/2),solve(x,y,2*p+1,(l+r)/2+1,r));
}
void build_tree(int p) {
    if (p>=N) {
        if ((p-N+1)<=n)
            tree[p]=mas[p-N+1];
        return;
    }
    build_tree(2*p);
    build_tree(2*p+1);
    tree[p]=maxi(tree[2*p],tree[2*p+1]);
}
int main() {
    scanf("%d %d",&n,&m);
    for (i=1;i<=n;i++)
        scanf("%d",&(mas[i]));
    build_tree(1);
    for (i=n;i>0;i--) {
        for (;r>0;r--)
            if (mas[val[r]]>=mas[i])
                break;
        p[i][0].first=val[r];
        if (val[r]>(i+1))
            p[i][0].second=mas[i]+solve(i+1+N-1,val[r]-1+N-1,1,N,2*N-1);
        v[val[r]].push_back(i);
        val[++r]=i;
    }
    for (i=0;i<(v[0].size());i++)
        dfs(v[0][i]);
    for (mas[0]=1;mas[0]<=m;mas[0]++) {
        scanf("%d %d %d",&l,&r,&j);
        if (l==r) {
            printf("1\n");
            continue;
        }
        ans=0;
        for (i=19;i>=0;i--)
            if (p[l][i].first && p[l][i].first<=r) {
                ans=maxi(ans,p[l][i].second);
                l=p[l][i].first;
            }
        if (r>l)
            ans=maxi(ans,mas[l]+solve(l+1+N-1,r+N-1,1,N,2*N-1));
        if (ans>j)
            printf("0\n");
        else
            printf("1\n");
    }
}

Compilation message

sortbooks.cpp: In function 'void dfs(int)':
sortbooks.cpp:17:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<(v[u].size());i++)
              ~^~~~~~~~~~~~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<(v[0].size());i++)
              ~^~~~~~~~~~~~~~
sortbooks.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~
sortbooks.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&(mas[i]));
         ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&l,&r,&j);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 34 ms 27900 KB Output is correct
3 Correct 36 ms 28024 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 35 ms 27996 KB Output is correct
6 Correct 34 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 34 ms 28028 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 34 ms 27900 KB Output is correct
3 Correct 36 ms 28024 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 35 ms 27996 KB Output is correct
6 Correct 34 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 34 ms 28028 KB Output is correct
11 Correct 38 ms 28280 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 46 ms 28920 KB Output is correct
16 Correct 45 ms 29048 KB Output is correct
17 Correct 39 ms 28904 KB Output is correct
18 Correct 39 ms 29048 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2037 ms 210608 KB Output is correct
2 Correct 2036 ms 210556 KB Output is correct
3 Correct 2036 ms 210592 KB Output is correct
4 Correct 2011 ms 210692 KB Output is correct
5 Correct 2794 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 192 ms 46276 KB Output is correct
2 Correct 174 ms 46200 KB Output is correct
3 Correct 210 ms 51320 KB Output is correct
4 Correct 260 ms 51352 KB Output is correct
5 Correct 217 ms 51192 KB Output is correct
6 Correct 156 ms 50808 KB Output is correct
7 Correct 144 ms 50808 KB Output is correct
8 Correct 183 ms 49144 KB Output is correct
9 Correct 86 ms 28276 KB Output is correct
10 Correct 210 ms 49500 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 34 ms 27900 KB Output is correct
3 Correct 36 ms 28024 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 35 ms 27996 KB Output is correct
6 Correct 34 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 34 ms 28028 KB Output is correct
11 Correct 38 ms 28280 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 46 ms 28920 KB Output is correct
16 Correct 45 ms 29048 KB Output is correct
17 Correct 39 ms 28904 KB Output is correct
18 Correct 39 ms 29048 KB Output is correct
19 Correct 419 ms 64532 KB Output is correct
20 Correct 406 ms 64500 KB Output is correct
21 Correct 347 ms 64540 KB Output is correct
22 Correct 349 ms 64528 KB Output is correct
23 Correct 355 ms 64584 KB Output is correct
24 Correct 371 ms 74440 KB Output is correct
25 Correct 385 ms 74472 KB Output is correct
26 Correct 459 ms 74544 KB Output is correct
27 Correct 435 ms 74576 KB Output is correct
28 Correct 567 ms 74516 KB Output is correct
29 Correct 471 ms 74612 KB Output is correct
30 Correct 463 ms 74616 KB Output is correct
31 Correct 471 ms 74696 KB Output is correct
32 Correct 475 ms 74444 KB Output is correct
33 Correct 477 ms 74640 KB Output is correct
34 Correct 285 ms 74488 KB Output is correct
35 Correct 313 ms 74616 KB Output is correct
36 Correct 316 ms 74604 KB Output is correct
37 Correct 365 ms 74568 KB Output is correct
38 Correct 282 ms 74804 KB Output is correct
39 Correct 408 ms 71160 KB Output is correct
40 Correct 298 ms 57464 KB Output is correct
41 Correct 371 ms 70544 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 34 ms 27900 KB Output is correct
3 Correct 36 ms 28024 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 35 ms 27996 KB Output is correct
6 Correct 34 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 34 ms 28028 KB Output is correct
11 Correct 38 ms 28280 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 46 ms 28920 KB Output is correct
16 Correct 45 ms 29048 KB Output is correct
17 Correct 39 ms 28904 KB Output is correct
18 Correct 39 ms 29048 KB Output is correct
19 Correct 2037 ms 210608 KB Output is correct
20 Correct 2036 ms 210556 KB Output is correct
21 Correct 2036 ms 210592 KB Output is correct
22 Correct 2011 ms 210692 KB Output is correct
23 Correct 2794 ms 262144 KB Output is correct
24 Correct 192 ms 46276 KB Output is correct
25 Correct 174 ms 46200 KB Output is correct
26 Correct 210 ms 51320 KB Output is correct
27 Correct 260 ms 51352 KB Output is correct
28 Correct 217 ms 51192 KB Output is correct
29 Correct 156 ms 50808 KB Output is correct
30 Correct 144 ms 50808 KB Output is correct
31 Correct 183 ms 49144 KB Output is correct
32 Correct 86 ms 28276 KB Output is correct
33 Correct 210 ms 49500 KB Output is correct
34 Correct 419 ms 64532 KB Output is correct
35 Correct 406 ms 64500 KB Output is correct
36 Correct 347 ms 64540 KB Output is correct
37 Correct 349 ms 64528 KB Output is correct
38 Correct 355 ms 64584 KB Output is correct
39 Correct 371 ms 74440 KB Output is correct
40 Correct 385 ms 74472 KB Output is correct
41 Correct 459 ms 74544 KB Output is correct
42 Correct 435 ms 74576 KB Output is correct
43 Correct 567 ms 74516 KB Output is correct
44 Correct 471 ms 74612 KB Output is correct
45 Correct 463 ms 74616 KB Output is correct
46 Correct 471 ms 74696 KB Output is correct
47 Correct 475 ms 74444 KB Output is correct
48 Correct 477 ms 74640 KB Output is correct
49 Correct 285 ms 74488 KB Output is correct
50 Correct 313 ms 74616 KB Output is correct
51 Correct 316 ms 74604 KB Output is correct
52 Correct 365 ms 74568 KB Output is correct
53 Correct 282 ms 74804 KB Output is correct
54 Correct 408 ms 71160 KB Output is correct
55 Correct 298 ms 57464 KB Output is correct
56 Correct 371 ms 70544 KB Output is correct
57 Correct 2208 ms 210772 KB Output is correct
58 Correct 2111 ms 210548 KB Output is correct
59 Correct 1887 ms 210632 KB Output is correct
60 Correct 2183 ms 210576 KB Output is correct
61 Correct 1906 ms 210764 KB Output is correct
62 Correct 1965 ms 210764 KB Output is correct
63 Correct 1844 ms 262144 KB Output is correct
64 Correct 1960 ms 262144 KB Output is correct
65 Correct 2709 ms 262144 KB Output is correct
66 Correct 2997 ms 262144 KB Output is correct
67 Correct 2787 ms 262144 KB Output is correct
68 Correct 2872 ms 262144 KB Output is correct
69 Correct 2918 ms 262144 KB Output is correct
70 Correct 2800 ms 262144 KB Output is correct
71 Execution timed out 3040 ms 262144 KB Time limit exceeded
72 Halted 0 ms 0 KB -