oj.uz

Submission #813686

# Submission time Handle Problem Language Result Execution time Memory
813686 2023-08-08T01:49:08 Z Cookie Financial Report (JOI21_financial) C++14
100 / 100
 1801 ms 65720 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("VNOICUP.INP");
ofstream fout("VNOICUP.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e6 + 5, mxq = 2e5 + 5, sq = 400, mxv = 3e5 + 5;
//const int base = (1 << 18);
const int inf = 1e9, neg = -69420;
struct DSU{
    vt<pii>past_p, past_sz;
    vt<int>checkpoint;
    int p[mxn + 1], sz[mxn + 1];
    void init(){
        for(int i = 1; i <= mxn; i++){
            p[i] = i; sz[i]  = 1;
        }
        past_sz.clear(); past_p.clear(); checkpoint.clear();
    }
    int fp(int a){
        if(p[a] == a)return(a);
        return(fp(p[a]));
    }
    bool check(int u, int v){
        return(fp(u) == fp(v));
    }
    void unon(int a, int b){
        a = fp(a); b = fp(b);
        if(a > b)swap(a, b);
        //past_sz.pb({a, sz[a]}); past_p.pb({b, p[b]});
        if(a != b){
            sz[a] += sz[b]; p[b] = a;
        }
    }
    void rollback(){
        //int before = p[past_p.back().fi], after = past_p.back().se;
        //if(before != past_p.back().fi && after == past_p.back().fi)cnt++;
        p[past_p.back().fi] = past_p.back().se; past_p.pop_back();
        sz[past_sz.back().fi] = past_sz.back().se; past_sz.pop_back();
    }
    void save(){
        checkpoint.pb(past_sz.size());
    }
    void to_last(){
        while(past_sz.size() != checkpoint.back())rollback();
        checkpoint.pop_back();
    }
};

    int st[4 * mxn + 1];
    void upd(int nd, int l, int r, int id, int v){
        if(id > r || id < l)return;
        if(l == r){
            st[nd] = v;
            return;
        }
        int mid = (l + r) >> 1;
        upd(nd << 1, l, mid, id, v); upd(nd << 1 | 1, mid + 1, r, id, v);
        st[nd] = max(st[nd << 1], st[nd << 1 | 1]);
    }
    int get(int nd, int l, int r, int ql, int qr){
        if(ql > r || qr < l)return(0);
        if(ql <= l && qr >= r)return(st[nd]);
        int mid = (l + r) >> 1;
        return(max(get(nd << 1, l, mid, ql, qr), get(nd << 1 | 1, mid + 1, r, ql, qr)));
    }

DSU dsu;
int n, d;
int a[mxn + 1], dp[mxn + 1];
vt<int>idx[mxn + 1];
vt<int>comp;
int find(int x){
    return(lower_bound(comp.begin(), comp.end(), x) - comp.begin() + 1);
}
void compress(){
    for(int i = 1; i <= n; i++)comp.pb(a[i]);
    sort(comp.begin(), comp.end());
    for(int i = 1; i <= n; i++){
        a[i] = find(a[i]);

    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> d;
    dsu.init();
    for(int i = 1; i <= n; i++)cin >> a[i];
    compress();
    for(int i = 1; i <= n; i++){
        idx[a[i]].pb(i); 
    }
    set<int>save;
    int ans = 1;
    for(int i = 1; i <= n; i++){
        if(sz(idx[i]) == 0)continue;
        reverse(idx[i].begin(), idx[i].end());
        for(int j = 0; j < sz(idx[i]); j++){
            int x = idx[i][j];
            
            auto lw = save.lower_bound(x);
            if(lw != save.begin()){
                --lw;
                if((x - *lw) <= d){
                   
                    dsu.unon(x, *lw);
                }
            }
            auto hg = save.upper_bound(x);
            if(hg != save.end()){
                if((*hg - x) <= d){
                    dsu.unon(x, *hg);
                }
            }
            int lft = dsu.fp(x);
            dp[x] = get(1, 1, n, lft, x - 1) + 1;
            save.insert(x);
            ans = max(ans, dp[x]);
            upd(1, 1, n, x, dp[x]);
        }
    }
    //for(int i = 1; i <= n; i++)cout << dp[i] << ' ';
    cout << ans;
}

Compilation message

Main.cpp: In member function 'void DSU::to_last()':
Main.cpp:61:30: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
   61 |         while(past_sz.size() != checkpoint.back())rollback();
      |               ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31660 KB Output is correct
2 Correct 18 ms 31612 KB Output is correct
3 Correct 16 ms 31612 KB Output is correct
4 Correct 16 ms 31548 KB Output is correct
5 Correct 18 ms 31664 KB Output is correct
6 Correct 14 ms 31596 KB Output is correct
7 Correct 14 ms 31576 KB Output is correct
8 Correct 16 ms 31596 KB Output is correct
9 Correct 16 ms 31608 KB Output is correct
10 Correct 14 ms 31600 KB Output is correct
11 Correct 14 ms 31544 KB Output is correct
12 Correct 15 ms 31568 KB Output is correct
13 Correct 18 ms 31540 KB Output is correct
14 Correct 13 ms 31572 KB Output is correct
15 Correct 14 ms 31660 KB Output is correct
16 Correct 13 ms 31556 KB Output is correct
17 Correct 15 ms 31592 KB Output is correct
18 Correct 16 ms 31648 KB Output is correct
19 Correct 16 ms 31528 KB Output is correct
20 Correct 14 ms 31592 KB Output is correct
21 Correct 21 ms 31560 KB Output is correct
22 Correct 17 ms 31628 KB Output is correct
23 Correct 19 ms 31572 KB Output is correct
24 Correct 21 ms 31572 KB Output is correct
25 Correct 15 ms 31560 KB Output is correct
26 Correct 18 ms 31572 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31660 KB Output is correct
2 Correct 18 ms 31612 KB Output is correct
3 Correct 16 ms 31612 KB Output is correct
4 Correct 16 ms 31548 KB Output is correct
5 Correct 18 ms 31664 KB Output is correct
6 Correct 14 ms 31596 KB Output is correct
7 Correct 14 ms 31576 KB Output is correct
8 Correct 16 ms 31596 KB Output is correct
9 Correct 16 ms 31608 KB Output is correct
10 Correct 14 ms 31600 KB Output is correct
11 Correct 14 ms 31544 KB Output is correct
12 Correct 15 ms 31568 KB Output is correct
13 Correct 18 ms 31540 KB Output is correct
14 Correct 13 ms 31572 KB Output is correct
15 Correct 14 ms 31660 KB Output is correct
16 Correct 13 ms 31556 KB Output is correct
17 Correct 15 ms 31592 KB Output is correct
18 Correct 16 ms 31648 KB Output is correct
19 Correct 16 ms 31528 KB Output is correct
20 Correct 14 ms 31592 KB Output is correct
21 Correct 21 ms 31560 KB Output is correct
22 Correct 17 ms 31628 KB Output is correct
23 Correct 19 ms 31572 KB Output is correct
24 Correct 21 ms 31572 KB Output is correct
25 Correct 15 ms 31560 KB Output is correct
26 Correct 18 ms 31572 KB Output is correct
27 Correct 18 ms 31700 KB Output is correct
28 Correct 16 ms 31648 KB Output is correct
29 Correct 14 ms 31612 KB Output is correct
30 Correct 15 ms 31660 KB Output is correct
31 Correct 16 ms 31572 KB Output is correct
32 Correct 19 ms 31704 KB Output is correct
33 Correct 18 ms 31588 KB Output is correct
34 Correct 17 ms 31700 KB Output is correct
35 Correct 15 ms 31692 KB Output is correct
36 Correct 19 ms 31708 KB Output is correct
37 Correct 18 ms 31656 KB Output is correct
38 Correct 14 ms 31592 KB Output is correct
39 Correct 17 ms 31640 KB Output is correct
40 Correct 16 ms 31700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31660 KB Output is correct
2 Correct 18 ms 31612 KB Output is correct
3 Correct 16 ms 31612 KB Output is correct
4 Correct 16 ms 31548 KB Output is correct
5 Correct 18 ms 31664 KB Output is correct
6 Correct 14 ms 31596 KB Output is correct
7 Correct 14 ms 31576 KB Output is correct
8 Correct 16 ms 31596 KB Output is correct
9 Correct 16 ms 31608 KB Output is correct
10 Correct 14 ms 31600 KB Output is correct
11 Correct 14 ms 31544 KB Output is correct
12 Correct 15 ms 31568 KB Output is correct
13 Correct 18 ms 31540 KB Output is correct
14 Correct 13 ms 31572 KB Output is correct
15 Correct 14 ms 31660 KB Output is correct
16 Correct 13 ms 31556 KB Output is correct
17 Correct 15 ms 31592 KB Output is correct
18 Correct 16 ms 31648 KB Output is correct
19 Correct 16 ms 31528 KB Output is correct
20 Correct 14 ms 31592 KB Output is correct
21 Correct 21 ms 31560 KB Output is correct
22 Correct 17 ms 31628 KB Output is correct
23 Correct 19 ms 31572 KB Output is correct
24 Correct 21 ms 31572 KB Output is correct
25 Correct 15 ms 31560 KB Output is correct
26 Correct 18 ms 31572 KB Output is correct
27 Correct 18 ms 31700 KB Output is correct
28 Correct 16 ms 31648 KB Output is correct
29 Correct 14 ms 31612 KB Output is correct
30 Correct 15 ms 31660 KB Output is correct
31 Correct 16 ms 31572 KB Output is correct
32 Correct 19 ms 31704 KB Output is correct
33 Correct 18 ms 31588 KB Output is correct
34 Correct 17 ms 31700 KB Output is correct
35 Correct 15 ms 31692 KB Output is correct
36 Correct 19 ms 31708 KB Output is correct
37 Correct 18 ms 31656 KB Output is correct
38 Correct 14 ms 31592 KB Output is correct
39 Correct 17 ms 31640 KB Output is correct
40 Correct 16 ms 31700 KB Output is correct
41 Correct 20 ms 32120 KB Output is correct
42 Correct 24 ms 32340 KB Output is correct
43 Correct 22 ms 32140 KB Output is correct
44 Correct 18 ms 32116 KB Output is correct
45 Correct 19 ms 32176 KB Output is correct
46 Correct 20 ms 32372 KB Output is correct
47 Correct 21 ms 32288 KB Output is correct
48 Correct 19 ms 32348 KB Output is correct
49 Correct 24 ms 32340 KB Output is correct
50 Correct 24 ms 32280 KB Output is correct
51 Correct 20 ms 32264 KB Output is correct
52 Correct 25 ms 32300 KB Output is correct
53 Correct 18 ms 32340 KB Output is correct
54 Correct 22 ms 32472 KB Output is correct
55 Correct 22 ms 32260 KB Output is correct
56 Correct 18 ms 32340 KB Output is correct
57 Correct 22 ms 32320 KB Output is correct
58 Correct 21 ms 32372 KB Output is correct
59 Correct 18 ms 32344 KB Output is correct
60 Correct 18 ms 32244 KB Output is correct
61 Correct 22 ms 32356 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 54524 KB Output is correct
2 Correct 252 ms 54660 KB Output is correct
3 Correct 470 ms 54904 KB Output is correct
4 Correct 637 ms 61332 KB Output is correct
5 Correct 461 ms 62744 KB Output is correct
6 Correct 613 ms 62788 KB Output is correct
7 Correct 248 ms 62540 KB Output is correct
8 Correct 253 ms 65504 KB Output is correct
9 Correct 224 ms 65648 KB Output is correct
10 Correct 214 ms 65620 KB Output is correct
11 Correct 351 ms 65560 KB Output is correct
12 Correct 413 ms 65608 KB Output is correct
13 Correct 461 ms 65720 KB Output is correct
14 Correct 641 ms 65568 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 54484 KB Output is correct
2 Correct 809 ms 54660 KB Output is correct
3 Correct 664 ms 58128 KB Output is correct
4 Correct 714 ms 65564 KB Output is correct
5 Correct 639 ms 65576 KB Output is correct
6 Correct 655 ms 65568 KB Output is correct
7 Correct 264 ms 65620 KB Output is correct
8 Correct 272 ms 65684 KB Output is correct
9 Correct 259 ms 65404 KB Output is correct
10 Correct 379 ms 65504 KB Output is correct
11 Correct 642 ms 65588 KB Output is correct
12 Correct 881 ms 65648 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31660 KB Output is correct
2 Correct 18 ms 31612 KB Output is correct
3 Correct 16 ms 31612 KB Output is correct
4 Correct 16 ms 31548 KB Output is correct
5 Correct 18 ms 31664 KB Output is correct
6 Correct 14 ms 31596 KB Output is correct
7 Correct 14 ms 31576 KB Output is correct
8 Correct 16 ms 31596 KB Output is correct
9 Correct 16 ms 31608 KB Output is correct
10 Correct 14 ms 31600 KB Output is correct
11 Correct 14 ms 31544 KB Output is correct
12 Correct 15 ms 31568 KB Output is correct
13 Correct 18 ms 31540 KB Output is correct
14 Correct 13 ms 31572 KB Output is correct
15 Correct 14 ms 31660 KB Output is correct
16 Correct 13 ms 31556 KB Output is correct
17 Correct 15 ms 31592 KB Output is correct
18 Correct 16 ms 31648 KB Output is correct
19 Correct 16 ms 31528 KB Output is correct
20 Correct 14 ms 31592 KB Output is correct
21 Correct 21 ms 31560 KB Output is correct
22 Correct 17 ms 31628 KB Output is correct
23 Correct 19 ms 31572 KB Output is correct
24 Correct 21 ms 31572 KB Output is correct
25 Correct 15 ms 31560 KB Output is correct
26 Correct 18 ms 31572 KB Output is correct
27 Correct 18 ms 31700 KB Output is correct
28 Correct 16 ms 31648 KB Output is correct
29 Correct 14 ms 31612 KB Output is correct
30 Correct 15 ms 31660 KB Output is correct
31 Correct 16 ms 31572 KB Output is correct
32 Correct 19 ms 31704 KB Output is correct
33 Correct 18 ms 31588 KB Output is correct
34 Correct 17 ms 31700 KB Output is correct
35 Correct 15 ms 31692 KB Output is correct
36 Correct 19 ms 31708 KB Output is correct
37 Correct 18 ms 31656 KB Output is correct
38 Correct 14 ms 31592 KB Output is correct
39 Correct 17 ms 31640 KB Output is correct
40 Correct 16 ms 31700 KB Output is correct
41 Correct 20 ms 32120 KB Output is correct
42 Correct 24 ms 32340 KB Output is correct
43 Correct 22 ms 32140 KB Output is correct
44 Correct 18 ms 32116 KB Output is correct
45 Correct 19 ms 32176 KB Output is correct
46 Correct 20 ms 32372 KB Output is correct
47 Correct 21 ms 32288 KB Output is correct
48 Correct 19 ms 32348 KB Output is correct
49 Correct 24 ms 32340 KB Output is correct
50 Correct 24 ms 32280 KB Output is correct
51 Correct 20 ms 32264 KB Output is correct
52 Correct 25 ms 32300 KB Output is correct
53 Correct 18 ms 32340 KB Output is correct
54 Correct 22 ms 32472 KB Output is correct
55 Correct 22 ms 32260 KB Output is correct
56 Correct 18 ms 32340 KB Output is correct
57 Correct 22 ms 32320 KB Output is correct
58 Correct 21 ms 32372 KB Output is correct
59 Correct 18 ms 32344 KB Output is correct
60 Correct 18 ms 32244 KB Output is correct
61 Correct 22 ms 32356 KB Output is correct
62 Correct 262 ms 54524 KB Output is correct
63 Correct 252 ms 54660 KB Output is correct
64 Correct 470 ms 54904 KB Output is correct
65 Correct 637 ms 61332 KB Output is correct
66 Correct 461 ms 62744 KB Output is correct
67 Correct 613 ms 62788 KB Output is correct
68 Correct 248 ms 62540 KB Output is correct
69 Correct 253 ms 65504 KB Output is correct
70 Correct 224 ms 65648 KB Output is correct
71 Correct 214 ms 65620 KB Output is correct
72 Correct 351 ms 65560 KB Output is correct
73 Correct 413 ms 65608 KB Output is correct
74 Correct 461 ms 65720 KB Output is correct
75 Correct 641 ms 65568 KB Output is correct
76 Correct 232 ms 54484 KB Output is correct
77 Correct 809 ms 54660 KB Output is correct
78 Correct 664 ms 58128 KB Output is correct
79 Correct 714 ms 65564 KB Output is correct
80 Correct 639 ms 65576 KB Output is correct
81 Correct 655 ms 65568 KB Output is correct
82 Correct 264 ms 65620 KB Output is correct
83 Correct 272 ms 65684 KB Output is correct
84 Correct 259 ms 65404 KB Output is correct
85 Correct 379 ms 65504 KB Output is correct
86 Correct 642 ms 65588 KB Output is correct
87 Correct 881 ms 65648 KB Output is correct
88 Correct 578 ms 57796 KB Output is correct
89 Correct 746 ms 65236 KB Output is correct
90 Correct 615 ms 58996 KB Output is correct
91 Correct 800 ms 65576 KB Output is correct
92 Correct 1801 ms 57948 KB Output is correct
93 Correct 650 ms 57868 KB Output is correct
94 Correct 691 ms 62856 KB Output is correct
95 Correct 557 ms 65604 KB Output is correct
96 Correct 653 ms 65584 KB Output is correct
97 Correct 770 ms 65552 KB Output is correct
98 Correct 739 ms 65644 KB Output is correct
99 Correct 669 ms 65560 KB Output is correct
100 Correct 745 ms 65576 KB Output is correct
101 Correct 242 ms 65608 KB Output is correct
102 Correct 256 ms 65616 KB Output is correct
103 Correct 312 ms 65576 KB Output is correct
104 Correct 321 ms 65596 KB Output is correct
105 Correct 472 ms 65624 KB Output is correct
106 Correct 349 ms 65632 KB Output is correct
107 Correct 480 ms 65652 KB Output is correct
108 Correct 611 ms 65652 KB Output is correct
109 Correct 356 ms 65720 KB Output is correct
110 Correct 622 ms 65540 KB Output is correct
111 Correct 789 ms 65632 KB Output is correct
112 Correct 344 ms 65580 KB Output is correct
113 Correct 607 ms 65684 KB Output is correct
114 Correct 619 ms 65660 KB Output is correct
115 Correct 267 ms 65560 KB Output is correct
116 Correct 307 ms 65636 KB Output is correct
117 Correct 310 ms 65608 KB Output is correct
118 Correct 324 ms 65628 KB Output is correct
119 Correct 336 ms 65612 KB Output is correct
120 Correct 323 ms 65576 KB Output is correct