oj.uz

Submission #153682

# Submission time Handle Problem Language Result Execution time Memory
153682 2019-09-15T06:20:29 Z semiauto Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 2074 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[1000001],tree[2048*1024];
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() {
    for (i=0;i<=1000000;i++)
        {for (j=0;j<=19;j++)
    p[i][j]={0,0};mas[i]=0;par[i]=0;val[i]=0;hey[i]=0;v[i].clear();}
    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:35:10: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         {for (j=0;j<=19;j++)
          ^~~
sortbooks.cpp:36:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     p[i][j]={0,0};mas[i]=0;par[i]=0;val[i]=0;hey[i]=0;v[i].clear();}
                   ^~~
sortbooks.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<(v[0].size());i++)
              ~^~~~~~~~~~~~~~
sortbooks.cpp:39: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

# Verdict Execution time Memory Grader output
1 Correct 185 ms 200068 KB Output is correct
2 Correct 188 ms 200220 KB Output is correct
3 Correct 187 ms 200156 KB Output is correct
4 Correct 186 ms 200056 KB Output is correct
5 Correct 188 ms 200184 KB Output is correct
6 Correct 188 ms 200092 KB Output is correct
7 Correct 198 ms 200152 KB Output is correct
8 Correct 188 ms 200200 KB Output is correct
9 Correct 187 ms 200124 KB Output is correct
10 Correct 188 ms 200108 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 200068 KB Output is correct
2 Correct 188 ms 200220 KB Output is correct
3 Correct 187 ms 200156 KB Output is correct
4 Correct 186 ms 200056 KB Output is correct
5 Correct 188 ms 200184 KB Output is correct
6 Correct 188 ms 200092 KB Output is correct
7 Correct 198 ms 200152 KB Output is correct
8 Correct 188 ms 200200 KB Output is correct
9 Correct 187 ms 200124 KB Output is correct
10 Correct 188 ms 200108 KB Output is correct
11 Correct 189 ms 200156 KB Output is correct
12 Correct 190 ms 200184 KB Output is correct
13 Correct 193 ms 200312 KB Output is correct
14 Correct 194 ms 200184 KB Output is correct
15 Correct 211 ms 200164 KB Output is correct
16 Correct 194 ms 200312 KB Output is correct
17 Correct 192 ms 200400 KB Output is correct
18 Correct 192 ms 200416 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2005 ms 222508 KB Output is correct
2 Correct 2074 ms 222388 KB Output is correct
3 Correct 2044 ms 222376 KB Output is correct
4 Correct 1982 ms 222356 KB Output is correct
5 Runtime error 772 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 331 ms 202388 KB Output is correct
2 Correct 314 ms 202448 KB Output is correct
3 Correct 364 ms 206968 KB Output is correct
4 Correct 363 ms 207068 KB Output is correct
5 Correct 352 ms 207224 KB Output is correct
6 Correct 291 ms 206712 KB Output is correct
7 Correct 289 ms 206712 KB Output is correct
8 Correct 337 ms 205324 KB Output is correct
9 Correct 232 ms 200304 KB Output is correct
10 Correct 320 ms 205364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 200068 KB Output is correct
2 Correct 188 ms 200220 KB Output is correct
3 Correct 187 ms 200156 KB Output is correct
4 Correct 186 ms 200056 KB Output is correct
5 Correct 188 ms 200184 KB Output is correct
6 Correct 188 ms 200092 KB Output is correct
7 Correct 198 ms 200152 KB Output is correct
8 Correct 188 ms 200200 KB Output is correct
9 Correct 187 ms 200124 KB Output is correct
10 Correct 188 ms 200108 KB Output is correct
11 Correct 189 ms 200156 KB Output is correct
12 Correct 190 ms 200184 KB Output is correct
13 Correct 193 ms 200312 KB Output is correct
14 Correct 194 ms 200184 KB Output is correct
15 Correct 211 ms 200164 KB Output is correct
16 Correct 194 ms 200312 KB Output is correct
17 Correct 192 ms 200400 KB Output is correct
18 Correct 192 ms 200416 KB Output is correct
19 Correct 520 ms 204584 KB Output is correct
20 Correct 559 ms 204536 KB Output is correct
21 Correct 473 ms 204648 KB Output is correct
22 Correct 463 ms 204640 KB Output is correct
23 Correct 515 ms 204532 KB Output is correct
24 Correct 526 ms 213900 KB Output is correct
25 Correct 534 ms 213832 KB Output is correct
26 Correct 595 ms 213968 KB Output is correct
27 Correct 595 ms 214080 KB Output is correct
28 Correct 614 ms 213884 KB Output is correct
29 Correct 619 ms 213896 KB Output is correct
30 Correct 608 ms 213824 KB Output is correct
31 Correct 686 ms 213880 KB Output is correct
32 Correct 640 ms 213912 KB Output is correct
33 Correct 615 ms 213920 KB Output is correct
34 Correct 430 ms 214028 KB Output is correct
35 Correct 418 ms 213956 KB Output is correct
36 Correct 442 ms 213880 KB Output is correct
37 Correct 423 ms 213860 KB Output is correct
38 Correct 422 ms 213880 KB Output is correct
39 Correct 579 ms 210796 KB Output is correct
40 Correct 434 ms 208268 KB Output is correct
41 Correct 506 ms 210216 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 200068 KB Output is correct
2 Correct 188 ms 200220 KB Output is correct
3 Correct 187 ms 200156 KB Output is correct
4 Correct 186 ms 200056 KB Output is correct
5 Correct 188 ms 200184 KB Output is correct
6 Correct 188 ms 200092 KB Output is correct
7 Correct 198 ms 200152 KB Output is correct
8 Correct 188 ms 200200 KB Output is correct
9 Correct 187 ms 200124 KB Output is correct
10 Correct 188 ms 200108 KB Output is correct
11 Correct 189 ms 200156 KB Output is correct
12 Correct 190 ms 200184 KB Output is correct
13 Correct 193 ms 200312 KB Output is correct
14 Correct 194 ms 200184 KB Output is correct
15 Correct 211 ms 200164 KB Output is correct
16 Correct 194 ms 200312 KB Output is correct
17 Correct 192 ms 200400 KB Output is correct
18 Correct 192 ms 200416 KB Output is correct
19 Correct 2005 ms 222508 KB Output is correct
20 Correct 2074 ms 222388 KB Output is correct
21 Correct 2044 ms 222376 KB Output is correct
22 Correct 1982 ms 222356 KB Output is correct
23 Runtime error 772 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)