oj.uz

Submission #833318

# Submission time Handle Problem Language Result Execution time Memory
833318 2023-08-22T04:30:47 Z vjudge1 Exam (eJOI20_exam) C++17
0 / 100
 3 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
typedef long long ll;
const ll MAXN = 1e5 + 5;
const ll INF = 1e9;
#define endl '\n'
#define pll pair <ll, ll>
#define fi first
#define se second

ll n;
ll a [MAXN], b [MAXN];
ll par [MAXN];
ll dp [MAXN];

ll bpk(ll x){
    if(par[x] == x) return x;
    return par[x] = bpk(par[x]);
}

int main(){
    cin >> n;
    ll cnt2 = 0;
    for(ll i = 1; i <= n; i++){
        cin >> a[i];
        if(a[i-1] < a[i]) cnt2++;
    }
    ll cnt = 0;
    for(ll i = 1; i <= n; i++){
        cin >> b[i];
        if(b[1] == b[i]) cnt++;
    }
    if(cnt == n){
        ll sblm = 0;
        bool ada = false;
        ll ans = 0;
        a[n+1] = 2*INF;
        for(ll i = 1; i <= n+1; i++){
            if(a[i] == b[1]) ada = true;
            if(a[i] > b[1]){
                if(ada){
                    ada = false;
                    ans += i-sblm-1;
                    sblm = i;
                }
            }
        }
        cout << ans << endl;
        exit(0);
    }
    if(cnt2 == n){
        for(ll i = 1; i <= n; i++){
            for(ll j = i; j <= n; j++){
                if(a[j] > b[i]){
                    par[i] = -1;
                }
                if(a[j] == b[i]){
                    par[i] = j;
                    break;
                }
            }
        }
        for(ll i = n; i >= 1; i--){
            dp[i] = dp[i+1];
            if(par[i] == -1) continue;
            ll tmp = 1;
            for(ll j = i+1; j <= par[i]-1; j++){
                if(par[j] == -1) continue;
                if(par[j] == par[i]) tmp++;
                if(par[j] > par[i]){
                    dp[i] = max(dp[i], tmp+dp[j]);
                }
            }
            // cout << tmp << " " <<par[i] << " " << dp[par[i]] << endl;
            dp[i] = max(dp[i], tmp+dp[par[i]]);
        }
        // for(ll i = 1; i <= n; i++){
        //     cout << dp[i] << " ";
        // }
        // cout << endl;
        cout << dp[1] << endl;
    }
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -