oj.uz

답안 #466995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466995 2021-08-21T07:57:36 Z TlenekWodoru Exam (eJOI20_exam) C++14
100 / 100
 148 ms 9236 KB 
#include <bits/stdc++.h>
using namespace std;
int A[100009];
int B[100009];
pair<int,int>granica[100009];
int dp[2][100009];
int DOR[100009];
map<int,int>miejsce;
int Tre[1000000];
int t,t2;
void Przedzial(int l, int p, int dod)
{
    l+=t2;
    p+=t2;
    int v=1;
    int P=t2+1;
    while(true)
    {
        if(v*P+P-1<l)
        {
            v=v/2;
            P=P*2;
            if(v==0){break;}
        }
        else if(v*P==l&&v*P+P-1<=p)
        {
            Tre[v]=max(Tre[v],dod);
            l+=P;
        }
        else
        {
            if(l<v*P+(P/2))
            {
                v=v*2;
                P=P/2;
            }
            else
            {
                v=v*2+1;
                P=P/2;
            }
        }
    }
}
int punkt(int v)
{
    int maxx=0;
    v+=t2;
    while(v!=0)
    {
        maxx=max(maxx,Tre[v]);
        v=v/2;
    }
    return maxx;
}
int TworzenieDrzewa(int x)
{
    int u=x;
    int coss=0;
    while(u>0)
    {
        coss++;
        u=u/2;
    }
    if(pow(2,coss-1)==x){coss--;}
    coss++;
    return coss;
}
int main()
{ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>A[i];
    }
    for(int i=1;i<=n;i++)
    {
        cin>>B[i];
    }
    map<int,int>M;
    M[2000000000]=0;
    for(int i=1;i<=n;i++)
    {
        granica[i].first=M.upper_bound(A[i])->second+1;
        while(M.size()>0&&M.begin()->first<=A[i])
        {
            M.erase(M.begin()->first);
        }
        M[A[i]]=i;
    }
    M.clear();
    M[2000000000]=n+1;
    for(int i=n;i>=1;i--)
    {
        granica[i].second=M.upper_bound(A[i])->second-1;
        while(M.size()>0&&M.begin()->first<=A[i])
        {
            M.erase(M.begin()->first);
        }
        M[A[i]]=i;
    }
    M.clear();
///-=-==-=-==-=-==-=-==-=-==-=-=-==-=--=-==-=-=-
    bool cv=1;
    for(int i=2;i<=n;i++)
    {
        if(B[i-1]!=B[i])
        {
            cv=0;
            break;
        }
    }
    if(n<=5000)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(A[i]==B[j]&&granica[i].first<=j&&j<=granica[i].second)
                {
                    dp[i%2][j]=dp[i%2][j-1]+1;
                }
                else
                {
                    dp[i%2][j]=max(dp[i%2][j-1],dp[(i-1)%2][j]);
                }
            }
        }
        cout<<dp[n%2][n]<<endl;
    }
    else if(cv==1)
    {
        for(int i=1;i<=n;i++)
        {
            if(A[i]==B[1])
            {
                DOR[granica[i].first]++;
                DOR[granica[i].second+1]--;
            }
        }
        int wynik=0;
        for(int i=1;i<=n;i++)
        {
            DOR[i]+=DOR[i-1];
            if(DOR[i]>0)
            {
                wynik++;
            }
        }
        cout<<wynik<<endl;
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            miejsce[A[i]]=i;
        }
        t=TworzenieDrzewa(n);
        t2=pow(2,t-1)-1;
        for(int i=1;i<=n;i++)
        {
            int ind=miejsce[B[i]];
            if(ind!=0&&granica[ind].first<=i&&i<=granica[ind].second)
            {
                int dod=punkt(ind)+1;
                Przedzial(ind,n,dod);
            }
        }
        cout<<punkt(n)<<endl;
    }
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 9 ms 1100 KB Output is correct
3 Correct 49 ms 7360 KB Output is correct
4 Correct 28 ms 2652 KB Output is correct
5 Correct 50 ms 4244 KB Output is correct
6 Correct 31 ms 2636 KB Output is correct
7 Correct 34 ms 2764 KB Output is correct
8 Correct 46 ms 4164 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 17 ms 536 KB Output is correct
4 Correct 89 ms 716 KB Output is correct
5 Correct 98 ms 716 KB Output is correct
6 Correct 99 ms 716 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 39 ms 3796 KB Output is correct
3 Correct 104 ms 7876 KB Output is correct
4 Correct 109 ms 8648 KB Output is correct
5 Correct 146 ms 9236 KB Output is correct
6 Correct 148 ms 8536 KB Output is correct
7 Correct 117 ms 9220 KB Output is correct
8 Correct 98 ms 8112 KB Output is correct
9 Correct 122 ms 8516 KB Output is correct
10 Correct 108 ms 8536 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 17 ms 536 KB Output is correct
10 Correct 89 ms 716 KB Output is correct
11 Correct 98 ms 716 KB Output is correct
12 Correct 99 ms 716 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 5 ms 332 KB Output is correct
23 Correct 79 ms 460 KB Output is correct
24 Correct 100 ms 460 KB Output is correct
25 Correct 100 ms 552 KB Output is correct
26 Correct 96 ms 484 KB Output is correct
27 Correct 97 ms 480 KB Output is correct
28 Correct 99 ms 568 KB Output is correct
29 Correct 97 ms 588 KB Output is correct
30 Correct 99 ms 716 KB Output is correct
31 Correct 97 ms 588 KB Output is correct
32 Correct 100 ms 708 KB Output is correct