oj.uz

Submission #1064615

# Submission time Handle Problem Language Result Execution time Memory
1064615 2024-08-18T15:40:29 Z aufan Money (IZhO17_money) C++17
0 / 100
 5 ms 8284 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n;
        cin >> n;

        vector<int> a(n + 1);
        for (int i = 1; i <= n; i++) cin >> a[i];

        vector<int> fen(1000001);
        
        auto upd = [&](int x, int val) {
                for (; x <= n; x += x & -x) fen[x] += val;
        };

        auto qry = [&](int x) {
                int res = 0;
                for (; x > 0; x -= x & -x) res += fen[x];
                return res;
        };

        int j = 1;
        vector<int> dp(n + 1);
        for (int i = 1; i <= n; i++) {
                if (a[i] < a[i - 1]) {
                        while (j < i) {
                                upd(a[j++], 1);
                        }
                }

                while (j < i && qry(a[i] - 1) - qry(a[j]) > 0) {
                        upd(a[j++], 1);
                }

                dp[i] = dp[j - 1] + 1;
        }

        cout << dp[n] << '\n';
        
        return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 1 ms 8280 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Incorrect 3 ms 8284 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 1 ms 8280 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Incorrect 3 ms 8284 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 1 ms 8280 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Incorrect 3 ms 8284 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 3 ms 8284 KB Output is correct
4 Correct 2 ms 8284 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 1 ms 8280 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 5 ms 8284 KB Output is correct
9 Correct 2 ms 8284 KB Output is correct
10 Incorrect 3 ms 8284 KB Output isn't correct
11 Halted 0 ms 0 KB -