oj.uz

Submission #153687

# Submission time Handle Problem Language Result Execution time Memory
153687 2019-09-15T06:33:11 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];
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,max(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 max(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]=max(tree[2*p],tree[2*p+1]);
}
int main() {
    cin>>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=max(ans,p[l][i].second);
                l=p[l][i].first;
            }
        if (r>l)
            ans=max(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:12: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:47:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<(v[0].size());i++)
              ~^~~~~~~~~~~~~~
sortbooks.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&(mas[i]));
         ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:50: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

# Verdict Execution time Memory Grader output
1 Correct 75 ms 28024 KB Output is correct
2 Correct 35 ms 28024 KB Output is correct
3 Correct 35 ms 27896 KB Output is correct
4 Correct 34 ms 27996 KB Output is correct
5 Correct 35 ms 27972 KB Output is correct
6 Correct 36 ms 28152 KB Output is correct
7 Correct 36 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 35 ms 28024 KB Output is correct
10 Correct 36 ms 28024 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 28024 KB Output is correct
2 Correct 35 ms 28024 KB Output is correct
3 Correct 35 ms 27896 KB Output is correct
4 Correct 34 ms 27996 KB Output is correct
5 Correct 35 ms 27972 KB Output is correct
6 Correct 36 ms 28152 KB Output is correct
7 Correct 36 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 35 ms 28024 KB Output is correct
10 Correct 36 ms 28024 KB Output is correct
11 Correct 38 ms 28256 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 43 ms 28920 KB Output is correct
15 Correct 46 ms 28888 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 45 ms 28924 KB Output is correct
18 Correct 42 ms 29176 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2037 ms 210580 KB Output is correct
2 Correct 2000 ms 210732 KB Output is correct
3 Correct 1998 ms 210584 KB Output is correct
4 Correct 1962 ms 210716 KB Output is correct
5 Correct 2887 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 46200 KB Output is correct
2 Correct 171 ms 46200 KB Output is correct
3 Correct 216 ms 51232 KB Output is correct
4 Correct 220 ms 51320 KB Output is correct
5 Correct 225 ms 51192 KB Output is correct
6 Correct 151 ms 50808 KB Output is correct
7 Correct 150 ms 50936 KB Output is correct
8 Correct 186 ms 49304 KB Output is correct
9 Correct 80 ms 28284 KB Output is correct
10 Correct 179 ms 49500 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 28024 KB Output is correct
2 Correct 35 ms 28024 KB Output is correct
3 Correct 35 ms 27896 KB Output is correct
4 Correct 34 ms 27996 KB Output is correct
5 Correct 35 ms 27972 KB Output is correct
6 Correct 36 ms 28152 KB Output is correct
7 Correct 36 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 35 ms 28024 KB Output is correct
10 Correct 36 ms 28024 KB Output is correct
11 Correct 38 ms 28256 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 43 ms 28920 KB Output is correct
15 Correct 46 ms 28888 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 45 ms 28924 KB Output is correct
18 Correct 42 ms 29176 KB Output is correct
19 Correct 394 ms 64476 KB Output is correct
20 Correct 434 ms 64504 KB Output is correct
21 Correct 400 ms 64376 KB Output is correct
22 Correct 338 ms 64664 KB Output is correct
23 Correct 358 ms 64504 KB Output is correct
24 Correct 433 ms 74652 KB Output is correct
25 Correct 425 ms 74616 KB Output is correct
26 Correct 625 ms 74676 KB Output is correct
27 Correct 566 ms 74488 KB Output is correct
28 Correct 506 ms 74628 KB Output is correct
29 Correct 560 ms 74432 KB Output is correct
30 Correct 491 ms 74728 KB Output is correct
31 Correct 502 ms 74712 KB Output is correct
32 Correct 477 ms 74744 KB Output is correct
33 Correct 492 ms 74540 KB Output is correct
34 Correct 304 ms 74760 KB Output is correct
35 Correct 292 ms 74488 KB Output is correct
36 Correct 288 ms 74616 KB Output is correct
37 Correct 303 ms 74460 KB Output is correct
38 Correct 295 ms 74588 KB Output is correct
39 Correct 403 ms 71264 KB Output is correct
40 Correct 292 ms 57464 KB Output is correct
41 Correct 371 ms 70620 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 28024 KB Output is correct
2 Correct 35 ms 28024 KB Output is correct
3 Correct 35 ms 27896 KB Output is correct
4 Correct 34 ms 27996 KB Output is correct
5 Correct 35 ms 27972 KB Output is correct
6 Correct 36 ms 28152 KB Output is correct
7 Correct 36 ms 28024 KB Output is correct
8 Correct 35 ms 28024 KB Output is correct
9 Correct 35 ms 28024 KB Output is correct
10 Correct 36 ms 28024 KB Output is correct
11 Correct 38 ms 28256 KB Output is correct
12 Correct 39 ms 28792 KB Output is correct
13 Correct 40 ms 28792 KB Output is correct
14 Correct 43 ms 28920 KB Output is correct
15 Correct 46 ms 28888 KB Output is correct
16 Correct 40 ms 29048 KB Output is correct
17 Correct 45 ms 28924 KB Output is correct
18 Correct 42 ms 29176 KB Output is correct
19 Correct 2037 ms 210580 KB Output is correct
20 Correct 2000 ms 210732 KB Output is correct
21 Correct 1998 ms 210584 KB Output is correct
22 Correct 1962 ms 210716 KB Output is correct
23 Correct 2887 ms 262144 KB Output is correct
24 Correct 189 ms 46200 KB Output is correct
25 Correct 171 ms 46200 KB Output is correct
26 Correct 216 ms 51232 KB Output is correct
27 Correct 220 ms 51320 KB Output is correct
28 Correct 225 ms 51192 KB Output is correct
29 Correct 151 ms 50808 KB Output is correct
30 Correct 150 ms 50936 KB Output is correct
31 Correct 186 ms 49304 KB Output is correct
32 Correct 80 ms 28284 KB Output is correct
33 Correct 179 ms 49500 KB Output is correct
34 Correct 394 ms 64476 KB Output is correct
35 Correct 434 ms 64504 KB Output is correct
36 Correct 400 ms 64376 KB Output is correct
37 Correct 338 ms 64664 KB Output is correct
38 Correct 358 ms 64504 KB Output is correct
39 Correct 433 ms 74652 KB Output is correct
40 Correct 425 ms 74616 KB Output is correct
41 Correct 625 ms 74676 KB Output is correct
42 Correct 566 ms 74488 KB Output is correct
43 Correct 506 ms 74628 KB Output is correct
44 Correct 560 ms 74432 KB Output is correct
45 Correct 491 ms 74728 KB Output is correct
46 Correct 502 ms 74712 KB Output is correct
47 Correct 477 ms 74744 KB Output is correct
48 Correct 492 ms 74540 KB Output is correct
49 Correct 304 ms 74760 KB Output is correct
50 Correct 292 ms 74488 KB Output is correct
51 Correct 288 ms 74616 KB Output is correct
52 Correct 303 ms 74460 KB Output is correct
53 Correct 295 ms 74588 KB Output is correct
54 Correct 403 ms 71264 KB Output is correct
55 Correct 292 ms 57464 KB Output is correct
56 Correct 371 ms 70620 KB Output is correct
57 Correct 2024 ms 244292 KB Output is correct
58 Correct 2067 ms 244148 KB Output is correct
59 Correct 1848 ms 244020 KB Output is correct
60 Correct 1927 ms 244088 KB Output is correct
61 Correct 1903 ms 244176 KB Output is correct
62 Correct 1921 ms 244092 KB Output is correct
63 Correct 2196 ms 262144 KB Output is correct
64 Correct 2067 ms 262144 KB Output is correct
65 Execution timed out 3040 ms 262144 KB Time limit exceeded
66 Halted 0 ms 0 KB -