oj.uz

답안 #153689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153689 2019-09-15T06:39:08 Z semiauto Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 2971 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 35 ms 27896 KB Output is correct
3 Correct 35 ms 28024 KB Output is correct
4 Correct 34 ms 27896 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 40 ms 28040 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 28124 KB Output is correct
10 Correct 35 ms 27924 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 35 ms 28024 KB Output is correct
4 Correct 34 ms 27896 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 40 ms 28040 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 28124 KB Output is correct
10 Correct 35 ms 27924 KB Output is correct
11 Correct 41 ms 28272 KB Output is correct
12 Correct 44 ms 28792 KB Output is correct
13 Correct 39 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 41 ms 28840 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29056 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2040 ms 210768 KB Output is correct
2 Correct 2055 ms 210488 KB Output is correct
3 Correct 2098 ms 210540 KB Output is correct
4 Correct 2223 ms 210508 KB Output is correct
5 Correct 2917 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 192 ms 46252 KB Output is correct
2 Correct 180 ms 46200 KB Output is correct
3 Correct 225 ms 51284 KB Output is correct
4 Correct 212 ms 51204 KB Output is correct
5 Correct 211 ms 51304 KB Output is correct
6 Correct 144 ms 50808 KB Output is correct
7 Correct 146 ms 50808 KB Output is correct
8 Correct 187 ms 49252 KB Output is correct
9 Correct 81 ms 28408 KB Output is correct
10 Correct 182 ms 49400 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 35 ms 28024 KB Output is correct
4 Correct 34 ms 27896 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 40 ms 28040 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 28124 KB Output is correct
10 Correct 35 ms 27924 KB Output is correct
11 Correct 41 ms 28272 KB Output is correct
12 Correct 44 ms 28792 KB Output is correct
13 Correct 39 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 41 ms 28840 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29056 KB Output is correct
19 Correct 409 ms 64408 KB Output is correct
20 Correct 434 ms 64440 KB Output is correct
21 Correct 340 ms 64532 KB Output is correct
22 Correct 359 ms 64400 KB Output is correct
23 Correct 364 ms 64480 KB Output is correct
24 Correct 370 ms 74636 KB Output is correct
25 Correct 380 ms 74616 KB Output is correct
26 Correct 447 ms 74644 KB Output is correct
27 Correct 428 ms 74480 KB Output is correct
28 Correct 455 ms 74536 KB Output is correct
29 Correct 469 ms 74688 KB Output is correct
30 Correct 467 ms 74616 KB Output is correct
31 Correct 468 ms 74612 KB Output is correct
32 Correct 506 ms 74616 KB Output is correct
33 Correct 483 ms 74616 KB Output is correct
34 Correct 285 ms 74488 KB Output is correct
35 Correct 290 ms 74684 KB Output is correct
36 Correct 285 ms 74484 KB Output is correct
37 Correct 284 ms 74556 KB Output is correct
38 Correct 288 ms 74488 KB Output is correct
39 Correct 446 ms 71192 KB Output is correct
40 Correct 347 ms 57592 KB Output is correct
41 Correct 369 ms 70592 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 27896 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 35 ms 28024 KB Output is correct
4 Correct 34 ms 27896 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 40 ms 28040 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 28124 KB Output is correct
10 Correct 35 ms 27924 KB Output is correct
11 Correct 41 ms 28272 KB Output is correct
12 Correct 44 ms 28792 KB Output is correct
13 Correct 39 ms 28792 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 41 ms 28840 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29056 KB Output is correct
19 Correct 2040 ms 210768 KB Output is correct
20 Correct 2055 ms 210488 KB Output is correct
21 Correct 2098 ms 210540 KB Output is correct
22 Correct 2223 ms 210508 KB Output is correct
23 Correct 2917 ms 262144 KB Output is correct
24 Correct 192 ms 46252 KB Output is correct
25 Correct 180 ms 46200 KB Output is correct
26 Correct 225 ms 51284 KB Output is correct
27 Correct 212 ms 51204 KB Output is correct
28 Correct 211 ms 51304 KB Output is correct
29 Correct 144 ms 50808 KB Output is correct
30 Correct 146 ms 50808 KB Output is correct
31 Correct 187 ms 49252 KB Output is correct
32 Correct 81 ms 28408 KB Output is correct
33 Correct 182 ms 49400 KB Output is correct
34 Correct 409 ms 64408 KB Output is correct
35 Correct 434 ms 64440 KB Output is correct
36 Correct 340 ms 64532 KB Output is correct
37 Correct 359 ms 64400 KB Output is correct
38 Correct 364 ms 64480 KB Output is correct
39 Correct 370 ms 74636 KB Output is correct
40 Correct 380 ms 74616 KB Output is correct
41 Correct 447 ms 74644 KB Output is correct
42 Correct 428 ms 74480 KB Output is correct
43 Correct 455 ms 74536 KB Output is correct
44 Correct 469 ms 74688 KB Output is correct
45 Correct 467 ms 74616 KB Output is correct
46 Correct 468 ms 74612 KB Output is correct
47 Correct 506 ms 74616 KB Output is correct
48 Correct 483 ms 74616 KB Output is correct
49 Correct 285 ms 74488 KB Output is correct
50 Correct 290 ms 74684 KB Output is correct
51 Correct 285 ms 74484 KB Output is correct
52 Correct 284 ms 74556 KB Output is correct
53 Correct 288 ms 74488 KB Output is correct
54 Correct 446 ms 71192 KB Output is correct
55 Correct 347 ms 57592 KB Output is correct
56 Correct 369 ms 70592 KB Output is correct
57 Correct 2090 ms 210532 KB Output is correct
58 Correct 2067 ms 210540 KB Output is correct
59 Correct 1902 ms 210532 KB Output is correct
60 Correct 1961 ms 210556 KB Output is correct
61 Correct 1913 ms 210600 KB Output is correct
62 Correct 1946 ms 210608 KB Output is correct
63 Correct 1976 ms 262144 KB Output is correct
64 Correct 1994 ms 262144 KB Output is correct
65 Correct 2851 ms 262144 KB Output is correct
66 Correct 2895 ms 262144 KB Output is correct
67 Correct 2971 ms 262144 KB Output is correct
68 Correct 2749 ms 262144 KB Output is correct
69 Correct 2806 ms 262144 KB Output is correct
70 Correct 2848 ms 262144 KB Output is correct
71 Correct 2825 ms 262144 KB Output is correct
72 Correct 2843 ms 262144 KB Output is correct
73 Correct 1530 ms 262144 KB Output is correct
74 Correct 1501 ms 262144 KB Output is correct
75 Correct 1468 ms 262144 KB Output is correct
76 Correct 1465 ms 262144 KB Output is correct
77 Correct 1541 ms 262144 KB Output is correct
78 Correct 2291 ms 262144 KB Output is correct
79 Correct 1499 ms 168988 KB Output is correct
80 Correct 2197 ms 262144 KB Output is correct