oj.uz

답안 #412219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412219 2021-05-26T15:49:17 Z Theo830 Exam (eJOI20_exam) C++17
77 / 100
 239 ms 524292 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
ll INF = 1e9+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll seg[400005]={0};
void update(ll s,ll e,ll qs,ll qe,ll idx,ll k){
    if(s == e && s == qs){
        seg[idx] = max(seg[idx],k);
        return;
    }
    if(qs > e || qe < s){
        return;
    }
    ll mid = (s+e)/2;
    update(s,mid,qs,qe,idx*2,k);
    update(mid+1,e,qs,qe,idx*2+1,k);
    seg[idx] = max(seg[idx*2],seg[idx*2+1]);
}
ll query(ll s,ll e,ll qs,ll qe,ll idx){
    if(qs <= s && e <= qe){
        return seg[idx];
    }
    if(qs > e || qe < s){
        return 0;
    }
    ll mid = (s+e)/2;
    ll a = query(s,mid,qs,qe,idx*2);
    ll b = query(mid+1,e,qs,qe,idx*2+1);
    return max(a,b);
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n;
    cin>>n;
    ll a[n],b[n];
    map<ll,ll>mp;
    bool ok1 = 0,ok2 = 1;
    f(i,0,n){
        cin>>a[i];
        if(mp[a[i]] == 1){
            ok1 = 0;
        }
        mp[a[i]]++;
    }
    f(i,0,n){
        cin>>b[i];
        if(b[i] != b[0]){
            ok2 = 0;
        }
    }
    if(ok1){
        ll l[n],r[n];
        priority_queue<ii,vector<ii>,greater<ii> >pq;
        f(i,0,n){
            pq.push(ii(a[i],i));
            while(pq.top().F < a[i]){
                r[pq.top().S] = i-1;
                pq.pop();
            }
        }
        while(!pq.empty()){
            r[pq.top().S] = n-1;
            pq.pop();
        }
        for(ll i=n-1;i >= 0;i--){
            pq.push(ii(a[i],i));
            while(pq.top().F < a[i]){
                l[pq.top().S] = i+1;
                pq.pop();
            }
        }
        while(!pq.empty()){
            l[pq.top().S] = 0;
            pq.pop();
        }
        ll ans = 0;
        ll dp[n+1];
        dp[0] = 0;
        f(i,1,n+1){
            dp[i] = 0;
            if(b[i-1] == INF || !(l[b[i-1]-1] <= i-1 && i-1 <= r[b[i-1]-1])){
                continue;
            }
            dp[i] = query(1,n+1,1,b[i-1],1) + 1;
            update(1,n+1,b[i-1],b[i-1],1,dp[i]);
            ans = max(ans,dp[i]);
        }
        cout<<ans<<endl;
        return 0;
    }
    if(ok2){
        ll ans = 0;
        ll ok = 0;
        ll posa = 0;
        f(i,0,n){
            if(a[i] > b[0]){
                ans += posa * ok;
                ok = 0;
                posa = 0;
            }
            else{
                posa++;
                ok |= (a[i] == b[0]);
            }
        }
        ans += posa * ok;
        cout<<ans<<endl;
        return 0;
    }
    ll l[n],r[n];
    priority_queue<ii,vector<ii>,greater<ii> >pq;
    f(i,0,n){
        pq.push(ii(a[i],i));
        while(pq.top().F < a[i]){
            r[pq.top().S] = i-1;
            pq.pop();
        }
    }
    while(!pq.empty()){
        r[pq.top().S] = n-1;
        pq.pop();
    }
    for(ll i=n-1;i >= 0;i--){
        pq.push(ii(a[i],i));
        while(pq.top().F < a[i]){
            l[pq.top().S] = i+1;
            pq.pop();
        }
    }
    while(!pq.empty()){
        l[pq.top().S] = 0;
        pq.pop();
    }
    ll dp[n+1][n+1];
    f(i,0,n+1){
        f(j,0,n+1){
            if(i == 0 || j == 0){
                dp[i][j] = 0;
            }
            else{
                dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
                if(a[i-1] == b[j-1] && (l[i-1] <= j-1 && j-1 <= r[i-1])){
                    dp[i][j] = max(dp[i][j],dp[i][j-1] + 1);
                }
            }
        }
    }
    cout<<dp[n][n]<<endl;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 6 ms 472 KB Output is correct
3 Correct 44 ms 5172 KB Output is correct
4 Correct 19 ms 1484 KB Output is correct
5 Correct 73 ms 7752 KB Output is correct
6 Correct 17 ms 1464 KB Output is correct
7 Correct 19 ms 1616 KB Output is correct
8 Correct 69 ms 5932 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 1240 KB Output is correct
3 Correct 27 ms 16120 KB Output is correct
4 Correct 130 ms 90924 KB Output is correct
5 Correct 143 ms 98704 KB Output is correct
6 Correct 139 ms 98508 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 98500 KB Output is correct
2 Runtime error 239 ms 524292 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

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

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 3 ms 1240 KB Output is correct
9 Correct 27 ms 16120 KB Output is correct
10 Correct 130 ms 90924 KB Output is correct
11 Correct 143 ms 98704 KB Output is correct
12 Correct 139 ms 98508 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 7 ms 4172 KB Output is correct
23 Correct 3 ms 332 KB Output is correct
24 Correct 166 ms 98340 KB Output is correct
25 Correct 141 ms 98272 KB Output is correct
26 Correct 149 ms 98196 KB Output is correct
27 Correct 140 ms 98240 KB Output is correct
28 Correct 142 ms 98416 KB Output is correct
29 Correct 140 ms 98520 KB Output is correct
30 Correct 138 ms 98532 KB Output is correct
31 Correct 140 ms 98464 KB Output is correct
32 Correct 139 ms 98508 KB Output is correct