제출 #1137695

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137695		Zbyszek99	Exam (eJOI20_exam)	C++20	88 / 100	144 ms	27504 KiB

exam

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

struct seg
{
    int l,r,x;
    bool type;
    bool operator<(const seg& s)
    {
        if(r != s.r) return r < s.r;
        return l < s.l;
    }
};

const int tree_siz = 1024*256-1;
struct seg_tree
{
    int drzewo_max[tree_siz];
    seg_tree()
    {
        rep(i,tree_siz) drzewo_max[i] = 0;
    }
    int get_max(int akt, int p1, int p2, int s1, int s2)
    {
        if(s2 < s1) return 0;
        if(p2 < s1 || p1 > s2) return -1;
        if(p1 >= s1 && p2 <= s2) return drzewo_max[akt-1];
        return max(get_max(akt*2,p1,(p1+p2)/2,s1,s2),get_max(akt*2+1,(p1+p2)/2+1,p2,s1,s2)); 
    }
    void upd(int v)
    {
        drzewo_max[v-1] = max(drzewo_max[v*2-1],drzewo_max[v*2]);
        if(v != 1) upd(v/2);
    }
    void change(int ind, int x)
    {
        drzewo_max[tree_siz/2+ind] = max(drzewo_max[tree_siz/2+ind],x);
        upd((tree_siz/2+ind+1)/2);
    }
};

int A[100001];
int B[100001];
set<int> A_poz[200001];
vector<seg> segs;
int ans[100001];
seg_tree tree1;
seg_tree Rtree;
seg_tree Ltree[2];
int Rans[100001];
int ansVal[200001][2];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n;
    cin >> n;
    map<int,int> m;
    rep(i,n) cin >> A[i];
    rep(i,n) cin >> B[i];
    rep(i,n) m[A[i]]++;
    rep(i,n) m[B[i]]++;
    int cur = 0;
    forall(it,m)
    {
        m[it.ff] = cur++;
    }
    rep(i,n) A[i] = m[A[i]];
    rep(i,n) B[i] = m[B[i]];
    rep(i,n) A_poz[A[i]].insert(i);
    rep(i,n)
    {
        tree1.change(i,A[i]);
    }
    rep(i,n)
    {
       // cout << A[i] << " " << B[i] << " ab\n";
        auto it_pop = A_poz[B[i]].upper_bound(i);
        if(it_pop != A_poz[B[i]].begin())
        {
            it_pop--;
            if(tree1.get_max(1,0,tree_siz/2,*it_pop,i) == B[i])
            {
                segs.pb({*it_pop,i,B[i],0});
            }
        }
        auto it_next = A_poz[B[i]].lower_bound(i);
        if(B[i] != A[i] && it_next != A_poz[B[i]].end())
        {
            if(tree1.get_max(1,0,tree_siz/2,i,*it_next) == B[i])
            {
                segs.pb({i,*it_next,B[i],1});
            }
        }
    }
    sort(all(segs));
   // forall(it,segs)
  //  {
   //     cout << it.l << " " << it.r << " " << it.type << " " << it.x  << " it\n";
   // }
    int final_ans = 0;
    rep(i,siz(segs))
    {
        ans[i] = 1;
        ans[i] = max(ans[i],Rtree.get_max(1,0,tree_siz/2,0,segs[i].l-1)+1);
        if(segs[i].type == 0)
        {
            ans[i] = max(ans[i],Rans[segs[i].l]+1);
        }
        ans[i] = max(ans[i],ansVal[segs[i].x][segs[i].type]+1);
        ans[i] = max(ans[i],Ltree[segs[i].type].get_max(1,0,tree_siz/2,0,segs[i].l)+1);
        Ltree[segs[i].type].change(segs[i].l,ans[i]);
        ansVal[segs[i].x][segs[i].type] = max(ansVal[segs[i].x][segs[i].type],ans[i]);
        Rtree.change(segs[i].r,ans[i]);
        if(segs[i].type == 1) Rans[segs[i].r] = max(Rans[segs[i].r],ans[i]);
        final_ans = max(final_ans,ans[i]);
    }
    cout << final_ans << "\n";
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 12
• Subtask 3: 13 / 13
• Subtask 4: 23 / 23
• Subtask 5: 16 / 16
• Subtask 6: 22 / 22