oj.uz

답안 #153690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153690 2019-09-15T06:41:55 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 35 ms 27992 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 42 ms 27896 KB Output is correct
4 Correct 36 ms 27908 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 35 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 34 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 35 ms 28024 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 27992 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 42 ms 27896 KB Output is correct
4 Correct 36 ms 27908 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 35 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 34 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 35 ms 28024 KB Output is correct
11 Correct 37 ms 28264 KB Output is correct
12 Correct 40 ms 28792 KB Output is correct
13 Correct 39 ms 28772 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 42 ms 28792 KB Output is correct
16 Correct 39 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29048 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2207 ms 210792 KB Output is correct
2 Correct 2049 ms 210736 KB Output is correct
3 Correct 2027 ms 210716 KB Output is correct
4 Correct 2021 ms 210648 KB Output is correct
5 Correct 2908 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 191 ms 46200 KB Output is correct
2 Correct 172 ms 46200 KB Output is correct
3 Correct 215 ms 51232 KB Output is correct
4 Correct 216 ms 51380 KB Output is correct
5 Correct 213 ms 51320 KB Output is correct
6 Correct 148 ms 50924 KB Output is correct
7 Correct 144 ms 51016 KB Output is correct
8 Correct 182 ms 49320 KB Output is correct
9 Correct 81 ms 28280 KB Output is correct
10 Correct 183 ms 49500 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 27992 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 42 ms 27896 KB Output is correct
4 Correct 36 ms 27908 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 35 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 34 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 35 ms 28024 KB Output is correct
11 Correct 37 ms 28264 KB Output is correct
12 Correct 40 ms 28792 KB Output is correct
13 Correct 39 ms 28772 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 42 ms 28792 KB Output is correct
16 Correct 39 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29048 KB Output is correct
19 Correct 400 ms 64752 KB Output is correct
20 Correct 399 ms 64552 KB Output is correct
21 Correct 344 ms 64532 KB Output is correct
22 Correct 344 ms 64472 KB Output is correct
23 Correct 352 ms 64488 KB Output is correct
24 Correct 381 ms 74520 KB Output is correct
25 Correct 390 ms 74744 KB Output is correct
26 Correct 464 ms 74544 KB Output is correct
27 Correct 451 ms 74612 KB Output is correct
28 Correct 470 ms 74616 KB Output is correct
29 Correct 467 ms 74568 KB Output is correct
30 Correct 472 ms 74708 KB Output is correct
31 Correct 478 ms 74648 KB Output is correct
32 Correct 486 ms 74568 KB Output is correct
33 Correct 472 ms 74532 KB Output is correct
34 Correct 286 ms 74448 KB Output is correct
35 Correct 286 ms 74500 KB Output is correct
36 Correct 340 ms 74624 KB Output is correct
37 Correct 281 ms 74452 KB Output is correct
38 Correct 284 ms 74544 KB Output is correct
39 Correct 408 ms 71284 KB Output is correct
40 Correct 293 ms 57496 KB Output is correct
41 Correct 375 ms 70420 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 27992 KB Output is correct
2 Correct 35 ms 27896 KB Output is correct
3 Correct 42 ms 27896 KB Output is correct
4 Correct 36 ms 27908 KB Output is correct
5 Correct 34 ms 28024 KB Output is correct
6 Correct 35 ms 28024 KB Output is correct
7 Correct 35 ms 28024 KB Output is correct
8 Correct 34 ms 28024 KB Output is correct
9 Correct 34 ms 28024 KB Output is correct
10 Correct 35 ms 28024 KB Output is correct
11 Correct 37 ms 28264 KB Output is correct
12 Correct 40 ms 28792 KB Output is correct
13 Correct 39 ms 28772 KB Output is correct
14 Correct 41 ms 28792 KB Output is correct
15 Correct 42 ms 28792 KB Output is correct
16 Correct 39 ms 29048 KB Output is correct
17 Correct 38 ms 28792 KB Output is correct
18 Correct 40 ms 29048 KB Output is correct
19 Correct 2207 ms 210792 KB Output is correct
20 Correct 2049 ms 210736 KB Output is correct
21 Correct 2027 ms 210716 KB Output is correct
22 Correct 2021 ms 210648 KB Output is correct
23 Correct 2908 ms 262144 KB Output is correct
24 Correct 191 ms 46200 KB Output is correct
25 Correct 172 ms 46200 KB Output is correct
26 Correct 215 ms 51232 KB Output is correct
27 Correct 216 ms 51380 KB Output is correct
28 Correct 213 ms 51320 KB Output is correct
29 Correct 148 ms 50924 KB Output is correct
30 Correct 144 ms 51016 KB Output is correct
31 Correct 182 ms 49320 KB Output is correct
32 Correct 81 ms 28280 KB Output is correct
33 Correct 183 ms 49500 KB Output is correct
34 Correct 400 ms 64752 KB Output is correct
35 Correct 399 ms 64552 KB Output is correct
36 Correct 344 ms 64532 KB Output is correct
37 Correct 344 ms 64472 KB Output is correct
38 Correct 352 ms 64488 KB Output is correct
39 Correct 381 ms 74520 KB Output is correct
40 Correct 390 ms 74744 KB Output is correct
41 Correct 464 ms 74544 KB Output is correct
42 Correct 451 ms 74612 KB Output is correct
43 Correct 470 ms 74616 KB Output is correct
44 Correct 467 ms 74568 KB Output is correct
45 Correct 472 ms 74708 KB Output is correct
46 Correct 478 ms 74648 KB Output is correct
47 Correct 486 ms 74568 KB Output is correct
48 Correct 472 ms 74532 KB Output is correct
49 Correct 286 ms 74448 KB Output is correct
50 Correct 286 ms 74500 KB Output is correct
51 Correct 340 ms 74624 KB Output is correct
52 Correct 281 ms 74452 KB Output is correct
53 Correct 284 ms 74544 KB Output is correct
54 Correct 408 ms 71284 KB Output is correct
55 Correct 293 ms 57496 KB Output is correct
56 Correct 375 ms 70420 KB Output is correct
57 Correct 2059 ms 210548 KB Output is correct
58 Correct 2072 ms 210608 KB Output is correct
59 Correct 1881 ms 210492 KB Output is correct
60 Correct 2037 ms 210564 KB Output is correct
61 Correct 1912 ms 210636 KB Output is correct
62 Correct 1922 ms 210532 KB Output is correct
63 Correct 2008 ms 262144 KB Output is correct
64 Correct 1976 ms 262144 KB Output is correct
65 Correct 2766 ms 262144 KB Output is correct
66 Correct 2773 ms 262144 KB Output is correct
67 Execution timed out 3027 ms 262144 KB Time limit exceeded
68 Halted 0 ms 0 KB -