oj.uz

Submission #516830

# Submission time Handle Problem Language Result Execution time Memory
516830 2022-01-22T07:21:41 Z nickyrio Exam (eJOI20_exam) C++17
77 / 100
 225 ms 524292 KB 
#include <bits/stdc++.h>

using namespace std;
#define all(s) s.begin(), s.end() 
const int N = 1e5 + 100;
const int LG = 17;

int a[N], b[N], n, L[N], R[N];
vector<int> e[N];
vector<int> dp[N];
int BIT[N], RMQ[LG][N], lg2[N];

int query(int u) {
    int ans = 0;
    for(; u > 0; u -= u & -u) ans = max(ans, BIT[u]);
    return ans;
}
void update(int u, int v) {
    for (; u < N; u += u & -u) BIT[u] = max(BIT[u], v);
}

void sub2() {
    for (int i = 2; i <= n; ++i) if (b[i] != b[1]) return;
    int cnt = 0;
    for (int i = 1; i <= n; ++i) if (a[i] == b[1]) {
        for (int j = i - 1; a[j] < a[i]; --j) a[j] = a[i];
        for (int j = i + 1; a[j] < a[i]; ++j) a[j] = a[i];
    }
    for (int i = 1; i <= n; ++i) if (a[i] == b[1]) ++cnt;
    cout << cnt << '\n';
    exit(0);
}

void sub5() {
    for (int i = 1; i <= n; ++i) RMQ[0][i] = a[i];
    for (int i = 2; i <= n; ++i) lg2[i] = lg2[i >> 1] + 1;
    for (int j = 1; j < LG; ++j) {
        for (int i = 1; i + (1 << j) - 1 <= n; ++i) {
            RMQ[j][i] = max(RMQ[j - 1][i], RMQ[j - 1][i + (1 << (j - 1))]);
        }
    }   
    auto getMAX = [&](int l, int r) {
        int d = lg2[r - l + 1];
        return max(RMQ[d][l], RMQ[d][r - (1 << d) + 1]);
    };
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        int best = 0;
        for (int j : e[a[i]]) {
            int l = j, r = i;
            if (l > r) swap(l, r);
            if (getMAX(l, r) > a[i]) continue;
            best = max(best, query(j - 1)) + 1;
            update(j, best);
            ans = max(ans, best);
        }
        
    }
    cout << ans << '\n';
    exit(0);
}
int main() {
    ios::sync_with_stdio(false); cin.tie(NULL);
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> b[i];
    a[0] = a[n + 1] = 2e9;
    sub2();
    for (int i = 0; i <= n; ++i) dp[i].assign(n + 1, 0);
    vector<int> Ranking(a + 1, a + n + 1);
    sort(all(Ranking));
    Ranking.resize(unique(all(Ranking)) - Ranking.begin());
    for (int i = 1; i <= n; ++i) {
        a[i] = lower_bound(all(Ranking), a[i]) - Ranking.begin();
        int temp_b = lower_bound(all(Ranking), b[i]) - Ranking.begin();
        if (temp_b != Ranking.size() && Ranking[temp_b] != b[i]) temp_b = Ranking.size();
        b[i] = temp_b;
        e[b[i]].push_back(i);
    }
    sub5();
    
    
    for (int i = 1; i <= n; ++i) {
        L[i] = R[i] = i;
        while (a[L[i]] <= a[i]) --L[i];
        while (a[R[i]] <= a[i]) ++R[i];
    }
    for (int i = 1; i <= n; ++i) {
        int temp = 1;
        int p = 0, cnt = 0;
        for (int j : e[a[i]]) if (L[i] < j && j < R[i]) {
            ++cnt;
            if (dp[i - 1][j - 1] + 1 > dp[i - 1][p] + cnt) { p = j - 1; cnt = 1; }
            dp[i][j] = max(dp[i][j], dp[i - 1][p] + cnt);
        }
        for (int j = 1; j <= n; ++j) dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
    }
    cout << dp[n][n] << '\n';
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:76:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         if (temp_b != Ranking.size() && Ranking[temp_b] != b[i]) temp_b = Ranking.size();
      |             ~~~~~~~^~~~~~~~~~~~~~~~~
exam.cpp:89:13: warning: unused variable 'temp' [-Wunused-variable]
   89 |         int temp = 1;
      |             ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 6 ms 5068 KB Output is correct
3 Correct 22 ms 5648 KB Output is correct
4 Correct 12 ms 5692 KB Output is correct
5 Correct 25 ms 5800 KB Output is correct
6 Correct 12 ms 5812 KB Output is correct
7 Correct 12 ms 5708 KB Output is correct
8 Correct 20 ms 5708 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5068 KB Output is correct
2 Correct 3 ms 6092 KB Output is correct
3 Correct 11 ms 20972 KB Output is correct
4 Correct 49 ms 95732 KB Output is correct
5 Correct 67 ms 103396 KB Output is correct
6 Correct 54 ms 103416 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 103472 KB Output is correct
2 Runtime error 225 ms 524292 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 3 ms 5068 KB Output is correct
8 Correct 3 ms 5068 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 3 ms 5196 KB Output is correct
11 Correct 3 ms 5196 KB Output is correct
12 Correct 4 ms 5216 KB Output is correct
13 Correct 3 ms 5196 KB Output is correct
14 Correct 3 ms 5196 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 3 ms 5068 KB Output is correct
5 Correct 3 ms 5068 KB Output is correct
6 Correct 3 ms 5068 KB Output is correct
7 Correct 2 ms 5068 KB Output is correct
8 Correct 3 ms 6092 KB Output is correct
9 Correct 11 ms 20972 KB Output is correct
10 Correct 49 ms 95732 KB Output is correct
11 Correct 67 ms 103396 KB Output is correct
12 Correct 54 ms 103416 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct
16 Correct 3 ms 5196 KB Output is correct
17 Correct 3 ms 5196 KB Output is correct
18 Correct 4 ms 5216 KB Output is correct
19 Correct 3 ms 5196 KB Output is correct
20 Correct 3 ms 5196 KB Output is correct
21 Correct 3 ms 5196 KB Output is correct
22 Correct 6 ms 9036 KB Output is correct
23 Correct 3 ms 5068 KB Output is correct
24 Correct 145 ms 103412 KB Output is correct
25 Correct 54 ms 103344 KB Output is correct
26 Correct 50 ms 103300 KB Output is correct
27 Correct 53 ms 103376 KB Output is correct
28 Correct 53 ms 103340 KB Output is correct
29 Correct 50 ms 103364 KB Output is correct
30 Correct 49 ms 103404 KB Output is correct
31 Correct 52 ms 103416 KB Output is correct
32 Correct 49 ms 103428 KB Output is correct