oj.uz

Submission #421661

# Submission time Handle Problem Language Result Execution time Memory
421661 2021-06-09T10:37:10 Z Aldas25 Exam (eJOI20_exam) C++14
65 / 100
 805 ms 429552 KB 
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define s second
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;

const int MAXN = 500100;
const ll INF = 1e16;
const ll MOD = 1e9+7;

set<int> cur;
map<int, int> toId;

int n;
int a[MAXN], b[MAXN];
int pref[5100][2*5100];
int dp[MAXN];

void compress () {
    FOR(i ,1, n) {
        cur.insert(a[i]);
        cur.insert(b[i]);
    }

    int curId = 0;
    for (int x : cur) {
        toId[x] = ++curId;
    }

    FOR(i, 1, n) {
        a[i] = toId[a[i]];
        b[i] = toId[b[i]];
    }
}

void precPref () {
    FOR(i, 1, n) {
        FOR(j, 0, 2*n+5) pref[i][j] = pref[i-1][j];
        pref[i][b[i]]++;
    }
}

int cnt (int k, int fr, int to) {
    return pref[to][k] - pref[fr-1][k];
}

int main()
{
    FAST_IO;

    cin >> n;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) cin >> b[i];

    compress();
    precPref();

    int ans = 0;
    FOR(i,1 , n) {
        int fr = i, to = i;
        while (fr > 1 && a[fr-1] <= a[i]) {fr--;}
        while (to < n && a[to+1] <= a[i]) {to++;}

        int mx = dp[fr-1] - pref[fr-1][a[i]];
        FOR(y, fr, to) {
            dp[y] = max(dp[y], pref[y][a[i]] + mx);
            //cout << " count of " << a[i] << " in [" << x << "; " << y << "] = " << cnt(a[i], x, y) << endl;
            //cout << " i = " << i << " x = " << x << " y = " << y << " dp y = " << dp[y] << endl;
            ans = max(ans, dp[y]);
            mx = max(mx, dp[y] - pref[y][a[i]]);
        }
    }

    cout << ans << "\n";

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12256 KB Output is correct
2 Runtime error 557 ms 421404 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 4 ms 4300 KB Output is correct
3 Correct 52 ms 39924 KB Output is correct
4 Correct 323 ms 192780 KB Output is correct
5 Correct 319 ms 200512 KB Output is correct
6 Correct 379 ms 200552 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 200528 KB Output is correct
2 Runtime error 805 ms 429552 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 448 KB Output is correct
9 Correct 1 ms 716 KB Output is correct
10 Correct 1 ms 1356 KB Output is correct
11 Correct 1 ms 1356 KB Output is correct
12 Correct 1 ms 1356 KB Output is correct
13 Correct 1 ms 1356 KB Output is correct
14 Correct 2 ms 1476 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 52 ms 39924 KB Output is correct
10 Correct 323 ms 192780 KB Output is correct
11 Correct 319 ms 200512 KB Output is correct
12 Correct 379 ms 200552 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 448 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 1356 KB Output is correct
17 Correct 1 ms 1356 KB Output is correct
18 Correct 1 ms 1356 KB Output is correct
19 Correct 1 ms 1356 KB Output is correct
20 Correct 2 ms 1476 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 9 ms 12236 KB Output is correct
23 Correct 517 ms 200172 KB Output is correct
24 Correct 269 ms 200088 KB Output is correct
25 Correct 165 ms 200160 KB Output is correct
26 Correct 146 ms 200036 KB Output is correct
27 Correct 146 ms 200004 KB Output is correct
28 Correct 150 ms 200412 KB Output is correct
29 Correct 319 ms 200516 KB Output is correct
30 Correct 333 ms 200480 KB Output is correct
31 Correct 338 ms 200356 KB Output is correct
32 Correct 227 ms 200388 KB Output is correct