oj.uz

답안 #787732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787732 2023-07-19T11:52:27 Z andrei_boaca 송신탑 (IOI22_towers) C++17
0 / 100
 4000 ms 29584 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 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++)
    {
        lft[i]=getL(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);
        int st=L;
        int dr=l;
        if(st<=dr)
        {
            if(getmin(st,dr)<v[l+1])
                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);
    }
    return ans;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 2 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 2 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 Incorrect 2 ms 3408 KB 1st lines differ - on the 1st token, expected: '1', found: '428'
14 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 2 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 2 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 Incorrect 2 ms 3408 KB 1st lines differ - on the 1st token, expected: '1', found: '428'
14 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 669 ms 29584 KB 1st lines differ - on the 1st token, expected: '11903', found: '13227'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3024 KB Output is correct
2 Correct 2 ms 3536 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 2 ms 3536 KB Output is correct
5 Correct 2 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 2 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 Incorrect 2 ms 3408 KB 1st lines differ - on the 1st token, expected: '1', found: '428'
14 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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