oj.uz

Submission #892394

# Submission time Handle Problem Language Result Execution time Memory
892394 2023-12-25T10:00:21 Z Peter2017 Financial Report (JOI21_financial) C++14
100 / 100
 415 ms 28684 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pill pair<int,ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define name "test"

using namespace std;

const int N = 3e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18 + 69;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b){if (a < b){a = b; return 1;} return 0;}
template <typename T1, typename T2> bool mini(T1 &a, T2 b){if (a > b){a = b; return 1;} return 0;}

int n;
int k;
int D;
int a[N];
int f[(int)7e3 + 2][(int)7e3 + 2];
deque <int> dq[(int)7e3 + 2];
vector <int> value;

void load(){
    cin.tie(0)->sync_with_stdio(0);
    if (fopen(name".inp", "r")){
        freopen(name".inp", "r", stdin);
        freopen(name".out", "w", stdout);
    }
}

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

void compress(){
    for (int i = 1; i <= n; i++)
        value.push_back(a[i]);
    sort(value.begin(), value.end());
    value.erase(unique(value.begin(), value.end()), value.end());
    for (int i = 1; i <= n; i++)
        a[i] = lower_bound(value.begin(), value.end(), a[i]) - value.begin() + 1;
    k = (int)value.size();
}

namespace subtask3{
    void solve(){
        mem(f, -0x3f);
        for (int i = 1; i <= n; i++){
            f[i][a[i]] = 1;
            for (int j = 1; j <= k; j++){
                if (dq[j].size() && dq[j].front() < i - D) dq[j].pop_front();
                if (dq[j].size()) maxi(f[i][max(a[i], j)], f[dq[j].front()][j] + (j < a[i]));
            }
            for (int j = 1; j <= k; j++){
                while (dq[j].size() && f[dq[j].back()][j] <= f[i][j])
                    dq[j].pop_back();
                dq[j].push_back(i);
            }
        }
        int ans = 0;
        for (int i = 1; i <= k; i++)
            maxi(ans, f[n][i]);
        cout << ans;
    }
}

namespace subtask4{
    stack <int> st;
    void solve(){
        st.push(n);
        int ans = 1;
        for (int i = n - 1; i >= 1; i--){
            while (st.size() && a[st.top()] <= a[i]) st.pop();
            st.push(i);
            maxi(ans, st.size());
        }
        cout << ans;
    }
}

namespace subtask5{
    int b[N];
    void solve(){
        mem(b, 0x3f);
        int ans = 0;
        for (int i = 1; i <= n; i++){
            int id = lower_bound(b + 1, b + n + 1, a[i]) - b;
            b[id] = a[i];
            maxi(ans, id);
        }
        cout << ans;
    }
}

namespace subtask6{
    int R[N];
    pii b[N];
    deque<int> dq;
    struct SEGTREE{
        int lz[N << 2];
        int val[N << 2];
        SEGTREE(){};
        void build(int id, int l, int r){
            if (l == r) return void(val[id] = lz[id] = -mod);
            int m = (l + r) >> 1;
            build(id << 1, l, m);
            build(id << 1 | 1, m + 1, r);
            val[id] = lz[id] = -mod;
        }
        void down(int id, int l, int r){
            maxi(val[id], lz[id]);
            if (l < r){
                maxi(lz[id << 1], lz[id]);
                maxi(lz[id << 1 | 1], lz[id]);
            }
            lz[id] = -mod;
        }
        void update(int id, int l, int r, int u, int v, int x){
            down(id, l, r);
            if (l > v || r < u) return;
            if (l >= u && r <= v){
                maxi(lz[id], x);
                down(id, l, r);
                return;
            }
            int m = (l + r) >> 1;
            update(id << 1, l, m, u, v, x);
            update(id << 1 | 1, m + 1, r, u, v, x);
            val[id] = max(val[id << 1], val[id << 1 | 1]);
        }
        int get(int id, int l, int r, int u, int v){
            down(id, l, r);
            if (l > v || r < u) return -mod;
            if (l >= u && r <= v) return val[id];
            int m = (l + r) >> 1;
            return max(get(id << 1, l, m, u, v), get(id << 1 | 1, m + 1, r, u, v));
        }
        void update(int l, int r, int x){
            assert(r <= n);
            update(1, 1, n, l, r, x);
        }
        int get(int l, int r){
            assert(r <= n);
            return get(1, 1, n, l, r);
        }
    } ST;
    bool cmp(pii x, pii y){
        if (x.fi == y.fi) return x.se < y.se;
        return x.fi > y.fi;
    }
    void solve(){
        ST.build(1, 1, n);
        mem(R, -0x3f);
        for (int i = n; i >= 1; i--){
            if (i < n - D) R[i] = ST.get(a[i], a[i]);
            while (dq.size() && a[dq.back()] >= a[i]) dq.pop_back();
            dq.push_back(i);
            if (i <= n - D){
                if (dq.front() >= i + D) dq.pop_front();
                ST.update(1, a[dq.front()] - 1, max(-(i + D - 1), -n));
            }
        }
        ST.build(1, 1, n);
        for (int i = 1; i <= n; i++)
            maxi(R[i], -n);
        for (int i = 1; i <= n; i++)
            b[i] = {a[i], i};
//        for (int i = 1; i <= n; i++)
//            cout << i << ' ' << -R[i] << '\n';
        sort(b + 1, b + n + 1, cmp);
        for (int i = 1; i <= n; i++){
            int id = b[i].se;
            int tmp = max(ST.get(id + 1, -R[id]), 0) + 1;
            ST.update(id, id, tmp);
        }
        cout << ST.get(1, n);
    }
}

int main(){
    load();
    input();
    compress();
    subtask6::solve();
}

Compilation message

Main.cpp: In instantiation of 'bool maxi(T1&, T2) [with T1 = int; T2 = long unsigned int]':
Main.cpp:85:32:   required from here
Main.cpp:19:66: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   19 | template <typename T1, typename T2> bool maxi(T1 &a, T2 b){if (a < b){a = b; return 1;} return 0;}
      |                                                                ~~^~~
Main.cpp: In function 'void load()':
Main.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 4 ms 16728 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 4 ms 16732 KB Output is correct
10 Correct 4 ms 16732 KB Output is correct
11 Correct 4 ms 16732 KB Output is correct
12 Correct 4 ms 16728 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 4 ms 16732 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16732 KB Output is correct
19 Correct 4 ms 16732 KB Output is correct
20 Correct 4 ms 16732 KB Output is correct
21 Correct 5 ms 16732 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 4 ms 16820 KB Output is correct
24 Correct 4 ms 16732 KB Output is correct
25 Correct 4 ms 16728 KB Output is correct
26 Correct 4 ms 16728 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 4 ms 16728 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 4 ms 16732 KB Output is correct
10 Correct 4 ms 16732 KB Output is correct
11 Correct 4 ms 16732 KB Output is correct
12 Correct 4 ms 16728 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 4 ms 16732 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16732 KB Output is correct
19 Correct 4 ms 16732 KB Output is correct
20 Correct 4 ms 16732 KB Output is correct
21 Correct 5 ms 16732 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 4 ms 16820 KB Output is correct
24 Correct 4 ms 16732 KB Output is correct
25 Correct 4 ms 16728 KB Output is correct
26 Correct 4 ms 16728 KB Output is correct
27 Correct 4 ms 16728 KB Output is correct
28 Correct 4 ms 16728 KB Output is correct
29 Correct 5 ms 16732 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct
31 Correct 4 ms 16732 KB Output is correct
32 Correct 4 ms 16732 KB Output is correct
33 Correct 4 ms 16732 KB Output is correct
34 Correct 4 ms 16732 KB Output is correct
35 Correct 4 ms 16732 KB Output is correct
36 Correct 4 ms 16932 KB Output is correct
37 Correct 4 ms 16732 KB Output is correct
38 Correct 5 ms 16732 KB Output is correct
39 Correct 4 ms 16732 KB Output is correct
40 Correct 4 ms 16732 KB Output is correct
41 Correct 10 ms 17144 KB Output is correct
42 Correct 11 ms 17008 KB Output is correct
43 Correct 9 ms 16988 KB Output is correct
44 Correct 9 ms 16988 KB Output is correct
45 Correct 9 ms 17132 KB Output is correct
46 Correct 8 ms 16988 KB Output is correct
47 Correct 10 ms 16988 KB Output is correct
48 Correct 10 ms 16952 KB Output is correct
49 Correct 10 ms 16984 KB Output is correct
50 Correct 10 ms 16988 KB Output is correct
51 Correct 9 ms 16988 KB Output is correct
52 Correct 12 ms 17340 KB Output is correct
53 Correct 9 ms 17184 KB Output is correct
54 Correct 10 ms 16988 KB Output is correct
55 Correct 10 ms 17076 KB Output is correct
56 Correct 10 ms 16988 KB Output is correct
57 Correct 9 ms 17144 KB Output is correct
58 Correct 7 ms 16988 KB Output is correct
59 Correct 6 ms 16988 KB Output is correct
60 Correct 9 ms 16988 KB Output is correct
61 Correct 9 ms 16988 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 24772 KB Output is correct
2 Correct 259 ms 24920 KB Output is correct
3 Correct 300 ms 24768 KB Output is correct
4 Correct 385 ms 24768 KB Output is correct
5 Correct 337 ms 24768 KB Output is correct
6 Correct 404 ms 24764 KB Output is correct
7 Correct 253 ms 24812 KB Output is correct
8 Correct 252 ms 24684 KB Output is correct
9 Correct 258 ms 24764 KB Output is correct
10 Correct 258 ms 24728 KB Output is correct
11 Correct 366 ms 24660 KB Output is correct
12 Correct 355 ms 24660 KB Output is correct
13 Correct 353 ms 24772 KB Output is correct
14 Correct 388 ms 24776 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 24776 KB Output is correct
2 Correct 193 ms 24772 KB Output is correct
3 Correct 240 ms 24980 KB Output is correct
4 Correct 241 ms 24772 KB Output is correct
5 Correct 215 ms 24660 KB Output is correct
6 Correct 251 ms 24768 KB Output is correct
7 Correct 163 ms 24672 KB Output is correct
8 Correct 153 ms 25752 KB Output is correct
9 Correct 165 ms 24752 KB Output is correct
10 Correct 231 ms 24764 KB Output is correct
11 Correct 243 ms 24768 KB Output is correct
12 Correct 209 ms 24664 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 5 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 4 ms 16728 KB Output is correct
6 Correct 4 ms 16732 KB Output is correct
7 Correct 4 ms 16732 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 4 ms 16732 KB Output is correct
10 Correct 4 ms 16732 KB Output is correct
11 Correct 4 ms 16732 KB Output is correct
12 Correct 4 ms 16728 KB Output is correct
13 Correct 4 ms 16732 KB Output is correct
14 Correct 4 ms 16988 KB Output is correct
15 Correct 4 ms 16732 KB Output is correct
16 Correct 4 ms 16732 KB Output is correct
17 Correct 4 ms 16732 KB Output is correct
18 Correct 4 ms 16732 KB Output is correct
19 Correct 4 ms 16732 KB Output is correct
20 Correct 4 ms 16732 KB Output is correct
21 Correct 5 ms 16732 KB Output is correct
22 Correct 4 ms 16732 KB Output is correct
23 Correct 4 ms 16820 KB Output is correct
24 Correct 4 ms 16732 KB Output is correct
25 Correct 4 ms 16728 KB Output is correct
26 Correct 4 ms 16728 KB Output is correct
27 Correct 4 ms 16728 KB Output is correct
28 Correct 4 ms 16728 KB Output is correct
29 Correct 5 ms 16732 KB Output is correct
30 Correct 4 ms 16732 KB Output is correct
31 Correct 4 ms 16732 KB Output is correct
32 Correct 4 ms 16732 KB Output is correct
33 Correct 4 ms 16732 KB Output is correct
34 Correct 4 ms 16732 KB Output is correct
35 Correct 4 ms 16732 KB Output is correct
36 Correct 4 ms 16932 KB Output is correct
37 Correct 4 ms 16732 KB Output is correct
38 Correct 5 ms 16732 KB Output is correct
39 Correct 4 ms 16732 KB Output is correct
40 Correct 4 ms 16732 KB Output is correct
41 Correct 10 ms 17144 KB Output is correct
42 Correct 11 ms 17008 KB Output is correct
43 Correct 9 ms 16988 KB Output is correct
44 Correct 9 ms 16988 KB Output is correct
45 Correct 9 ms 17132 KB Output is correct
46 Correct 8 ms 16988 KB Output is correct
47 Correct 10 ms 16988 KB Output is correct
48 Correct 10 ms 16952 KB Output is correct
49 Correct 10 ms 16984 KB Output is correct
50 Correct 10 ms 16988 KB Output is correct
51 Correct 9 ms 16988 KB Output is correct
52 Correct 12 ms 17340 KB Output is correct
53 Correct 9 ms 17184 KB Output is correct
54 Correct 10 ms 16988 KB Output is correct
55 Correct 10 ms 17076 KB Output is correct
56 Correct 10 ms 16988 KB Output is correct
57 Correct 9 ms 17144 KB Output is correct
58 Correct 7 ms 16988 KB Output is correct
59 Correct 6 ms 16988 KB Output is correct
60 Correct 9 ms 16988 KB Output is correct
61 Correct 9 ms 16988 KB Output is correct
62 Correct 171 ms 24772 KB Output is correct
63 Correct 259 ms 24920 KB Output is correct
64 Correct 300 ms 24768 KB Output is correct
65 Correct 385 ms 24768 KB Output is correct
66 Correct 337 ms 24768 KB Output is correct
67 Correct 404 ms 24764 KB Output is correct
68 Correct 253 ms 24812 KB Output is correct
69 Correct 252 ms 24684 KB Output is correct
70 Correct 258 ms 24764 KB Output is correct
71 Correct 258 ms 24728 KB Output is correct
72 Correct 366 ms 24660 KB Output is correct
73 Correct 355 ms 24660 KB Output is correct
74 Correct 353 ms 24772 KB Output is correct
75 Correct 388 ms 24776 KB Output is correct
76 Correct 140 ms 24776 KB Output is correct
77 Correct 193 ms 24772 KB Output is correct
78 Correct 240 ms 24980 KB Output is correct
79 Correct 241 ms 24772 KB Output is correct
80 Correct 215 ms 24660 KB Output is correct
81 Correct 251 ms 24768 KB Output is correct
82 Correct 163 ms 24672 KB Output is correct
83 Correct 153 ms 25752 KB Output is correct
84 Correct 165 ms 24752 KB Output is correct
85 Correct 231 ms 24764 KB Output is correct
86 Correct 243 ms 24768 KB Output is correct
87 Correct 209 ms 24664 KB Output is correct
88 Correct 346 ms 27588 KB Output is correct
89 Correct 407 ms 27564 KB Output is correct
90 Correct 384 ms 27632 KB Output is correct
91 Correct 367 ms 27580 KB Output is correct
92 Correct 243 ms 27676 KB Output is correct
93 Correct 274 ms 27584 KB Output is correct
94 Correct 310 ms 27580 KB Output is correct
95 Correct 365 ms 27596 KB Output is correct
96 Correct 385 ms 27584 KB Output is correct
97 Correct 397 ms 27644 KB Output is correct
98 Correct 377 ms 27648 KB Output is correct
99 Correct 356 ms 27588 KB Output is correct
100 Correct 396 ms 27584 KB Output is correct
101 Correct 269 ms 27588 KB Output is correct
102 Correct 288 ms 27648 KB Output is correct
103 Correct 317 ms 27564 KB Output is correct
104 Correct 356 ms 27584 KB Output is correct
105 Correct 368 ms 27600 KB Output is correct
106 Correct 366 ms 27580 KB Output is correct
107 Correct 348 ms 27560 KB Output is correct
108 Correct 365 ms 27568 KB Output is correct
109 Correct 351 ms 27580 KB Output is correct
110 Correct 415 ms 27564 KB Output is correct
111 Correct 406 ms 27588 KB Output is correct
112 Correct 316 ms 27580 KB Output is correct
113 Correct 382 ms 27652 KB Output is correct
114 Correct 368 ms 27692 KB Output is correct
115 Correct 163 ms 28684 KB Output is correct
116 Correct 152 ms 28664 KB Output is correct
117 Correct 262 ms 28100 KB Output is correct
118 Correct 281 ms 28036 KB Output is correct
119 Correct 340 ms 27560 KB Output is correct
120 Correct 348 ms 27560 KB Output is correct