oj.uz

Submission #564562

# Submission time Handle Problem Language Result Execution time Memory
564562 2022-05-19T11:06:58 Z nikatamliani Financial Report (JOI21_financial) C++14
100 / 100
 610 ms 77612 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5+10;
void compress(vector<int*> &v) {
    int prv = -1, cnt = 0;
    sort(v.begin(), v.end(), [&](int* a, int* b) {
        return *a < *b;
    });
    for (int i = 0; i < (int)v.size(); ++i) {
        cnt += prv < *v[i];
        prv = *v[i];
        *v[i] = cnt;
        
    }
}
vector<int> ids[N], to_delete[N];
int n, d;
int a[N], on[N], rgh[N], p[N], s[N], dp[N], t[4 * N];
int find_set(int x) {
    return p[x] == x ? x : p[x] = find_set(p[x]);
} 
void union_sets(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u == v) {
        return;
    }
    if (u > v) {
        swap(u, v);
    }
    p[v] = u; 
    s[u] += s[v];
}
void update(int l, int r, int x, int v, int pos) {
    if (l > x || r < x) {
        return;
    }
    if (l == r) {
        t[pos] = v;
    } else {
        int m = l + r >> 1;
        update(l, m, x, v, pos << 1);
        update(m+1, r, x, v, pos << 1 | 1); 
        t[pos] = max(t[pos << 1], t[pos << 1 | 1]);  
    }
}
void update(int id, int v) {
    update(1, n, id, v, 1);
}
int query(int l, int r, int L, int R, int pos) {
    if (L > r || l > R || l > r) return 0;
    if (L <= l && R >= r) {
        return t[pos];
    }
    int m = l + r >> 1;
    return max(query(l, m, L, R, pos << 1), query(m + 1, r, L, R, pos << 1 | 1));
}
int query(int l, int r) {
    return query(1, n, l, r, 1);
}
multiset<int> m[N];
void del(int id, int v) {
    m[id].erase(m[id].find(v));
}
void ins(int id, int v) {
    m[id].insert(v);
}
int get(int id) {
    if (!m[id].empty()) {
        return *m[id].rbegin();
    }
    return 0;
}
int main() {
    cin >> n >> d;
    vector<int*> coords(n);
    for (int i = 1; i <= n; ++i) {
        p[i] = i;
        s[i] = 1;
        cin >> a[i];
        coords[i - 1] = &a[i];
    }
    compress(coords);
    for (int i = 1; i <= n; ++i) {
        ids[a[i]].push_back(i);
    }
    set<int> st = {n + 1}; 
    for (int i = n; i >= 1; --i) {
        for (int id : ids[i]) {
            rgh[id] = min(*st.lower_bound(id) + d - 1, n);
            on[id] = 1;
            if (on[id + 1] == 1) {
                union_sets(id, id + 1);
            }
            if (on[id - 1] == 1) {
                union_sets(id, id - 1); 
            }
            int u = find_set(id);
            if (s[u] >= d) {
                st.insert(u);
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        to_delete[rgh[i]].push_back(i);
    }
    int best = 0;
    rgh[0] = n;
    for (int i = 1; i <= n; ++i) {
        dp[i] = query(1, a[i] - 1) + 1;
        best = max(best, dp[i]);
        ins(a[i], dp[i]);
        update(a[i], get(a[i]));
        for (int id : to_delete[i]) {
            del(a[id], dp[id]);
            update(a[id], get(a[id])); 
        }
    }
    cout << best << endl;
}

Compilation message

Main.cpp: In function 'void update(int, int, int, int, int)':
Main.cpp:41:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |         int m = l + r >> 1;
      |                 ~~^~~
Main.cpp: In function 'int query(int, int, int, int, int)':
Main.cpp:55:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |     int m = l + r >> 1;
      |             ~~^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28432 KB Output is correct
2 Correct 16 ms 28440 KB Output is correct
3 Correct 14 ms 28432 KB Output is correct
4 Correct 14 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 15 ms 28444 KB Output is correct
12 Correct 14 ms 28484 KB Output is correct
13 Correct 14 ms 28472 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 14 ms 28484 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28476 KB Output is correct
18 Correct 14 ms 28500 KB Output is correct
19 Correct 14 ms 28436 KB Output is correct
20 Correct 15 ms 28500 KB Output is correct
21 Correct 13 ms 28500 KB Output is correct
22 Correct 13 ms 28500 KB Output is correct
23 Correct 14 ms 28500 KB Output is correct
24 Correct 14 ms 28460 KB Output is correct
25 Correct 14 ms 28488 KB Output is correct
26 Correct 14 ms 28448 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28432 KB Output is correct
2 Correct 16 ms 28440 KB Output is correct
3 Correct 14 ms 28432 KB Output is correct
4 Correct 14 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 15 ms 28444 KB Output is correct
12 Correct 14 ms 28484 KB Output is correct
13 Correct 14 ms 28472 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 14 ms 28484 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28476 KB Output is correct
18 Correct 14 ms 28500 KB Output is correct
19 Correct 14 ms 28436 KB Output is correct
20 Correct 15 ms 28500 KB Output is correct
21 Correct 13 ms 28500 KB Output is correct
22 Correct 13 ms 28500 KB Output is correct
23 Correct 14 ms 28500 KB Output is correct
24 Correct 14 ms 28460 KB Output is correct
25 Correct 14 ms 28488 KB Output is correct
26 Correct 14 ms 28448 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 14 ms 28500 KB Output is correct
29 Correct 15 ms 28544 KB Output is correct
30 Correct 14 ms 28492 KB Output is correct
31 Correct 14 ms 28448 KB Output is correct
32 Correct 14 ms 28500 KB Output is correct
33 Correct 15 ms 28472 KB Output is correct
34 Correct 18 ms 28508 KB Output is correct
35 Correct 14 ms 28500 KB Output is correct
36 Correct 14 ms 28500 KB Output is correct
37 Correct 14 ms 28500 KB Output is correct
38 Correct 15 ms 28500 KB Output is correct
39 Correct 16 ms 28472 KB Output is correct
40 Correct 16 ms 28500 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28432 KB Output is correct
2 Correct 16 ms 28440 KB Output is correct
3 Correct 14 ms 28432 KB Output is correct
4 Correct 14 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 15 ms 28444 KB Output is correct
12 Correct 14 ms 28484 KB Output is correct
13 Correct 14 ms 28472 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 14 ms 28484 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28476 KB Output is correct
18 Correct 14 ms 28500 KB Output is correct
19 Correct 14 ms 28436 KB Output is correct
20 Correct 15 ms 28500 KB Output is correct
21 Correct 13 ms 28500 KB Output is correct
22 Correct 13 ms 28500 KB Output is correct
23 Correct 14 ms 28500 KB Output is correct
24 Correct 14 ms 28460 KB Output is correct
25 Correct 14 ms 28488 KB Output is correct
26 Correct 14 ms 28448 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 14 ms 28500 KB Output is correct
29 Correct 15 ms 28544 KB Output is correct
30 Correct 14 ms 28492 KB Output is correct
31 Correct 14 ms 28448 KB Output is correct
32 Correct 14 ms 28500 KB Output is correct
33 Correct 15 ms 28472 KB Output is correct
34 Correct 18 ms 28508 KB Output is correct
35 Correct 14 ms 28500 KB Output is correct
36 Correct 14 ms 28500 KB Output is correct
37 Correct 14 ms 28500 KB Output is correct
38 Correct 15 ms 28500 KB Output is correct
39 Correct 16 ms 28472 KB Output is correct
40 Correct 16 ms 28500 KB Output is correct
41 Correct 24 ms 29008 KB Output is correct
42 Correct 22 ms 29224 KB Output is correct
43 Correct 20 ms 28884 KB Output is correct
44 Correct 21 ms 28964 KB Output is correct
45 Correct 21 ms 29168 KB Output is correct
46 Correct 22 ms 29396 KB Output is correct
47 Correct 22 ms 29268 KB Output is correct
48 Correct 22 ms 29140 KB Output is correct
49 Correct 24 ms 29140 KB Output is correct
50 Correct 22 ms 29140 KB Output is correct
51 Correct 22 ms 29200 KB Output is correct
52 Correct 22 ms 29204 KB Output is correct
53 Correct 20 ms 29228 KB Output is correct
54 Correct 21 ms 29028 KB Output is correct
55 Correct 21 ms 29316 KB Output is correct
56 Correct 20 ms 29268 KB Output is correct
57 Correct 22 ms 29356 KB Output is correct
58 Correct 27 ms 29264 KB Output is correct
59 Correct 22 ms 29380 KB Output is correct
60 Correct 20 ms 29268 KB Output is correct
61 Correct 20 ms 29312 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 54460 KB Output is correct
2 Correct 337 ms 51480 KB Output is correct
3 Correct 385 ms 51676 KB Output is correct
4 Correct 587 ms 61260 KB Output is correct
5 Correct 577 ms 69160 KB Output is correct
6 Correct 610 ms 66052 KB Output is correct
7 Correct 374 ms 77336 KB Output is correct
8 Correct 318 ms 69320 KB Output is correct
9 Correct 353 ms 71144 KB Output is correct
10 Correct 368 ms 70388 KB Output is correct
11 Correct 449 ms 66068 KB Output is correct
12 Correct 502 ms 66088 KB Output is correct
13 Correct 545 ms 77612 KB Output is correct
14 Correct 464 ms 55888 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 54364 KB Output is correct
2 Correct 388 ms 54488 KB Output is correct
3 Correct 441 ms 55068 KB Output is correct
4 Correct 503 ms 66620 KB Output is correct
5 Correct 455 ms 66684 KB Output is correct
6 Correct 506 ms 66644 KB Output is correct
7 Correct 298 ms 66700 KB Output is correct
8 Correct 289 ms 66636 KB Output is correct
9 Correct 318 ms 66460 KB Output is correct
10 Correct 401 ms 66428 KB Output is correct
11 Correct 503 ms 66752 KB Output is correct
12 Correct 442 ms 66632 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28432 KB Output is correct
2 Correct 16 ms 28440 KB Output is correct
3 Correct 14 ms 28432 KB Output is correct
4 Correct 14 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 14 ms 28432 KB Output is correct
7 Correct 14 ms 28500 KB Output is correct
8 Correct 13 ms 28500 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 15 ms 28444 KB Output is correct
12 Correct 14 ms 28484 KB Output is correct
13 Correct 14 ms 28472 KB Output is correct
14 Correct 14 ms 28500 KB Output is correct
15 Correct 14 ms 28484 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 13 ms 28476 KB Output is correct
18 Correct 14 ms 28500 KB Output is correct
19 Correct 14 ms 28436 KB Output is correct
20 Correct 15 ms 28500 KB Output is correct
21 Correct 13 ms 28500 KB Output is correct
22 Correct 13 ms 28500 KB Output is correct
23 Correct 14 ms 28500 KB Output is correct
24 Correct 14 ms 28460 KB Output is correct
25 Correct 14 ms 28488 KB Output is correct
26 Correct 14 ms 28448 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 14 ms 28500 KB Output is correct
29 Correct 15 ms 28544 KB Output is correct
30 Correct 14 ms 28492 KB Output is correct
31 Correct 14 ms 28448 KB Output is correct
32 Correct 14 ms 28500 KB Output is correct
33 Correct 15 ms 28472 KB Output is correct
34 Correct 18 ms 28508 KB Output is correct
35 Correct 14 ms 28500 KB Output is correct
36 Correct 14 ms 28500 KB Output is correct
37 Correct 14 ms 28500 KB Output is correct
38 Correct 15 ms 28500 KB Output is correct
39 Correct 16 ms 28472 KB Output is correct
40 Correct 16 ms 28500 KB Output is correct
41 Correct 24 ms 29008 KB Output is correct
42 Correct 22 ms 29224 KB Output is correct
43 Correct 20 ms 28884 KB Output is correct
44 Correct 21 ms 28964 KB Output is correct
45 Correct 21 ms 29168 KB Output is correct
46 Correct 22 ms 29396 KB Output is correct
47 Correct 22 ms 29268 KB Output is correct
48 Correct 22 ms 29140 KB Output is correct
49 Correct 24 ms 29140 KB Output is correct
50 Correct 22 ms 29140 KB Output is correct
51 Correct 22 ms 29200 KB Output is correct
52 Correct 22 ms 29204 KB Output is correct
53 Correct 20 ms 29228 KB Output is correct
54 Correct 21 ms 29028 KB Output is correct
55 Correct 21 ms 29316 KB Output is correct
56 Correct 20 ms 29268 KB Output is correct
57 Correct 22 ms 29356 KB Output is correct
58 Correct 27 ms 29264 KB Output is correct
59 Correct 22 ms 29380 KB Output is correct
60 Correct 20 ms 29268 KB Output is correct
61 Correct 20 ms 29312 KB Output is correct
62 Correct 308 ms 54460 KB Output is correct
63 Correct 337 ms 51480 KB Output is correct
64 Correct 385 ms 51676 KB Output is correct
65 Correct 587 ms 61260 KB Output is correct
66 Correct 577 ms 69160 KB Output is correct
67 Correct 610 ms 66052 KB Output is correct
68 Correct 374 ms 77336 KB Output is correct
69 Correct 318 ms 69320 KB Output is correct
70 Correct 353 ms 71144 KB Output is correct
71 Correct 368 ms 70388 KB Output is correct
72 Correct 449 ms 66068 KB Output is correct
73 Correct 502 ms 66088 KB Output is correct
74 Correct 545 ms 77612 KB Output is correct
75 Correct 464 ms 55888 KB Output is correct
76 Correct 320 ms 54364 KB Output is correct
77 Correct 388 ms 54488 KB Output is correct
78 Correct 441 ms 55068 KB Output is correct
79 Correct 503 ms 66620 KB Output is correct
80 Correct 455 ms 66684 KB Output is correct
81 Correct 506 ms 66644 KB Output is correct
82 Correct 298 ms 66700 KB Output is correct
83 Correct 289 ms 66636 KB Output is correct
84 Correct 318 ms 66460 KB Output is correct
85 Correct 401 ms 66428 KB Output is correct
86 Correct 503 ms 66752 KB Output is correct
87 Correct 442 ms 66632 KB Output is correct
88 Correct 425 ms 50772 KB Output is correct
89 Correct 551 ms 58316 KB Output is correct
90 Correct 427 ms 48592 KB Output is correct
91 Correct 520 ms 65896 KB Output is correct
92 Correct 351 ms 55180 KB Output is correct
93 Correct 458 ms 55368 KB Output is correct
94 Correct 541 ms 63140 KB Output is correct
95 Correct 521 ms 61856 KB Output is correct
96 Correct 490 ms 58560 KB Output is correct
97 Correct 539 ms 58500 KB Output is correct
98 Correct 554 ms 65768 KB Output is correct
99 Correct 506 ms 67004 KB Output is correct
100 Correct 504 ms 67056 KB Output is correct
101 Correct 340 ms 63336 KB Output is correct
102 Correct 331 ms 55168 KB Output is correct
103 Correct 348 ms 53648 KB Output is correct
104 Correct 367 ms 54008 KB Output is correct
105 Correct 433 ms 57444 KB Output is correct
106 Correct 383 ms 66644 KB Output is correct
107 Correct 405 ms 67236 KB Output is correct
108 Correct 475 ms 67020 KB Output is correct
109 Correct 505 ms 75160 KB Output is correct
110 Correct 503 ms 65904 KB Output is correct
111 Correct 486 ms 65084 KB Output is correct
112 Correct 417 ms 68292 KB Output is correct
113 Correct 494 ms 67136 KB Output is correct
114 Correct 462 ms 66936 KB Output is correct
115 Correct 312 ms 67168 KB Output is correct
116 Correct 298 ms 67044 KB Output is correct
117 Correct 326 ms 67172 KB Output is correct
118 Correct 323 ms 67020 KB Output is correct
119 Correct 394 ms 67032 KB Output is correct
120 Correct 365 ms 67132 KB Output is correct