oj.uz

Submission #791379

# Submission time Handle Problem Language Result Execution time Memory
791379 2023-07-24T04:50:36 Z otarius Exam (eJOI20_exam) C++17
12 / 100
 240 ms 398276 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair <int, int>
#define ull unsigned long long

// #define int long long
// #define int unsigned long long

const ll inf = 1e9 + 7;
const ll weirdMod = 998244353;

map<int, int> mp; int rnk = 0;
int pref[5001][10000], dp[5001];
void solve() {
    int n;
    cin >> n;
    set<int> st;
    int a[n + 1], b[n + 1];
    for (int i = 1; i <= n; i++) {
        cin >> a[i]; st.insert(a[i]);
    } for (int i = 1; i <= n; i++) {
        cin >> b[i]; st.insert(b[i]);
    } for (int v : st) mp[v] = rnk++;
    bool flg = 1;
    for (int i = 2; i <= n; i++) {
        if (b[i] != b[i - 1]) {
            flg = 0; break;
        }
    } if (flg) {
        int ans = 0, cur = 0; bool flg = 0;
        for (int i = 1; i <= n; i++) {
            cur = 0; flg = 0;
            while (a[i] <= b[i] && i <= n) {
                if (a[i] == b[i]) flg = 1;
                cur++; i++;
            } if (flg) ans += cur;
        }
        cout << ans;
        return;
    }
    for (int i = 1; i <= n; i++) {
        a[i] = mp[a[i]]; b[i] = mp[b[i]];
        for (int j = 0; j < 10000; j++) {
            pref[i][j] = pref[i - 1][j];
        } pref[i][b[i]]++;
    } for (int j = 1; j <= n; j++) {
        int mx = -1;
        for (int i = j; i >= 1; i--) {
            mx = max(mx, a[i]);
            dp[j] = max(dp[j], dp[i - 1] + pref[j][mx] - pref[i - 1][mx]);
        }
    } int mx = 0;
    for (int i = 1; i <= n; i++)
        cout << dp[i] << ' ';
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
    return 0;
}

Compilation message

exam.cpp: In function 'void solve()':
exam.cpp:66:11: warning: unused variable 'mx' [-Wunused-variable]
   66 |     } int mx = 0;
      |           ^~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 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 340 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 39 ms 10504 KB Output is correct
4 Correct 10 ms 1484 KB Output is correct
5 Correct 54 ms 12524 KB Output is correct
6 Correct 10 ms 1504 KB Output is correct
7 Correct 12 ms 1604 KB Output is correct
8 Correct 45 ms 8956 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 240 ms 398276 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

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

Subtask #6
0 / 22.0

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