oj.uz

Submission #833364

# Submission time Handle Problem Language Result Execution time Memory
833364 2023-08-22T04:58:40 Z vjudge1 Exam (eJOI20_exam) C++17
12 / 100
 71 ms 1840 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];

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(n <= 10){

    // }
    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){
                    // cout << i << " " << sblm << endl;
                    ada = false;
                    ans += i-sblm-1;
                }
                sblm = i;
            }
        }
        cout << ans << endl;
        exit(0);
    }
    if(cnt2 == n){
        vector <ll> v;
        for(ll i = 1; i <= n; i++){
            for(ll j = i; j <= n; j++){
                if(a[j] == b[i]){
                    while(!v.empty() && v.back() > j){
                        v.pop_back();
                    }
                    v.push_back(j);
                    break;
                }
            }
        }
        cout << v.size() << 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
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 560 KB Output is correct
3 Correct 38 ms 1600 KB Output is correct
4 Correct 24 ms 1840 KB Output is correct
5 Correct 61 ms 1744 KB Output is correct
6 Correct 24 ms 1756 KB Output is correct
7 Correct 27 ms 1748 KB Output is correct
8 Correct 71 ms 1776 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 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 -