oj.uz

Submission #786965

# Submission time Handle Problem Language Result Execution time Memory
786965 2023-07-18T15:49:12 Z andrei_boaca Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 17072 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];
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];
        for(int j=1;j<=20;j++)
        {
            rmq[j][i]=rmq[j-1][i];
            int poz=i+(1<<(j-1));
            if(poz<=n)
                rmq[j][i]=max(rmq[j][i],rmq[j-1][poz]);
        }
    }
}
int dp[100005];
int arb[4*100005];
vector<int> add[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)
{
    bool ok=0;
    if(poz==4)
        ok=1;
    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;
}
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++;
    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);
    }
    return ans;
}

Compilation message

towers.cpp: In function 'int getL(int, int)':
towers.cpp:59:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   59 |     bool ok=0;
      |          ^~

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2768 KB Output is correct
2 Correct 2 ms 2896 KB Output is correct
3 Correct 2 ms 2964 KB Output is correct
4 Correct 2 ms 2896 KB Output is correct
5 Correct 2 ms 2896 KB Output is correct
6 Correct 2 ms 2896 KB Output is correct
7 Correct 2 ms 2892 KB Output is correct
8 Correct 2 ms 2896 KB Output is correct
9 Correct 2 ms 2896 KB Output is correct
10 Correct 2 ms 2896 KB Output is correct
11 Correct 2 ms 2896 KB Output is correct
12 Correct 2 ms 2768 KB Output is correct
13 Correct 2 ms 2896 KB Output is correct
14 Correct 2 ms 2896 KB Output is correct
15 Correct 2 ms 2896 KB Output is correct
16 Correct 2 ms 2896 KB Output is correct
17 Correct 2 ms 2896 KB Output is correct
18 Correct 2 ms 2896 KB Output is correct
19 Correct 2 ms 2896 KB Output is correct
20 Correct 2 ms 3024 KB Output is correct
21 Correct 2 ms 3024 KB Output is correct
22 Correct 2 ms 3024 KB Output is correct
23 Correct 2 ms 2896 KB Output is correct
24 Correct 2 ms 3024 KB Output is correct
25 Correct 1 ms 2768 KB Output is correct
26 Correct 2 ms 2896 KB Output is correct
27 Correct 2 ms 2896 KB Output is correct
28 Correct 3 ms 2896 KB Output is correct
29 Correct 2 ms 2896 KB Output is correct
30 Correct 2 ms 2896 KB Output is correct
31 Correct 2 ms 2896 KB Output is correct
32 Correct 2 ms 3024 KB Output is correct
33 Correct 2 ms 2896 KB Output is correct
34 Correct 2 ms 2896 KB Output is correct
35 Correct 2 ms 2896 KB Output is correct
36 Correct 19 ms 10208 KB Output is correct
37 Correct 31 ms 13804 KB Output is correct
38 Correct 23 ms 13780 KB Output is correct
39 Correct 22 ms 13760 KB Output is correct
40 Correct 28 ms 13772 KB Output is correct
41 Correct 46 ms 14652 KB Output is correct
42 Correct 20 ms 13644 KB Output is correct
43 Correct 35 ms 14284 KB Output is correct
44 Correct 24 ms 13660 KB Output is correct
45 Correct 18 ms 13596 KB Output is correct
46 Correct 18 ms 13548 KB Output is correct
47 Correct 31 ms 14268 KB Output is correct
48 Correct 33 ms 14028 KB Output is correct
49 Correct 22 ms 13756 KB Output is correct
50 Correct 24 ms 13600 KB Output is correct
51 Correct 27 ms 14920 KB Output is correct
52 Correct 59 ms 15604 KB Output is correct
53 Correct 52 ms 15576 KB Output is correct
54 Correct 52 ms 15568 KB Output is correct
55 Correct 37 ms 13900 KB Output is correct
56 Correct 45 ms 17072 KB Output is correct
57 Correct 40 ms 14156 KB Output is correct
58 Correct 51 ms 14724 KB Output is correct
59 Correct 48 ms 15064 KB Output is correct
60 Correct 59 ms 15536 KB Output is correct
61 Correct 55 ms 15364 KB Output is correct
62 Correct 44 ms 15080 KB Output is correct
63 Correct 47 ms 15456 KB Output is correct
64 Correct 39 ms 14812 KB Output is correct
65 Correct 39 ms 13892 KB Output is correct
66 Correct 50 ms 14796 KB Output is correct
67 Correct 31 ms 13900 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2768 KB Output is correct
2 Correct 2 ms 2896 KB Output is correct
3 Correct 2 ms 2964 KB Output is correct
4 Correct 2 ms 2896 KB Output is correct
5 Correct 2 ms 2896 KB Output is correct
6 Correct 2 ms 2896 KB Output is correct
7 Correct 2 ms 2892 KB Output is correct
8 Correct 2 ms 2896 KB Output is correct
9 Correct 2 ms 2896 KB Output is correct
10 Correct 2 ms 2896 KB Output is correct
11 Correct 2 ms 2896 KB Output is correct
12 Correct 2 ms 2768 KB Output is correct
13 Correct 2 ms 2896 KB Output is correct
14 Correct 2 ms 2896 KB Output is correct
15 Correct 2 ms 2896 KB Output is correct
16 Correct 2 ms 2896 KB Output is correct
17 Correct 2 ms 2896 KB Output is correct
18 Correct 2 ms 2896 KB Output is correct
19 Correct 2 ms 2896 KB Output is correct
20 Correct 2 ms 3024 KB Output is correct
21 Correct 2 ms 3024 KB Output is correct
22 Correct 2 ms 3024 KB Output is correct
23 Correct 2 ms 2896 KB Output is correct
24 Correct 2 ms 3024 KB Output is correct
25 Correct 1 ms 2768 KB Output is correct
26 Correct 2 ms 2896 KB Output is correct
27 Correct 2 ms 2896 KB Output is correct
28 Correct 3 ms 2896 KB Output is correct
29 Correct 2 ms 2896 KB Output is correct
30 Correct 2 ms 2896 KB Output is correct
31 Correct 2 ms 2896 KB Output is correct
32 Correct 2 ms 3024 KB Output is correct
33 Correct 2 ms 2896 KB Output is correct
34 Correct 2 ms 2896 KB Output is correct
35 Correct 2 ms 2896 KB Output is correct
36 Correct 19 ms 10208 KB Output is correct
37 Correct 31 ms 13804 KB Output is correct
38 Correct 23 ms 13780 KB Output is correct
39 Correct 22 ms 13760 KB Output is correct
40 Correct 28 ms 13772 KB Output is correct
41 Correct 46 ms 14652 KB Output is correct
42 Correct 20 ms 13644 KB Output is correct
43 Correct 35 ms 14284 KB Output is correct
44 Correct 24 ms 13660 KB Output is correct
45 Correct 18 ms 13596 KB Output is correct
46 Correct 18 ms 13548 KB Output is correct
47 Correct 31 ms 14268 KB Output is correct
48 Correct 33 ms 14028 KB Output is correct
49 Correct 22 ms 13756 KB Output is correct
50 Correct 24 ms 13600 KB Output is correct
51 Correct 27 ms 14920 KB Output is correct
52 Correct 59 ms 15604 KB Output is correct
53 Correct 52 ms 15576 KB Output is correct
54 Correct 52 ms 15568 KB Output is correct
55 Correct 37 ms 13900 KB Output is correct
56 Correct 45 ms 17072 KB Output is correct
57 Correct 40 ms 14156 KB Output is correct
58 Correct 51 ms 14724 KB Output is correct
59 Correct 48 ms 15064 KB Output is correct
60 Correct 59 ms 15536 KB Output is correct
61 Correct 55 ms 15364 KB Output is correct
62 Correct 44 ms 15080 KB Output is correct
63 Correct 47 ms 15456 KB Output is correct
64 Correct 39 ms 14812 KB Output is correct
65 Correct 39 ms 13892 KB Output is correct
66 Correct 50 ms 14796 KB Output is correct
67 Correct 31 ms 13900 KB Output is correct
68 Execution timed out 4032 ms 15700 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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