oj.uz

Submission #787796

# Submission time Handle Problem Language Result Execution time Memory
787796 2023-07-19T12:45:12 Z andrei_boaca Radio Towers (IOI22_towers) C++17
37 / 100
 4000 ms 33168 KB 
#include "towers.h"
#include <bits/stdc++.h>
//#include "stub.cpp"
using namespace std;
typedef pair<int,int> pii;
int n;
int v[100005];
int rmq[22][100005];
int loga[100005];
int lft[100005],rgt[100005];
int tolft[100005];
int getmax(int l,int r)
{
    int lg=loga[r-l+1];
    return max(rmq[lg][l],rmq[lg][r-(1<<lg)+1]);
}
int getR(int poz,int delta)
{
    int st=poz+2;
    int dr=n;
    int ans=1e9;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(getmax(poz+1,mij-1)-delta>=v[poz])
        {
            ans=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    return ans;
}
int getL(int poz,int delta)
{
    int st=1;
    int dr=poz-2;
    int ans=0;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(getmax(mij+1,poz-1)-delta>=v[poz])
        {
            ans=mij;
            st=mij+1;
        }
        else
            dr=mij-1;
    }
    return ans;
}
int bin[22][100005];
int rmin[22][100005];
int uplft[100005];
int getmin(int l,int r)
{
    int lg=loga[r-l+1];
    return min(rmin[lg][l],rmin[lg][r-(1<<lg)+1]);
}
void init(int N, std::vector<int> H) {
    n=N;
    for(int i=1;i<=n;i++)
    {
        v[i]=H[i-1];
        for(int j=0;j<=20;j++)
            if((1<<j)<=i)
                loga[i]=j;
    }
    for(int i=n;i>=1;i--)
    {
        rmq[0][i]=v[i];
        rmin[0][i]=v[i];
        for(int j=1;j<=20;j++)
        {
            rmq[j][i]=rmq[j-1][i];
            rmin[j][i]=rmin[j-1][i];
            int poz=i+(1<<(j-1));
            if(poz<=n)
            {
                rmq[j][i]=max(rmq[j][i],rmq[j-1][poz]);
                rmin[j][i]=min(rmin[j][i],rmin[j-1][poz]);
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(v[i]<=v[i-1])
            tolft[i]=i;
        else
            tolft[i]=tolft[i-1];
    }
    for(int i=1;i<=n;i++)
    {
        uplft[i]=i;
        if(v[i-1]>=v[i])
            uplft[i]=uplft[i-1];
    }
    for(int i=1;i<=n;i++)
    {
        lft[i]=getL(i,1)+1;
        lft[i]=uplft[lft[i]]-1;
        lft[i]=tolft[lft[i]];
        bin[0][i]=lft[i];
        for(int j=1;j<=20;j++)
            bin[j][i]=bin[j-1][bin[j-1][i]];
    }
}
int dp[100005];
int arb[4*100005];
vector<int> add[100005];
void update(int nod,int st,int dr,int poz,int val)
{
    if(st==dr)
    {
        arb[nod]=val;
        return;
    }
    int mij=(st+dr)/2;
    if(poz<=mij)
        update(nod*2,st,mij,poz,val);
    else
        update(nod*2+1,mij+1,dr,poz,val);
    arb[nod]=max(arb[nod*2],arb[nod*2+1]);
}
int query(int nod,int st,int dr,int a,int b)
{
    if(st>=a&&dr<=b)
        return arb[nod];
    int mij=(st+dr)/2;
    int rez=0;
    if(a<=mij)
        rez=max(rez,query(nod*2,st,mij,a,b));
    if(b>mij)
        rez=max(rez,query(nod*2+1,mij+1,dr,a,b));
    return rez;
}
int max_towers(int L, int R, int D)
{
    L++;
    R++;
    if(D==1)
    {
        int rez=1;
        int nod=tolft[R];
        for(int j=20;j>=0;j--)
            if(bin[j][nod]>=L)
            {
                rez+=(1<<j);
                nod=bin[j][nod];
            }
        int l=getL(nod,1)+1;
        l=uplft[l];
        int st=L;
        int dr=l-1;
        if(st<=dr)
        {
            if(getmin(st,dr)<v[l])
                rez++;
        }
        return rez;
    }
    for(int i=1;i<=4*n;i++)
        arb[i]=0;
    for(int i=1;i<=n;i++)
        add[i].clear();
    int ans=1;
    for(int i=L;i<=R;i++)
    {
        for(int j:add[i])
            update(1,1,n,j,dp[j]);
        dp[i]=1;
        int r=getR(i,D);
        int l=getL(i,D);
        if(l>=L)
            dp[i]=1+query(1,1,n,L,l);
        ans=max(ans,dp[i]);
        if(r<=R)
            add[r].push_back(i);
    }
    //assert(dp[tolft[R]]==ans);
    return ans;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4078 ms 22004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 3 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 3 ms 3536 KB Output is correct
6 Correct 2 ms 3536 KB Output is correct
7 Correct 2 ms 3536 KB Output is correct
8 Correct 2 ms 3536 KB Output is correct
9 Correct 2 ms 3536 KB Output is correct
10 Correct 3 ms 3536 KB Output is correct
11 Correct 2 ms 3536 KB Output is correct
12 Correct 1 ms 2896 KB Output is correct
13 Correct 2 ms 3408 KB Output is correct
14 Correct 2 ms 3408 KB Output is correct
15 Correct 2 ms 3408 KB Output is correct
16 Correct 2 ms 3408 KB Output is correct
17 Correct 2 ms 3408 KB Output is correct
18 Correct 3 ms 3408 KB Output is correct
19 Correct 2 ms 3408 KB Output is correct
20 Correct 2 ms 3408 KB Output is correct
21 Correct 2 ms 3408 KB Output is correct
22 Correct 2 ms 3408 KB Output is correct
23 Correct 2 ms 3408 KB Output is correct
24 Correct 2 ms 3408 KB Output is correct
25 Correct 2 ms 3152 KB Output is correct
26 Correct 2 ms 3536 KB Output is correct
27 Correct 2 ms 3536 KB Output is correct
28 Correct 3 ms 3536 KB Output is correct
29 Correct 2 ms 3536 KB Output is correct
30 Correct 2 ms 3536 KB Output is correct
31 Correct 2 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 2 ms 3536 KB Output is correct
34 Correct 2 ms 3536 KB Output is correct
35 Correct 3 ms 3536 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 3 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 3 ms 3536 KB Output is correct
6 Correct 2 ms 3536 KB Output is correct
7 Correct 2 ms 3536 KB Output is correct
8 Correct 2 ms 3536 KB Output is correct
9 Correct 2 ms 3536 KB Output is correct
10 Correct 3 ms 3536 KB Output is correct
11 Correct 2 ms 3536 KB Output is correct
12 Correct 1 ms 2896 KB Output is correct
13 Correct 2 ms 3408 KB Output is correct
14 Correct 2 ms 3408 KB Output is correct
15 Correct 2 ms 3408 KB Output is correct
16 Correct 2 ms 3408 KB Output is correct
17 Correct 2 ms 3408 KB Output is correct
18 Correct 3 ms 3408 KB Output is correct
19 Correct 2 ms 3408 KB Output is correct
20 Correct 2 ms 3408 KB Output is correct
21 Correct 2 ms 3408 KB Output is correct
22 Correct 2 ms 3408 KB Output is correct
23 Correct 2 ms 3408 KB Output is correct
24 Correct 2 ms 3408 KB Output is correct
25 Correct 2 ms 3152 KB Output is correct
26 Correct 2 ms 3536 KB Output is correct
27 Correct 2 ms 3536 KB Output is correct
28 Correct 3 ms 3536 KB Output is correct
29 Correct 2 ms 3536 KB Output is correct
30 Correct 2 ms 3536 KB Output is correct
31 Correct 2 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 2 ms 3536 KB Output is correct
34 Correct 2 ms 3536 KB Output is correct
35 Correct 3 ms 3536 KB Output is correct
36 Correct 35 ms 21844 KB Output is correct
37 Correct 45 ms 31424 KB Output is correct
38 Correct 47 ms 31424 KB Output is correct
39 Correct 52 ms 31316 KB Output is correct
40 Correct 41 ms 31368 KB Output is correct
41 Correct 58 ms 32248 KB Output is correct
42 Correct 47 ms 31204 KB Output is correct
43 Correct 44 ms 31936 KB Output is correct
44 Correct 40 ms 31208 KB Output is correct
45 Correct 41 ms 31168 KB Output is correct
46 Correct 39 ms 31184 KB Output is correct
47 Correct 36 ms 29952 KB Output is correct
48 Correct 35 ms 30048 KB Output is correct
49 Correct 44 ms 30052 KB Output is correct
50 Correct 36 ms 30020 KB Output is correct
51 Correct 33 ms 30036 KB Output is correct
52 Correct 37 ms 29996 KB Output is correct
53 Correct 33 ms 30000 KB Output is correct
54 Correct 36 ms 30048 KB Output is correct
55 Correct 35 ms 30056 KB Output is correct
56 Correct 35 ms 30024 KB Output is correct
57 Correct 82 ms 31312 KB Output is correct
58 Correct 61 ms 32408 KB Output is correct
59 Correct 71 ms 32600 KB Output is correct
60 Correct 74 ms 33168 KB Output is correct
61 Correct 95 ms 32980 KB Output is correct
62 Correct 66 ms 32688 KB Output is correct
63 Correct 68 ms 33004 KB Output is correct
64 Correct 63 ms 32312 KB Output is correct
65 Correct 58 ms 31564 KB Output is correct
66 Correct 66 ms 32488 KB Output is correct
67 Correct 50 ms 31576 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 636 ms 29940 KB Output is correct
2 Correct 1010 ms 30044 KB Output is correct
3 Correct 964 ms 29976 KB Output is correct
4 Correct 1042 ms 30036 KB Output is correct
5 Correct 800 ms 30036 KB Output is correct
6 Correct 1014 ms 30024 KB Output is correct
7 Correct 867 ms 29948 KB Output is correct
8 Correct 849 ms 29952 KB Output is correct
9 Correct 776 ms 30024 KB Output is correct
10 Correct 794 ms 30008 KB Output is correct
11 Correct 739 ms 30024 KB Output is correct
12 Correct 640 ms 30036 KB Output is correct
13 Correct 681 ms 30020 KB Output is correct
14 Correct 1 ms 2896 KB Output is correct
15 Correct 2 ms 3408 KB Output is correct
16 Correct 2 ms 3408 KB Output is correct
17 Correct 44 ms 30012 KB Output is correct
18 Correct 38 ms 30032 KB Output is correct
19 Correct 37 ms 30020 KB Output is correct
20 Correct 39 ms 30036 KB Output is correct
21 Correct 34 ms 30032 KB Output is correct
22 Correct 38 ms 30040 KB Output is correct
23 Correct 37 ms 30032 KB Output is correct
24 Correct 39 ms 30140 KB Output is correct
25 Correct 38 ms 29952 KB Output is correct
26 Correct 40 ms 30004 KB Output is correct
27 Correct 2 ms 3408 KB Output is correct
28 Correct 2 ms 3408 KB Output is correct
29 Correct 2 ms 3408 KB Output is correct
30 Correct 2 ms 3408 KB Output is correct
31 Correct 2 ms 3408 KB Output is correct
32 Correct 2 ms 3408 KB Output is correct
33 Correct 2 ms 3408 KB Output is correct
34 Correct 2 ms 3408 KB Output is correct
35 Correct 2 ms 3408 KB Output is correct
36 Correct 2 ms 3412 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4085 ms 10376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 3 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 3 ms 3536 KB Output is correct
6 Correct 2 ms 3536 KB Output is correct
7 Correct 2 ms 3536 KB Output is correct
8 Correct 2 ms 3536 KB Output is correct
9 Correct 2 ms 3536 KB Output is correct
10 Correct 3 ms 3536 KB Output is correct
11 Correct 2 ms 3536 KB Output is correct
12 Correct 1 ms 2896 KB Output is correct
13 Correct 2 ms 3408 KB Output is correct
14 Correct 2 ms 3408 KB Output is correct
15 Correct 2 ms 3408 KB Output is correct
16 Correct 2 ms 3408 KB Output is correct
17 Correct 2 ms 3408 KB Output is correct
18 Correct 3 ms 3408 KB Output is correct
19 Correct 2 ms 3408 KB Output is correct
20 Correct 2 ms 3408 KB Output is correct
21 Correct 2 ms 3408 KB Output is correct
22 Correct 2 ms 3408 KB Output is correct
23 Correct 2 ms 3408 KB Output is correct
24 Correct 2 ms 3408 KB Output is correct
25 Correct 2 ms 3152 KB Output is correct
26 Correct 2 ms 3536 KB Output is correct
27 Correct 2 ms 3536 KB Output is correct
28 Correct 3 ms 3536 KB Output is correct
29 Correct 2 ms 3536 KB Output is correct
30 Correct 2 ms 3536 KB Output is correct
31 Correct 2 ms 3540 KB Output is correct
32 Correct 3 ms 3540 KB Output is correct
33 Correct 2 ms 3536 KB Output is correct
34 Correct 2 ms 3536 KB Output is correct
35 Correct 3 ms 3536 KB Output is correct
36 Correct 35 ms 21844 KB Output is correct
37 Correct 45 ms 31424 KB Output is correct
38 Correct 47 ms 31424 KB Output is correct
39 Correct 52 ms 31316 KB Output is correct
40 Correct 41 ms 31368 KB Output is correct
41 Correct 58 ms 32248 KB Output is correct
42 Correct 47 ms 31204 KB Output is correct
43 Correct 44 ms 31936 KB Output is correct
44 Correct 40 ms 31208 KB Output is correct
45 Correct 41 ms 31168 KB Output is correct
46 Correct 39 ms 31184 KB Output is correct
47 Correct 36 ms 29952 KB Output is correct
48 Correct 35 ms 30048 KB Output is correct
49 Correct 44 ms 30052 KB Output is correct
50 Correct 36 ms 30020 KB Output is correct
51 Correct 33 ms 30036 KB Output is correct
52 Correct 37 ms 29996 KB Output is correct
53 Correct 33 ms 30000 KB Output is correct
54 Correct 36 ms 30048 KB Output is correct
55 Correct 35 ms 30056 KB Output is correct
56 Correct 35 ms 30024 KB Output is correct
57 Correct 82 ms 31312 KB Output is correct
58 Correct 61 ms 32408 KB Output is correct
59 Correct 71 ms 32600 KB Output is correct
60 Correct 74 ms 33168 KB Output is correct
61 Correct 95 ms 32980 KB Output is correct
62 Correct 66 ms 32688 KB Output is correct
63 Correct 68 ms 33004 KB Output is correct
64 Correct 63 ms 32312 KB Output is correct
65 Correct 58 ms 31564 KB Output is correct
66 Correct 66 ms 32488 KB Output is correct
67 Correct 50 ms 31576 KB Output is correct
68 Correct 636 ms 29940 KB Output is correct
69 Correct 1010 ms 30044 KB Output is correct
70 Correct 964 ms 29976 KB Output is correct
71 Correct 1042 ms 30036 KB Output is correct
72 Correct 800 ms 30036 KB Output is correct
73 Correct 1014 ms 30024 KB Output is correct
74 Correct 867 ms 29948 KB Output is correct
75 Correct 849 ms 29952 KB Output is correct
76 Correct 776 ms 30024 KB Output is correct
77 Correct 794 ms 30008 KB Output is correct
78 Correct 739 ms 30024 KB Output is correct
79 Correct 640 ms 30036 KB Output is correct
80 Correct 681 ms 30020 KB Output is correct
81 Correct 1 ms 2896 KB Output is correct
82 Correct 2 ms 3408 KB Output is correct
83 Correct 2 ms 3408 KB Output is correct
84 Correct 44 ms 30012 KB Output is correct
85 Correct 38 ms 30032 KB Output is correct
86 Correct 37 ms 30020 KB Output is correct
87 Correct 39 ms 30036 KB Output is correct
88 Correct 34 ms 30032 KB Output is correct
89 Correct 38 ms 30040 KB Output is correct
90 Correct 37 ms 30032 KB Output is correct
91 Correct 39 ms 30140 KB Output is correct
92 Correct 38 ms 29952 KB Output is correct
93 Correct 40 ms 30004 KB Output is correct
94 Correct 2 ms 3408 KB Output is correct
95 Correct 2 ms 3408 KB Output is correct
96 Correct 2 ms 3408 KB Output is correct
97 Correct 2 ms 3408 KB Output is correct
98 Correct 2 ms 3408 KB Output is correct
99 Correct 2 ms 3408 KB Output is correct
100 Correct 2 ms 3408 KB Output is correct
101 Correct 2 ms 3408 KB Output is correct
102 Correct 2 ms 3408 KB Output is correct
103 Correct 2 ms 3412 KB Output is correct
104 Execution timed out 4009 ms 29728 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4078 ms 22004 KB Time limit exceeded
2 Halted 0 ms 0 KB -