oj.uz

Submission #813677

# Submission time Handle Problem Language Result Execution time Memory
813677 2023-08-08T01:43:58 Z Cookie Financial Report (JOI21_financial) C++14
48 / 100
 4000 ms 61496 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 = 1e5 + 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();
    }
};
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); dp[i] = -1;
    }
    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] = 1;
            for(int l = x - 1; l >= lft; l--){
                dp[x] = max(dp[x], dp[l] + 1);
            }
            save.insert(x);
            ans = max(ans, dp[x]);
            //cout << x << " " << dp[x] << "\n";
        }
    }
    //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 16 ms 31572 KB Output is correct
2 Correct 17 ms 31632 KB Output is correct
3 Correct 18 ms 31572 KB Output is correct
4 Correct 17 ms 31572 KB Output is correct
5 Correct 17 ms 31640 KB Output is correct
6 Correct 17 ms 31640 KB Output is correct
7 Correct 19 ms 31564 KB Output is correct
8 Correct 17 ms 31632 KB Output is correct
9 Correct 17 ms 31572 KB Output is correct
10 Correct 17 ms 31572 KB Output is correct
11 Correct 16 ms 31648 KB Output is correct
12 Correct 19 ms 31656 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31700 KB Output is correct
15 Correct 16 ms 31660 KB Output is correct
16 Correct 17 ms 31632 KB Output is correct
17 Correct 16 ms 31572 KB Output is correct
18 Correct 17 ms 31640 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 17 ms 31660 KB Output is correct
21 Correct 17 ms 31664 KB Output is correct
22 Correct 16 ms 31572 KB Output is correct
23 Correct 17 ms 31572 KB Output is correct
24 Correct 16 ms 31572 KB Output is correct
25 Correct 17 ms 31560 KB Output is correct
26 Correct 16 ms 31572 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 17 ms 31632 KB Output is correct
3 Correct 18 ms 31572 KB Output is correct
4 Correct 17 ms 31572 KB Output is correct
5 Correct 17 ms 31640 KB Output is correct
6 Correct 17 ms 31640 KB Output is correct
7 Correct 19 ms 31564 KB Output is correct
8 Correct 17 ms 31632 KB Output is correct
9 Correct 17 ms 31572 KB Output is correct
10 Correct 17 ms 31572 KB Output is correct
11 Correct 16 ms 31648 KB Output is correct
12 Correct 19 ms 31656 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31700 KB Output is correct
15 Correct 16 ms 31660 KB Output is correct
16 Correct 17 ms 31632 KB Output is correct
17 Correct 16 ms 31572 KB Output is correct
18 Correct 17 ms 31640 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 17 ms 31660 KB Output is correct
21 Correct 17 ms 31664 KB Output is correct
22 Correct 16 ms 31572 KB Output is correct
23 Correct 17 ms 31572 KB Output is correct
24 Correct 16 ms 31572 KB Output is correct
25 Correct 17 ms 31560 KB Output is correct
26 Correct 16 ms 31572 KB Output is correct
27 Correct 17 ms 31636 KB Output is correct
28 Correct 17 ms 31640 KB Output is correct
29 Correct 16 ms 31604 KB Output is correct
30 Correct 17 ms 31700 KB Output is correct
31 Correct 17 ms 31684 KB Output is correct
32 Correct 17 ms 31636 KB Output is correct
33 Correct 17 ms 31700 KB Output is correct
34 Correct 17 ms 31672 KB Output is correct
35 Correct 16 ms 31648 KB Output is correct
36 Correct 17 ms 31672 KB Output is correct
37 Correct 18 ms 31612 KB Output is correct
38 Correct 16 ms 31700 KB Output is correct
39 Correct 18 ms 31648 KB Output is correct
40 Correct 16 ms 31704 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 17 ms 31632 KB Output is correct
3 Correct 18 ms 31572 KB Output is correct
4 Correct 17 ms 31572 KB Output is correct
5 Correct 17 ms 31640 KB Output is correct
6 Correct 17 ms 31640 KB Output is correct
7 Correct 19 ms 31564 KB Output is correct
8 Correct 17 ms 31632 KB Output is correct
9 Correct 17 ms 31572 KB Output is correct
10 Correct 17 ms 31572 KB Output is correct
11 Correct 16 ms 31648 KB Output is correct
12 Correct 19 ms 31656 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31700 KB Output is correct
15 Correct 16 ms 31660 KB Output is correct
16 Correct 17 ms 31632 KB Output is correct
17 Correct 16 ms 31572 KB Output is correct
18 Correct 17 ms 31640 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 17 ms 31660 KB Output is correct
21 Correct 17 ms 31664 KB Output is correct
22 Correct 16 ms 31572 KB Output is correct
23 Correct 17 ms 31572 KB Output is correct
24 Correct 16 ms 31572 KB Output is correct
25 Correct 17 ms 31560 KB Output is correct
26 Correct 16 ms 31572 KB Output is correct
27 Correct 17 ms 31636 KB Output is correct
28 Correct 17 ms 31640 KB Output is correct
29 Correct 16 ms 31604 KB Output is correct
30 Correct 17 ms 31700 KB Output is correct
31 Correct 17 ms 31684 KB Output is correct
32 Correct 17 ms 31636 KB Output is correct
33 Correct 17 ms 31700 KB Output is correct
34 Correct 17 ms 31672 KB Output is correct
35 Correct 16 ms 31648 KB Output is correct
36 Correct 17 ms 31672 KB Output is correct
37 Correct 18 ms 31612 KB Output is correct
38 Correct 16 ms 31700 KB Output is correct
39 Correct 18 ms 31648 KB Output is correct
40 Correct 16 ms 31704 KB Output is correct
41 Correct 21 ms 32212 KB Output is correct
42 Correct 21 ms 32252 KB Output is correct
43 Correct 22 ms 32132 KB Output is correct
44 Correct 33 ms 32088 KB Output is correct
45 Correct 48 ms 32192 KB Output is correct
46 Correct 45 ms 32336 KB Output is correct
47 Correct 33 ms 32212 KB Output is correct
48 Correct 34 ms 32340 KB Output is correct
49 Correct 32 ms 32292 KB Output is correct
50 Correct 39 ms 32272 KB Output is correct
51 Correct 21 ms 32284 KB Output is correct
52 Correct 22 ms 32340 KB Output is correct
53 Correct 43 ms 32276 KB Output is correct
54 Correct 43 ms 32324 KB Output is correct
55 Correct 45 ms 32296 KB Output is correct
56 Correct 44 ms 32240 KB Output is correct
57 Correct 43 ms 32272 KB Output is correct
58 Correct 44 ms 32252 KB Output is correct
59 Correct 43 ms 32240 KB Output is correct
60 Correct 43 ms 32236 KB Output is correct
61 Correct 42 ms 32300 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 50420 KB Output is correct
2 Correct 149 ms 53124 KB Output is correct
3 Correct 201 ms 53644 KB Output is correct
4 Correct 335 ms 60064 KB Output is correct
5 Correct 288 ms 61496 KB Output is correct
6 Correct 336 ms 61456 KB Output is correct
7 Execution timed out 4053 ms 51560 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 50352 KB Output is correct
2 Execution timed out 4032 ms 40636 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 31572 KB Output is correct
2 Correct 17 ms 31632 KB Output is correct
3 Correct 18 ms 31572 KB Output is correct
4 Correct 17 ms 31572 KB Output is correct
5 Correct 17 ms 31640 KB Output is correct
6 Correct 17 ms 31640 KB Output is correct
7 Correct 19 ms 31564 KB Output is correct
8 Correct 17 ms 31632 KB Output is correct
9 Correct 17 ms 31572 KB Output is correct
10 Correct 17 ms 31572 KB Output is correct
11 Correct 16 ms 31648 KB Output is correct
12 Correct 19 ms 31656 KB Output is correct
13 Correct 17 ms 31572 KB Output is correct
14 Correct 17 ms 31700 KB Output is correct
15 Correct 16 ms 31660 KB Output is correct
16 Correct 17 ms 31632 KB Output is correct
17 Correct 16 ms 31572 KB Output is correct
18 Correct 17 ms 31640 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 17 ms 31660 KB Output is correct
21 Correct 17 ms 31664 KB Output is correct
22 Correct 16 ms 31572 KB Output is correct
23 Correct 17 ms 31572 KB Output is correct
24 Correct 16 ms 31572 KB Output is correct
25 Correct 17 ms 31560 KB Output is correct
26 Correct 16 ms 31572 KB Output is correct
27 Correct 17 ms 31636 KB Output is correct
28 Correct 17 ms 31640 KB Output is correct
29 Correct 16 ms 31604 KB Output is correct
30 Correct 17 ms 31700 KB Output is correct
31 Correct 17 ms 31684 KB Output is correct
32 Correct 17 ms 31636 KB Output is correct
33 Correct 17 ms 31700 KB Output is correct
34 Correct 17 ms 31672 KB Output is correct
35 Correct 16 ms 31648 KB Output is correct
36 Correct 17 ms 31672 KB Output is correct
37 Correct 18 ms 31612 KB Output is correct
38 Correct 16 ms 31700 KB Output is correct
39 Correct 18 ms 31648 KB Output is correct
40 Correct 16 ms 31704 KB Output is correct
41 Correct 21 ms 32212 KB Output is correct
42 Correct 21 ms 32252 KB Output is correct
43 Correct 22 ms 32132 KB Output is correct
44 Correct 33 ms 32088 KB Output is correct
45 Correct 48 ms 32192 KB Output is correct
46 Correct 45 ms 32336 KB Output is correct
47 Correct 33 ms 32212 KB Output is correct
48 Correct 34 ms 32340 KB Output is correct
49 Correct 32 ms 32292 KB Output is correct
50 Correct 39 ms 32272 KB Output is correct
51 Correct 21 ms 32284 KB Output is correct
52 Correct 22 ms 32340 KB Output is correct
53 Correct 43 ms 32276 KB Output is correct
54 Correct 43 ms 32324 KB Output is correct
55 Correct 45 ms 32296 KB Output is correct
56 Correct 44 ms 32240 KB Output is correct
57 Correct 43 ms 32272 KB Output is correct
58 Correct 44 ms 32252 KB Output is correct
59 Correct 43 ms 32240 KB Output is correct
60 Correct 43 ms 32236 KB Output is correct
61 Correct 42 ms 32300 KB Output is correct
62 Correct 160 ms 50420 KB Output is correct
63 Correct 149 ms 53124 KB Output is correct
64 Correct 201 ms 53644 KB Output is correct
65 Correct 335 ms 60064 KB Output is correct
66 Correct 288 ms 61496 KB Output is correct
67 Correct 336 ms 61456 KB Output is correct
68 Execution timed out 4053 ms 51560 KB Time limit exceeded
69 Halted 0 ms 0 KB -