oj.uz

Submission #469227

# Submission time Handle Problem Language Result Execution time Memory
469227 2021-08-31T07:55:21 Z Vladth11 Financial Report (JOI21_financial) C++14
100 / 100
 783 ms 242800 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> OST;
 
const ll NMAX = 300001;
const ll INF = (1LL << 60);
const ll HALF = (1LL << 59);
const ll MOD = 30013;
const ll BLOCK = 318;
const ll base = 31;
const ll nr_of_bits = 21;
 
int dp[NMAX];
int v[NMAX];
map <int, int> mp;
int n;
 
class AINT{
public:
    deque <pii> a[NMAX];
    int aint[NMAX * 4];
    void update(int node, int st, int dr, int poz, pii x){
        if(st == dr){
            while(a[st].size() && a[st].back().first <= x.first)
                a[st].pop_back();
            a[st].push_back(x);
            aint[node] = a[st].front().first;
            return;
        }
        int mid = (st + dr) / 2;
        if(poz <= mid){
            update(node * 2, st, mid, poz, x);
        }else{
            update(node * 2 + 1, mid + 1, dr, poz, x);
        }
        aint[node] = max(aint[node * 2],  aint[node * 2 + 1]);
    }
    void sterge(int node, int st, int dr, int poz, int x){
        if(st == dr){
            while(a[st].size() && a[st].front().second < x)
                a[st].pop_front();
            if(a[st].size())
            aint[node] = a[st].front().first;
            else aint[node] = 0;
            return;
        }
        int mid = (st + dr) / 2;
        if(poz <= mid){
            sterge(node * 2, st, mid, poz, x);
        }else{
            sterge(node * 2 + 1, mid + 1, dr, poz, x);
        }
        aint[node] = max(aint[node * 2],  aint[node * 2 + 1]);
    }
    int query(int node, int st, int dr, int a, int b){
        if(a <= st && dr <= b){
            return aint[node];
        }
        int mid = (st + dr) / 2;
        int maxim = 0;
        if(a <= mid){
            maxim = max(maxim, query(node * 2, st, mid, a, b));
        }
        if(b > mid){
            maxim = max(maxim, query(node * 2 + 1, mid + 1, dr, a, b));
        }
        return maxim;
    }
    void insert(int poz, pii x){
        update(1, 1, NMAX - 1, poz, x);
    }
    void erase(int poz, int upd){
        sterge(1, 1, NMAX - 1, poz, upd);
    }
}aint;
 
int nrm[NMAX];
int bloc[NMAX];
int aib[NMAX];
 
void update(int node, int val){
    for(; node > 0; node -= node&(-node)){
        aib[node] = min(aib[node], val);
    }
}
 
int query(int node){
    int minim = 2e9;
    for(; node < NMAX; node += node&(-node)){
        minim = min(minim, aib[node]);
    }
    return minim;
}
 
vector <int> del[NMAX];
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i, d;
    cin >> n >> d;
    for(i = 1; i <= n; i++){
        cin >> v[i];
        nrm[i] = v[i];
    }
    for(i = NMAX - 1; i > 0; i--)
        aib[i] = 2e9;
    sort(v + 1, v + n + 1);
    int cnt = 0;
    for(i = 1; i <= n; i++){
        if(i == 1 || v[i] != v[i - 1])
            cnt++;
        mp[v[i]] = cnt;
    }
    for(i = 1; i <= n; i++){
        v[i] = nrm[i];
        v[i] = mp[v[i]];
    }
    int maxim = 0;
    deque <int> minim; /// si aici putem face o schema
    for(i = n; i > n - d + 1; i--){
        while(minim.size() && minim.back() > v[i])
            minim.pop_back();
        minim.push_back(v[i]);
    }
    for(i = n - d + 1; i >= 1; i--){
        if(i <= n - d){
            if(minim.size() && minim.front() == v[i + d])
                minim.pop_front();
        }
         while(minim.size() && minim.back() > v[i])
            minim.pop_back();
        minim.push_back(v[i]);
        bloc[i] = minim.front();
    }
    for(i = n - d + 1; i >= 1; i--){
        int unde = query(v[i] + 1);
        if(unde <= n) /// putem avea si n + 1
            del[unde].push_back(i);
        update(bloc[i], i + d);
    }
    /// de incercat normalizarea mai rapid
    for(i = 1; i <= n; i++){
        for(auto x : del[i]){
            aint.erase(v[x], x + 1);
        }
        if(v[i] > 1)
        dp[i] = aint.query(1, 1, NMAX - 1, 1, v[i] - 1) + 1;
        else dp[i] = 1;
        aint.insert(v[i], {dp[i], i});
    }
    cout << aint.query(1, 1, NMAX - 1, 1, NMAX - 1);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:130:9: warning: unused variable 'maxim' [-Wunused-variable]
  130 |     int maxim = 0;
      |         ^~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 210500 KB Output is correct
2 Correct 135 ms 210480 KB Output is correct
3 Correct 135 ms 210532 KB Output is correct
4 Correct 134 ms 210564 KB Output is correct
5 Correct 134 ms 210756 KB Output is correct
6 Correct 134 ms 210432 KB Output is correct
7 Correct 138 ms 210500 KB Output is correct
8 Correct 136 ms 210708 KB Output is correct
9 Correct 137 ms 210548 KB Output is correct
10 Correct 134 ms 210500 KB Output is correct
11 Correct 134 ms 210492 KB Output is correct
12 Correct 136 ms 210448 KB Output is correct
13 Correct 135 ms 210504 KB Output is correct
14 Correct 136 ms 210444 KB Output is correct
15 Correct 135 ms 210468 KB Output is correct
16 Correct 137 ms 210500 KB Output is correct
17 Correct 138 ms 210452 KB Output is correct
18 Correct 153 ms 210464 KB Output is correct
19 Correct 133 ms 210476 KB Output is correct
20 Correct 135 ms 210496 KB Output is correct
21 Correct 143 ms 210500 KB Output is correct
22 Correct 127 ms 210516 KB Output is correct
23 Correct 134 ms 210500 KB Output is correct
24 Correct 138 ms 210500 KB Output is correct
25 Correct 134 ms 210552 KB Output is correct
26 Correct 137 ms 210500 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 210500 KB Output is correct
2 Correct 135 ms 210480 KB Output is correct
3 Correct 135 ms 210532 KB Output is correct
4 Correct 134 ms 210564 KB Output is correct
5 Correct 134 ms 210756 KB Output is correct
6 Correct 134 ms 210432 KB Output is correct
7 Correct 138 ms 210500 KB Output is correct
8 Correct 136 ms 210708 KB Output is correct
9 Correct 137 ms 210548 KB Output is correct
10 Correct 134 ms 210500 KB Output is correct
11 Correct 134 ms 210492 KB Output is correct
12 Correct 136 ms 210448 KB Output is correct
13 Correct 135 ms 210504 KB Output is correct
14 Correct 136 ms 210444 KB Output is correct
15 Correct 135 ms 210468 KB Output is correct
16 Correct 137 ms 210500 KB Output is correct
17 Correct 138 ms 210452 KB Output is correct
18 Correct 153 ms 210464 KB Output is correct
19 Correct 133 ms 210476 KB Output is correct
20 Correct 135 ms 210496 KB Output is correct
21 Correct 143 ms 210500 KB Output is correct
22 Correct 127 ms 210516 KB Output is correct
23 Correct 134 ms 210500 KB Output is correct
24 Correct 138 ms 210500 KB Output is correct
25 Correct 134 ms 210552 KB Output is correct
26 Correct 137 ms 210500 KB Output is correct
27 Correct 139 ms 210504 KB Output is correct
28 Correct 138 ms 210500 KB Output is correct
29 Correct 136 ms 210504 KB Output is correct
30 Correct 137 ms 210572 KB Output is correct
31 Correct 131 ms 210484 KB Output is correct
32 Correct 141 ms 210568 KB Output is correct
33 Correct 137 ms 210580 KB Output is correct
34 Correct 139 ms 210500 KB Output is correct
35 Correct 136 ms 210456 KB Output is correct
36 Correct 123 ms 210500 KB Output is correct
37 Correct 138 ms 210524 KB Output is correct
38 Correct 149 ms 210576 KB Output is correct
39 Correct 136 ms 210472 KB Output is correct
40 Correct 138 ms 210576 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 210500 KB Output is correct
2 Correct 135 ms 210480 KB Output is correct
3 Correct 135 ms 210532 KB Output is correct
4 Correct 134 ms 210564 KB Output is correct
5 Correct 134 ms 210756 KB Output is correct
6 Correct 134 ms 210432 KB Output is correct
7 Correct 138 ms 210500 KB Output is correct
8 Correct 136 ms 210708 KB Output is correct
9 Correct 137 ms 210548 KB Output is correct
10 Correct 134 ms 210500 KB Output is correct
11 Correct 134 ms 210492 KB Output is correct
12 Correct 136 ms 210448 KB Output is correct
13 Correct 135 ms 210504 KB Output is correct
14 Correct 136 ms 210444 KB Output is correct
15 Correct 135 ms 210468 KB Output is correct
16 Correct 137 ms 210500 KB Output is correct
17 Correct 138 ms 210452 KB Output is correct
18 Correct 153 ms 210464 KB Output is correct
19 Correct 133 ms 210476 KB Output is correct
20 Correct 135 ms 210496 KB Output is correct
21 Correct 143 ms 210500 KB Output is correct
22 Correct 127 ms 210516 KB Output is correct
23 Correct 134 ms 210500 KB Output is correct
24 Correct 138 ms 210500 KB Output is correct
25 Correct 134 ms 210552 KB Output is correct
26 Correct 137 ms 210500 KB Output is correct
27 Correct 139 ms 210504 KB Output is correct
28 Correct 138 ms 210500 KB Output is correct
29 Correct 136 ms 210504 KB Output is correct
30 Correct 137 ms 210572 KB Output is correct
31 Correct 131 ms 210484 KB Output is correct
32 Correct 141 ms 210568 KB Output is correct
33 Correct 137 ms 210580 KB Output is correct
34 Correct 139 ms 210500 KB Output is correct
35 Correct 136 ms 210456 KB Output is correct
36 Correct 123 ms 210500 KB Output is correct
37 Correct 138 ms 210524 KB Output is correct
38 Correct 149 ms 210576 KB Output is correct
39 Correct 136 ms 210472 KB Output is correct
40 Correct 138 ms 210576 KB Output is correct
41 Correct 150 ms 210804 KB Output is correct
42 Correct 144 ms 211044 KB Output is correct
43 Correct 161 ms 210588 KB Output is correct
44 Correct 139 ms 210756 KB Output is correct
45 Correct 130 ms 210828 KB Output is correct
46 Correct 141 ms 211060 KB Output is correct
47 Correct 142 ms 211136 KB Output is correct
48 Correct 145 ms 211036 KB Output is correct
49 Correct 144 ms 211036 KB Output is correct
50 Correct 146 ms 211012 KB Output is correct
51 Correct 142 ms 211256 KB Output is correct
52 Correct 144 ms 211072 KB Output is correct
53 Correct 142 ms 211064 KB Output is correct
54 Correct 154 ms 211116 KB Output is correct
55 Correct 132 ms 211140 KB Output is correct
56 Correct 139 ms 211012 KB Output is correct
57 Correct 142 ms 211012 KB Output is correct
58 Correct 140 ms 211300 KB Output is correct
59 Correct 143 ms 211024 KB Output is correct
60 Correct 141 ms 211064 KB Output is correct
61 Correct 162 ms 211012 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 215200 KB Output is correct
2 Correct 320 ms 219332 KB Output is correct
3 Correct 371 ms 220048 KB Output is correct
4 Correct 695 ms 235660 KB Output is correct
5 Correct 665 ms 239384 KB Output is correct
6 Correct 746 ms 238160 KB Output is correct
7 Correct 453 ms 242568 KB Output is correct
8 Correct 388 ms 233312 KB Output is correct
9 Correct 461 ms 240248 KB Output is correct
10 Correct 430 ms 236852 KB Output is correct
11 Correct 561 ms 238372 KB Output is correct
12 Correct 627 ms 238292 KB Output is correct
13 Correct 718 ms 242800 KB Output is correct
14 Correct 783 ms 234692 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 215188 KB Output is correct
2 Correct 271 ms 214008 KB Output is correct
3 Correct 334 ms 214200 KB Output is correct
4 Correct 654 ms 232148 KB Output is correct
5 Correct 562 ms 232104 KB Output is correct
6 Correct 630 ms 232176 KB Output is correct
7 Correct 376 ms 232140 KB Output is correct
8 Correct 378 ms 233336 KB Output is correct
9 Correct 395 ms 231948 KB Output is correct
10 Correct 486 ms 232148 KB Output is correct
11 Correct 657 ms 232120 KB Output is correct
12 Correct 564 ms 232144 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 210500 KB Output is correct
2 Correct 135 ms 210480 KB Output is correct
3 Correct 135 ms 210532 KB Output is correct
4 Correct 134 ms 210564 KB Output is correct
5 Correct 134 ms 210756 KB Output is correct
6 Correct 134 ms 210432 KB Output is correct
7 Correct 138 ms 210500 KB Output is correct
8 Correct 136 ms 210708 KB Output is correct
9 Correct 137 ms 210548 KB Output is correct
10 Correct 134 ms 210500 KB Output is correct
11 Correct 134 ms 210492 KB Output is correct
12 Correct 136 ms 210448 KB Output is correct
13 Correct 135 ms 210504 KB Output is correct
14 Correct 136 ms 210444 KB Output is correct
15 Correct 135 ms 210468 KB Output is correct
16 Correct 137 ms 210500 KB Output is correct
17 Correct 138 ms 210452 KB Output is correct
18 Correct 153 ms 210464 KB Output is correct
19 Correct 133 ms 210476 KB Output is correct
20 Correct 135 ms 210496 KB Output is correct
21 Correct 143 ms 210500 KB Output is correct
22 Correct 127 ms 210516 KB Output is correct
23 Correct 134 ms 210500 KB Output is correct
24 Correct 138 ms 210500 KB Output is correct
25 Correct 134 ms 210552 KB Output is correct
26 Correct 137 ms 210500 KB Output is correct
27 Correct 139 ms 210504 KB Output is correct
28 Correct 138 ms 210500 KB Output is correct
29 Correct 136 ms 210504 KB Output is correct
30 Correct 137 ms 210572 KB Output is correct
31 Correct 131 ms 210484 KB Output is correct
32 Correct 141 ms 210568 KB Output is correct
33 Correct 137 ms 210580 KB Output is correct
34 Correct 139 ms 210500 KB Output is correct
35 Correct 136 ms 210456 KB Output is correct
36 Correct 123 ms 210500 KB Output is correct
37 Correct 138 ms 210524 KB Output is correct
38 Correct 149 ms 210576 KB Output is correct
39 Correct 136 ms 210472 KB Output is correct
40 Correct 138 ms 210576 KB Output is correct
41 Correct 150 ms 210804 KB Output is correct
42 Correct 144 ms 211044 KB Output is correct
43 Correct 161 ms 210588 KB Output is correct
44 Correct 139 ms 210756 KB Output is correct
45 Correct 130 ms 210828 KB Output is correct
46 Correct 141 ms 211060 KB Output is correct
47 Correct 142 ms 211136 KB Output is correct
48 Correct 145 ms 211036 KB Output is correct
49 Correct 144 ms 211036 KB Output is correct
50 Correct 146 ms 211012 KB Output is correct
51 Correct 142 ms 211256 KB Output is correct
52 Correct 144 ms 211072 KB Output is correct
53 Correct 142 ms 211064 KB Output is correct
54 Correct 154 ms 211116 KB Output is correct
55 Correct 132 ms 211140 KB Output is correct
56 Correct 139 ms 211012 KB Output is correct
57 Correct 142 ms 211012 KB Output is correct
58 Correct 140 ms 211300 KB Output is correct
59 Correct 143 ms 211024 KB Output is correct
60 Correct 141 ms 211064 KB Output is correct
61 Correct 162 ms 211012 KB Output is correct
62 Correct 233 ms 215200 KB Output is correct
63 Correct 320 ms 219332 KB Output is correct
64 Correct 371 ms 220048 KB Output is correct
65 Correct 695 ms 235660 KB Output is correct
66 Correct 665 ms 239384 KB Output is correct
67 Correct 746 ms 238160 KB Output is correct
68 Correct 453 ms 242568 KB Output is correct
69 Correct 388 ms 233312 KB Output is correct
70 Correct 461 ms 240248 KB Output is correct
71 Correct 430 ms 236852 KB Output is correct
72 Correct 561 ms 238372 KB Output is correct
73 Correct 627 ms 238292 KB Output is correct
74 Correct 718 ms 242800 KB Output is correct
75 Correct 783 ms 234692 KB Output is correct
76 Correct 233 ms 215188 KB Output is correct
77 Correct 271 ms 214008 KB Output is correct
78 Correct 334 ms 214200 KB Output is correct
79 Correct 654 ms 232148 KB Output is correct
80 Correct 562 ms 232104 KB Output is correct
81 Correct 630 ms 232176 KB Output is correct
82 Correct 376 ms 232140 KB Output is correct
83 Correct 378 ms 233336 KB Output is correct
84 Correct 395 ms 231948 KB Output is correct
85 Correct 486 ms 232148 KB Output is correct
86 Correct 657 ms 232120 KB Output is correct
87 Correct 564 ms 232144 KB Output is correct
88 Correct 403 ms 218952 KB Output is correct
89 Correct 719 ms 235844 KB Output is correct
90 Correct 538 ms 219740 KB Output is correct
91 Correct 660 ms 233680 KB Output is correct
92 Correct 281 ms 215180 KB Output is correct
93 Correct 358 ms 215664 KB Output is correct
94 Correct 603 ms 227136 KB Output is correct
95 Correct 693 ms 237652 KB Output is correct
96 Correct 778 ms 235876 KB Output is correct
97 Correct 709 ms 234872 KB Output is correct
98 Correct 695 ms 233656 KB Output is correct
99 Correct 654 ms 233408 KB Output is correct
100 Correct 652 ms 233332 KB Output is correct
101 Correct 463 ms 238056 KB Output is correct
102 Correct 475 ms 235484 KB Output is correct
103 Correct 479 ms 235076 KB Output is correct
104 Correct 514 ms 235016 KB Output is correct
105 Correct 594 ms 234492 KB Output is correct
106 Correct 465 ms 233436 KB Output is correct
107 Correct 543 ms 233464 KB Output is correct
108 Correct 656 ms 233232 KB Output is correct
109 Correct 678 ms 242692 KB Output is correct
110 Correct 657 ms 235128 KB Output is correct
111 Correct 699 ms 233700 KB Output is correct
112 Correct 658 ms 234992 KB Output is correct
113 Correct 637 ms 233576 KB Output is correct
114 Correct 620 ms 233284 KB Output is correct
115 Correct 379 ms 233436 KB Output is correct
116 Correct 386 ms 233436 KB Output is correct
117 Correct 416 ms 233356 KB Output is correct
118 Correct 421 ms 233360 KB Output is correct
119 Correct 515 ms 233360 KB Output is correct
120 Correct 497 ms 233476 KB Output is correct