oj.uz

Submission #892497

# Submission time Handle Problem Language Result Execution time Memory
892497 2023-12-25T12:06:38 Z quochuy147 Financial Report (JOI21_financial) C++14
65 / 100
 90 ms 33316 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define all(x) (x).begin() , (x).end()
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define file "name"
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}

const int inf = 1e9 + 5;
const ll linf = 1e17;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int LOG = 20;

int n, d, res;
int a[N], f[N];
int rmq[N][LOG + 5], lg[N];

void inp()
{
    cin >> n >> d;
    for(int i = 1; i <= n; ++i) cin >> a[i];
}

namespace sub4 {
    void prepare() {
        for(int i = 2; i <= n; ++i) lg[i] = lg[i / 2] + 1;

        for(int i = 1; i <= n; ++i) rmq[i][0] = a[i];
        for(int j = 1; j <= LOG; ++j)
            for(int i = 1; i + MASK(j) - 1 <= n; ++i) rmq[i][j] = max(rmq[i][j - 1], rmq[i + MASK(j - 1)][j - 1]);
    }

    int get(int l, int r) {
        int k = lg[r - l + 1];
        return max(rmq[l][k], rmq[r - MASK(k) + 1][k]);
    }

    void solve() {
        prepare();
        for(int i = n; i >= 1; --i) {
            int l = i + 1, r = n, id = n + 1;
            while(l <= r) {
                int m = (l + r) >> 1;
                if(get(i, m) > a[i]) {
                    id = m;
                    r = m - 1;
                }
                else l = m + 1;
            }
            f[i] = f[id] + 1;
            maximize(res, f[i]);
        }
        cout << res;
    }
}

namespace sub5 {
    int x[N];
    void solve() {
        for(int i = 1; i <= n; ++i) x[i] = inf;
        x[0] = -inf;
        for(int i = 1; i <= n; ++i) {
            int l = 1, r = n, id = 0;
            while(l <= r) {
                int m = (l + r) >> 1;
                if(x[m] >= a[i]) {
                    id = m;
                    r = m - 1;
                }
                else l = m + 1;
            }
            x[id] = a[i];
            maximize(res, id);
        }
        cout << res;
    }
}

namespace sub3 {
    void solve() {
        a[0] = -1;
        for(int i = 1; i <= n; ++i) f[i] = 1;
        for(int i = 1; i <= n; ++i) {
            int id = i + d;
            maximize(res, f[i]);
            for(int j = i + 1; j <= n; ++j) {
                if(a[j] <= a[i]) {
                    id = j + d;
                    continue;
                }
                maximize(f[j], f[i] + 1);
                if(j >= id) break;
            }
        }
        cout << res;
    }
}

void solve()
{
    if(n <= 7000) return void(sub3::solve());
    if(d == 1) return void(sub4::solve());
    if(d == n) return void(sub5::solve());
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
//	freopen(file".inp" , "r" , stdin);
//	freopen(file".out" , "w" , stdout);
    inp();
    solve();
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2408 KB Output is correct
26 Correct 0 ms 2408 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2408 KB Output is correct
26 Correct 0 ms 2408 KB Output is correct
27 Correct 0 ms 2408 KB Output is correct
28 Correct 1 ms 2408 KB Output is correct
29 Correct 1 ms 2408 KB Output is correct
30 Correct 1 ms 2408 KB Output is correct
31 Correct 1 ms 2408 KB Output is correct
32 Correct 1 ms 2408 KB Output is correct
33 Correct 1 ms 2408 KB Output is correct
34 Correct 1 ms 2408 KB Output is correct
35 Correct 1 ms 2408 KB Output is correct
36 Correct 1 ms 2400 KB Output is correct
37 Correct 1 ms 2448 KB Output is correct
38 Correct 1 ms 2408 KB Output is correct
39 Correct 1 ms 2408 KB Output is correct
40 Correct 1 ms 2408 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2408 KB Output is correct
26 Correct 0 ms 2408 KB Output is correct
27 Correct 0 ms 2408 KB Output is correct
28 Correct 1 ms 2408 KB Output is correct
29 Correct 1 ms 2408 KB Output is correct
30 Correct 1 ms 2408 KB Output is correct
31 Correct 1 ms 2408 KB Output is correct
32 Correct 1 ms 2408 KB Output is correct
33 Correct 1 ms 2408 KB Output is correct
34 Correct 1 ms 2408 KB Output is correct
35 Correct 1 ms 2408 KB Output is correct
36 Correct 1 ms 2400 KB Output is correct
37 Correct 1 ms 2448 KB Output is correct
38 Correct 1 ms 2408 KB Output is correct
39 Correct 1 ms 2408 KB Output is correct
40 Correct 1 ms 2408 KB Output is correct
41 Correct 1 ms 2408 KB Output is correct
42 Correct 2 ms 2408 KB Output is correct
43 Correct 8 ms 2404 KB Output is correct
44 Correct 49 ms 2408 KB Output is correct
45 Correct 69 ms 2408 KB Output is correct
46 Correct 72 ms 2408 KB Output is correct
47 Correct 4 ms 2408 KB Output is correct
48 Correct 20 ms 2408 KB Output is correct
49 Correct 37 ms 2408 KB Output is correct
50 Correct 35 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 2 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 4 ms 2396 KB Output is correct
55 Correct 75 ms 2488 KB Output is correct
56 Correct 39 ms 2396 KB Output is correct
57 Correct 42 ms 2492 KB Output is correct
58 Correct 31 ms 2392 KB Output is correct
59 Correct 17 ms 2396 KB Output is correct
60 Correct 17 ms 2512 KB Output is correct
61 Correct 18 ms 2648 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 33168 KB Output is correct
2 Correct 73 ms 33200 KB Output is correct
3 Correct 76 ms 33116 KB Output is correct
4 Correct 90 ms 33232 KB Output is correct
5 Correct 73 ms 33112 KB Output is correct
6 Correct 72 ms 33108 KB Output is correct
7 Correct 83 ms 33312 KB Output is correct
8 Correct 73 ms 33304 KB Output is correct
9 Correct 68 ms 33116 KB Output is correct
10 Correct 74 ms 33116 KB Output is correct
11 Correct 70 ms 33312 KB Output is correct
12 Correct 73 ms 33316 KB Output is correct
13 Correct 67 ms 33316 KB Output is correct
14 Correct 66 ms 33104 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 5724 KB Output is correct
2 Correct 38 ms 5588 KB Output is correct
3 Correct 44 ms 5768 KB Output is correct
4 Correct 42 ms 5968 KB Output is correct
5 Correct 44 ms 5724 KB Output is correct
6 Correct 40 ms 5708 KB Output is correct
7 Correct 37 ms 5720 KB Output is correct
8 Correct 27 ms 5616 KB Output is correct
9 Correct 35 ms 5720 KB Output is correct
10 Correct 37 ms 5756 KB Output is correct
11 Correct 45 ms 5688 KB Output is correct
12 Correct 28 ms 5716 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2508 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2408 KB Output is correct
26 Correct 0 ms 2408 KB Output is correct
27 Correct 0 ms 2408 KB Output is correct
28 Correct 1 ms 2408 KB Output is correct
29 Correct 1 ms 2408 KB Output is correct
30 Correct 1 ms 2408 KB Output is correct
31 Correct 1 ms 2408 KB Output is correct
32 Correct 1 ms 2408 KB Output is correct
33 Correct 1 ms 2408 KB Output is correct
34 Correct 1 ms 2408 KB Output is correct
35 Correct 1 ms 2408 KB Output is correct
36 Correct 1 ms 2400 KB Output is correct
37 Correct 1 ms 2448 KB Output is correct
38 Correct 1 ms 2408 KB Output is correct
39 Correct 1 ms 2408 KB Output is correct
40 Correct 1 ms 2408 KB Output is correct
41 Correct 1 ms 2408 KB Output is correct
42 Correct 2 ms 2408 KB Output is correct
43 Correct 8 ms 2404 KB Output is correct
44 Correct 49 ms 2408 KB Output is correct
45 Correct 69 ms 2408 KB Output is correct
46 Correct 72 ms 2408 KB Output is correct
47 Correct 4 ms 2408 KB Output is correct
48 Correct 20 ms 2408 KB Output is correct
49 Correct 37 ms 2408 KB Output is correct
50 Correct 35 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 2 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 4 ms 2396 KB Output is correct
55 Correct 75 ms 2488 KB Output is correct
56 Correct 39 ms 2396 KB Output is correct
57 Correct 42 ms 2492 KB Output is correct
58 Correct 31 ms 2392 KB Output is correct
59 Correct 17 ms 2396 KB Output is correct
60 Correct 17 ms 2512 KB Output is correct
61 Correct 18 ms 2648 KB Output is correct
62 Correct 70 ms 33168 KB Output is correct
63 Correct 73 ms 33200 KB Output is correct
64 Correct 76 ms 33116 KB Output is correct
65 Correct 90 ms 33232 KB Output is correct
66 Correct 73 ms 33112 KB Output is correct
67 Correct 72 ms 33108 KB Output is correct
68 Correct 83 ms 33312 KB Output is correct
69 Correct 73 ms 33304 KB Output is correct
70 Correct 68 ms 33116 KB Output is correct
71 Correct 74 ms 33116 KB Output is correct
72 Correct 70 ms 33312 KB Output is correct
73 Correct 73 ms 33316 KB Output is correct
74 Correct 67 ms 33316 KB Output is correct
75 Correct 66 ms 33104 KB Output is correct
76 Correct 28 ms 5724 KB Output is correct
77 Correct 38 ms 5588 KB Output is correct
78 Correct 44 ms 5768 KB Output is correct
79 Correct 42 ms 5968 KB Output is correct
80 Correct 44 ms 5724 KB Output is correct
81 Correct 40 ms 5708 KB Output is correct
82 Correct 37 ms 5720 KB Output is correct
83 Correct 27 ms 5616 KB Output is correct
84 Correct 35 ms 5720 KB Output is correct
85 Correct 37 ms 5756 KB Output is correct
86 Correct 45 ms 5688 KB Output is correct
87 Correct 28 ms 5716 KB Output is correct
88 Incorrect 23 ms 6224 KB Output isn't correct
89 Halted 0 ms 0 KB -