oj.uz

Submission #153668

# Submission time Handle Problem Language Result Execution time Memory
153668 2019-09-15T06:08:56 Z semiauto Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 2253 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,l,r,ans,N=1024*1024;
int mas[1000001],par[1000001],val[1000001],hey[3000001],tree[3000001];
pair <int,int> p[1000001][20];
vector <int> v[1000001];
void dfs(int u) {
    int i;
    p[u][0]={par[u],val[u]};
    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[hey[r]]>=mas[i])
                break;
        par[i]=hey[r];
        v[hey[r]].push_back(i);
        hey[++r]=i;
    }
    for (i=1;i<=n;i++)
        if (par[i]>(i+1))
            val[i]=mas[i]+solve(i+1+N-1,par[i]-1+N-1,1,N,2*N-1);
    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:13: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:49:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<(v[0].size());i++)
              ~^~~~~~~~~~~~~~
sortbooks.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&(mas[i]));
         ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:52: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 34 ms 28024 KB Output is correct
2 Correct 40 ms 28024 KB Output is correct
3 Correct 34 ms 27996 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 38 ms 28020 KB Output is correct
6 Correct 40 ms 28024 KB Output is correct
7 Correct 41 ms 28024 KB Output is correct
8 Correct 41 ms 27996 KB Output is correct
9 Correct 39 ms 28024 KB Output is correct
10 Correct 35 ms 28028 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 28024 KB Output is correct
2 Correct 40 ms 28024 KB Output is correct
3 Correct 34 ms 27996 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 38 ms 28020 KB Output is correct
6 Correct 40 ms 28024 KB Output is correct
7 Correct 41 ms 28024 KB Output is correct
8 Correct 41 ms 27996 KB Output is correct
9 Correct 39 ms 28024 KB Output is correct
10 Correct 35 ms 28028 KB Output is correct
11 Correct 43 ms 28280 KB Output is correct
12 Correct 45 ms 28920 KB Output is correct
13 Correct 39 ms 28844 KB Output is correct
14 Correct 48 ms 28960 KB Output is correct
15 Correct 46 ms 29048 KB Output is correct
16 Correct 46 ms 29092 KB Output is correct
17 Correct 39 ms 28880 KB Output is correct
18 Correct 40 ms 29120 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2003 ms 218544 KB Output is correct
2 Correct 2253 ms 251392 KB Output is correct
3 Correct 1989 ms 251080 KB Output is correct
4 Correct 1998 ms 251220 KB Output is correct
5 Runtime error 904 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 46964 KB Output is correct
2 Correct 189 ms 47100 KB Output is correct
3 Correct 212 ms 51600 KB Output is correct
4 Correct 215 ms 51704 KB Output is correct
5 Correct 233 ms 51704 KB Output is correct
6 Correct 165 ms 51320 KB Output is correct
7 Correct 152 ms 51328 KB Output is correct
8 Correct 184 ms 49656 KB Output is correct
9 Correct 81 ms 28312 KB Output is correct
10 Correct 187 ms 49912 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 28024 KB Output is correct
2 Correct 40 ms 28024 KB Output is correct
3 Correct 34 ms 27996 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 38 ms 28020 KB Output is correct
6 Correct 40 ms 28024 KB Output is correct
7 Correct 41 ms 28024 KB Output is correct
8 Correct 41 ms 27996 KB Output is correct
9 Correct 39 ms 28024 KB Output is correct
10 Correct 35 ms 28028 KB Output is correct
11 Correct 43 ms 28280 KB Output is correct
12 Correct 45 ms 28920 KB Output is correct
13 Correct 39 ms 28844 KB Output is correct
14 Correct 48 ms 28960 KB Output is correct
15 Correct 46 ms 29048 KB Output is correct
16 Correct 46 ms 29092 KB Output is correct
17 Correct 39 ms 28880 KB Output is correct
18 Correct 40 ms 29120 KB Output is correct
19 Correct 402 ms 66112 KB Output is correct
20 Correct 404 ms 66140 KB Output is correct
21 Correct 342 ms 66196 KB Output is correct
22 Correct 341 ms 66092 KB Output is correct
23 Correct 345 ms 66044 KB Output is correct
24 Correct 403 ms 75384 KB Output is correct
25 Correct 415 ms 75516 KB Output is correct
26 Correct 459 ms 75432 KB Output is correct
27 Correct 532 ms 75364 KB Output is correct
28 Correct 498 ms 75396 KB Output is correct
29 Correct 495 ms 75324 KB Output is correct
30 Correct 483 ms 75548 KB Output is correct
31 Correct 492 ms 75332 KB Output is correct
32 Correct 497 ms 75312 KB Output is correct
33 Correct 500 ms 75384 KB Output is correct
34 Correct 303 ms 75388 KB Output is correct
35 Correct 305 ms 75256 KB Output is correct
36 Correct 304 ms 75492 KB Output is correct
37 Correct 306 ms 75364 KB Output is correct
38 Correct 311 ms 75428 KB Output is correct
39 Correct 418 ms 72312 KB Output is correct
40 Correct 305 ms 57996 KB Output is correct
41 Correct 389 ms 71416 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 28024 KB Output is correct
2 Correct 40 ms 28024 KB Output is correct
3 Correct 34 ms 27996 KB Output is correct
4 Correct 34 ms 28024 KB Output is correct
5 Correct 38 ms 28020 KB Output is correct
6 Correct 40 ms 28024 KB Output is correct
7 Correct 41 ms 28024 KB Output is correct
8 Correct 41 ms 27996 KB Output is correct
9 Correct 39 ms 28024 KB Output is correct
10 Correct 35 ms 28028 KB Output is correct
11 Correct 43 ms 28280 KB Output is correct
12 Correct 45 ms 28920 KB Output is correct
13 Correct 39 ms 28844 KB Output is correct
14 Correct 48 ms 28960 KB Output is correct
15 Correct 46 ms 29048 KB Output is correct
16 Correct 46 ms 29092 KB Output is correct
17 Correct 39 ms 28880 KB Output is correct
18 Correct 40 ms 29120 KB Output is correct
19 Correct 2003 ms 218544 KB Output is correct
20 Correct 2253 ms 251392 KB Output is correct
21 Correct 1989 ms 251080 KB Output is correct
22 Correct 1998 ms 251220 KB Output is correct
23 Runtime error 904 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)