oj.uz

답안 #786996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786996 2023-07-18T16:17:40 Z andrei_boaca 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 198424 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 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;
}
int bin[22][100005];
int maxbin[22][22][100005];
int getmaxbin(int k,int l,int r)
{
    if(r<=0)
        return 0;
    int lg=loga[r-l+1];
    return max(maxbin[k][lg][l],maxbin[k][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];
        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]);
        }
    }
    for(int i=1;i<=n;i++)
    {
        lft[i]=getL(i,1);
        bin[0][i]=lft[i];
        for(int j=1;j<=20;j++)
            bin[j][i]=bin[j-1][bin[j-1][i]];
    }
    for(int k=0;k<=20;k++)
    {
        for(int i=n;i>=1;i--)
        {
            maxbin[k][0][i]=bin[k][i];
            for(int j=1;j<=20;j++)
            {
                maxbin[k][j][i]=maxbin[k][j-1][i];
                int poz=i+(1<<(j-1));
                if(poz<=n)
                    maxbin[k][j][i]=max(maxbin[k][j][i],maxbin[k][j-1][poz]);
            }
        }
    }
}
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 ans=1;
        for(int i=R;i>=L&&i>=R-40;i--)
        {
            int val=1;
            int nod=i;
            for(int j=20;j>=0;j--)
                if(bin[j][nod]>=L)
                {
                    val+=(1<<j);
                    nod=bin[j][nod];
                }
            ans=max(ans,val);
        }
        return ans;
    }*/
    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:36:10: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   36 |     bool ok=0;
      |          ^~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4086 ms 121496 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5712 KB Output is correct
2 Correct 5 ms 8784 KB Output is correct
3 Correct 5 ms 8784 KB Output is correct
4 Correct 5 ms 8804 KB Output is correct
5 Correct 5 ms 8784 KB Output is correct
6 Correct 6 ms 8808 KB Output is correct
7 Correct 6 ms 8784 KB Output is correct
8 Correct 5 ms 8784 KB Output is correct
9 Correct 6 ms 8784 KB Output is correct
10 Correct 6 ms 8784 KB Output is correct
11 Correct 6 ms 8784 KB Output is correct
12 Correct 2 ms 4944 KB Output is correct
13 Correct 6 ms 8784 KB Output is correct
14 Correct 6 ms 8784 KB Output is correct
15 Correct 5 ms 8784 KB Output is correct
16 Correct 6 ms 8784 KB Output is correct
17 Correct 6 ms 8784 KB Output is correct
18 Correct 5 ms 8784 KB Output is correct
19 Correct 6 ms 8784 KB Output is correct
20 Correct 6 ms 8768 KB Output is correct
21 Correct 6 ms 8784 KB Output is correct
22 Correct 6 ms 8784 KB Output is correct
23 Correct 5 ms 8784 KB Output is correct
24 Correct 6 ms 8844 KB Output is correct
25 Correct 4 ms 6608 KB Output is correct
26 Correct 7 ms 8784 KB Output is correct
27 Correct 6 ms 8784 KB Output is correct
28 Correct 6 ms 8784 KB Output is correct
29 Correct 5 ms 8784 KB Output is correct
30 Correct 6 ms 8784 KB Output is correct
31 Correct 7 ms 8832 KB Output is correct
32 Correct 6 ms 8784 KB Output is correct
33 Correct 5 ms 8784 KB Output is correct
34 Correct 6 ms 8784 KB Output is correct
35 Correct 5 ms 8784 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5712 KB Output is correct
2 Correct 5 ms 8784 KB Output is correct
3 Correct 5 ms 8784 KB Output is correct
4 Correct 5 ms 8804 KB Output is correct
5 Correct 5 ms 8784 KB Output is correct
6 Correct 6 ms 8808 KB Output is correct
7 Correct 6 ms 8784 KB Output is correct
8 Correct 5 ms 8784 KB Output is correct
9 Correct 6 ms 8784 KB Output is correct
10 Correct 6 ms 8784 KB Output is correct
11 Correct 6 ms 8784 KB Output is correct
12 Correct 2 ms 4944 KB Output is correct
13 Correct 6 ms 8784 KB Output is correct
14 Correct 6 ms 8784 KB Output is correct
15 Correct 5 ms 8784 KB Output is correct
16 Correct 6 ms 8784 KB Output is correct
17 Correct 6 ms 8784 KB Output is correct
18 Correct 5 ms 8784 KB Output is correct
19 Correct 6 ms 8784 KB Output is correct
20 Correct 6 ms 8768 KB Output is correct
21 Correct 6 ms 8784 KB Output is correct
22 Correct 6 ms 8784 KB Output is correct
23 Correct 5 ms 8784 KB Output is correct
24 Correct 6 ms 8844 KB Output is correct
25 Correct 4 ms 6608 KB Output is correct
26 Correct 7 ms 8784 KB Output is correct
27 Correct 6 ms 8784 KB Output is correct
28 Correct 6 ms 8784 KB Output is correct
29 Correct 5 ms 8784 KB Output is correct
30 Correct 6 ms 8784 KB Output is correct
31 Correct 7 ms 8832 KB Output is correct
32 Correct 6 ms 8784 KB Output is correct
33 Correct 5 ms 8784 KB Output is correct
34 Correct 6 ms 8784 KB Output is correct
35 Correct 5 ms 8784 KB Output is correct
36 Correct 115 ms 130124 KB Output is correct
37 Correct 175 ms 195168 KB Output is correct
38 Correct 172 ms 195080 KB Output is correct
39 Correct 171 ms 195064 KB Output is correct
40 Correct 170 ms 195072 KB Output is correct
41 Correct 192 ms 195880 KB Output is correct
42 Correct 166 ms 194948 KB Output is correct
43 Correct 183 ms 195568 KB Output is correct
44 Correct 167 ms 194896 KB Output is correct
45 Correct 174 ms 194916 KB Output is correct
46 Correct 164 ms 194880 KB Output is correct
47 Correct 188 ms 195588 KB Output is correct
48 Correct 174 ms 195480 KB Output is correct
49 Correct 164 ms 195048 KB Output is correct
50 Correct 164 ms 194956 KB Output is correct
51 Correct 167 ms 196216 KB Output is correct
52 Correct 203 ms 196936 KB Output is correct
53 Correct 206 ms 196856 KB Output is correct
54 Correct 201 ms 196940 KB Output is correct
55 Correct 186 ms 195324 KB Output is correct
56 Correct 193 ms 198424 KB Output is correct
57 Correct 191 ms 191060 KB Output is correct
58 Correct 223 ms 196080 KB Output is correct
59 Correct 200 ms 196324 KB Output is correct
60 Correct 200 ms 196884 KB Output is correct
61 Correct 203 ms 196856 KB Output is correct
62 Correct 197 ms 196312 KB Output is correct
63 Correct 221 ms 196756 KB Output is correct
64 Correct 187 ms 196100 KB Output is correct
65 Correct 179 ms 195280 KB Output is correct
66 Correct 195 ms 196112 KB Output is correct
67 Correct 178 ms 195268 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4021 ms 196852 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4091 ms 51328 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5712 KB Output is correct
2 Correct 5 ms 8784 KB Output is correct
3 Correct 5 ms 8784 KB Output is correct
4 Correct 5 ms 8804 KB Output is correct
5 Correct 5 ms 8784 KB Output is correct
6 Correct 6 ms 8808 KB Output is correct
7 Correct 6 ms 8784 KB Output is correct
8 Correct 5 ms 8784 KB Output is correct
9 Correct 6 ms 8784 KB Output is correct
10 Correct 6 ms 8784 KB Output is correct
11 Correct 6 ms 8784 KB Output is correct
12 Correct 2 ms 4944 KB Output is correct
13 Correct 6 ms 8784 KB Output is correct
14 Correct 6 ms 8784 KB Output is correct
15 Correct 5 ms 8784 KB Output is correct
16 Correct 6 ms 8784 KB Output is correct
17 Correct 6 ms 8784 KB Output is correct
18 Correct 5 ms 8784 KB Output is correct
19 Correct 6 ms 8784 KB Output is correct
20 Correct 6 ms 8768 KB Output is correct
21 Correct 6 ms 8784 KB Output is correct
22 Correct 6 ms 8784 KB Output is correct
23 Correct 5 ms 8784 KB Output is correct
24 Correct 6 ms 8844 KB Output is correct
25 Correct 4 ms 6608 KB Output is correct
26 Correct 7 ms 8784 KB Output is correct
27 Correct 6 ms 8784 KB Output is correct
28 Correct 6 ms 8784 KB Output is correct
29 Correct 5 ms 8784 KB Output is correct
30 Correct 6 ms 8784 KB Output is correct
31 Correct 7 ms 8832 KB Output is correct
32 Correct 6 ms 8784 KB Output is correct
33 Correct 5 ms 8784 KB Output is correct
34 Correct 6 ms 8784 KB Output is correct
35 Correct 5 ms 8784 KB Output is correct
36 Correct 115 ms 130124 KB Output is correct
37 Correct 175 ms 195168 KB Output is correct
38 Correct 172 ms 195080 KB Output is correct
39 Correct 171 ms 195064 KB Output is correct
40 Correct 170 ms 195072 KB Output is correct
41 Correct 192 ms 195880 KB Output is correct
42 Correct 166 ms 194948 KB Output is correct
43 Correct 183 ms 195568 KB Output is correct
44 Correct 167 ms 194896 KB Output is correct
45 Correct 174 ms 194916 KB Output is correct
46 Correct 164 ms 194880 KB Output is correct
47 Correct 188 ms 195588 KB Output is correct
48 Correct 174 ms 195480 KB Output is correct
49 Correct 164 ms 195048 KB Output is correct
50 Correct 164 ms 194956 KB Output is correct
51 Correct 167 ms 196216 KB Output is correct
52 Correct 203 ms 196936 KB Output is correct
53 Correct 206 ms 196856 KB Output is correct
54 Correct 201 ms 196940 KB Output is correct
55 Correct 186 ms 195324 KB Output is correct
56 Correct 193 ms 198424 KB Output is correct
57 Correct 191 ms 191060 KB Output is correct
58 Correct 223 ms 196080 KB Output is correct
59 Correct 200 ms 196324 KB Output is correct
60 Correct 200 ms 196884 KB Output is correct
61 Correct 203 ms 196856 KB Output is correct
62 Correct 197 ms 196312 KB Output is correct
63 Correct 221 ms 196756 KB Output is correct
64 Correct 187 ms 196100 KB Output is correct
65 Correct 179 ms 195280 KB Output is correct
66 Correct 195 ms 196112 KB Output is correct
67 Correct 178 ms 195268 KB Output is correct
68 Execution timed out 4021 ms 196852 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4086 ms 121496 KB Time limit exceeded
2 Halted 0 ms 0 KB -