oj.uz

Submission #868608

# Submission time Handle Problem Language Result Execution time Memory
868608 2023-11-01T01:46:24 Z prohacker Financial Report (JOI21_financial) C++14
53 / 100
 289 ms 45652 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double

using namespace std;

const int N = 3e5+10;
const int INF = INT_MAX;
const int mod = 1e9+7;

int n,rmq[N][15];
int a[N],dp[N];
int D,lg[N];
multiset<int> s;
pair<int,int> b[N];

void pre_calc() {
    for(int i = 1 ; i < D ; i++) {
        s.insert(a[i]);
    }
    for(int i = D ; i <= n ; i++) {
        s.insert(a[i]);
        rmq[i][0] = *s.begin();
        s.erase(s.find(a[i-D+1]));
    }
    for(int j = 1 ; (1 << j) <= n ; j++) {
        for(int i = 1 ; i + (1 << j) - 1 <= n ; i++) {
            rmq[i][j] = max(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
        }
    }
    for(int i = 1 ; i <= n ; i++) {
        b[i] = {a[i],i};
    }
}

int get(int u, int v) {
    int k = lg[v-u+1];
    return max(rmq[u][k],rmq[v-(1<<k)+1][k]);
}
//
int Find(int st) {
    int l = st+D;
    int r = n;
    int res = n;
    while(l <= r) {
        int mid = l + r >> 1;
        if(get(st+D,mid) > a[st]) {
            res = mid;
            r = mid-1;
        }
        else {
            l = mid+1;
        }
    }
    return res;
}

int tree[4*N];

void update(int pos, int val, int id = 1, int l = 1, int r = n) {
    if(l == r) {
        tree[id] = val;
        return;
    }
    int mid = l + r >> 1;
    if(pos <= mid) {
        update(pos,val,id << 1,l,mid);
    }
    else {
        update(pos,val,id << 1 | 1,mid+1,r);
    }
    tree[id] = max(tree[id << 1],tree[id << 1 | 1]);
}

int get_dp(int u, int v, int id = 1, int l = 1, int r = n) {
    if(v < l or r < u) {
        return 0;
    }
    if(u <= l and r <= v) {
        return tree[id];
    }
    int mid = l + r >> 1;
    return max(get_dp(u,v,id << 1,l,mid),get_dp(u,v,id << 1 | 1,mid+1,r));
}

signed main()
{
    if (fopen("financial.inp", "r")) {
        freopen("financial.inp", "r", stdin);
        freopen("financial.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> D;
    for(int i = 1 ; i <= n ; i++) {
        cin >> a[i];
    }
    for(int i = 1 ; i <= n ; i++) {
        lg[i] = __lg(i);
    }
    pre_calc();
    sort(b+1,b+n+1,[](pair<int,int> u, pair<int,int> v) {
        if(u.first != v.first) {
            return u.first > v.first;
         }
         return u.second < v.second;
    });
    for(int i = 1 ; i <= n ; i++) {
        update(b[i].second,get_dp(b[i].second+1,Find(b[i].second))+1);
    }
    cout << tree[1];
    return 0;
}

Compilation message

Main.cpp: In function 'void pre_calc()':
Main.cpp:28:52: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |             rmq[i][j] = max(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);
      |                                                   ~^~
Main.cpp: In function 'int Find(int)':
Main.cpp:46:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |         int mid = l + r >> 1;
      |                   ~~^~~
Main.cpp: In function 'void update(int, int, int, int, int)':
Main.cpp:65:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |     int mid = l + r >> 1;
      |               ~~^~~
Main.cpp: In function 'int get_dp(int, int, int, int, int)':
Main.cpp:82:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   82 |     int mid = l + r >> 1;
      |               ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen("financial.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen("financial.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8624 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8664 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8592 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct
24 Correct 1 ms 8540 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 1 ms 8540 KB Output is correct
30 Correct 1 ms 8540 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8540 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 1 ms 8540 KB Output is correct
37 Correct 1 ms 8660 KB Output is correct
38 Correct 2 ms 8668 KB Output is correct
39 Correct 2 ms 8672 KB Output is correct
40 Correct 1 ms 8540 KB Output is correct
41 Correct 4 ms 8796 KB Output is correct
42 Correct 6 ms 8796 KB Output is correct
43 Correct 4 ms 8796 KB Output is correct
44 Correct 4 ms 8796 KB Output is correct
45 Correct 5 ms 8796 KB Output is correct
46 Correct 4 ms 9052 KB Output is correct
47 Correct 4 ms 9052 KB Output is correct
48 Correct 5 ms 8792 KB Output is correct
49 Correct 5 ms 8796 KB Output is correct
50 Correct 6 ms 8796 KB Output is correct
51 Correct 4 ms 8792 KB Output is correct
52 Correct 4 ms 8796 KB Output is correct
53 Correct 4 ms 8676 KB Output is correct
54 Correct 5 ms 8796 KB Output is correct
55 Correct 5 ms 8796 KB Output is correct
56 Correct 5 ms 8792 KB Output is correct
57 Correct 4 ms 8796 KB Output is correct
58 Correct 4 ms 8936 KB Output is correct
59 Correct 4 ms 9052 KB Output is correct
60 Correct 4 ms 8796 KB Output is correct
61 Correct 4 ms 8792 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 31284 KB Output is correct
2 Correct 185 ms 31176 KB Output is correct
3 Incorrect 289 ms 31316 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 45600 KB Output is correct
2 Correct 235 ms 45496 KB Output is correct
3 Correct 254 ms 45600 KB Output is correct
4 Correct 286 ms 45652 KB Output is correct
5 Correct 219 ms 45652 KB Output is correct
6 Correct 250 ms 45384 KB Output is correct
7 Correct 172 ms 45584 KB Output is correct
8 Correct 167 ms 45384 KB Output is correct
9 Correct 198 ms 45212 KB Output is correct
10 Correct 210 ms 45316 KB Output is correct
11 Correct 234 ms 45392 KB Output is correct
12 Correct 219 ms 45504 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8624 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8664 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8592 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct
24 Correct 1 ms 8540 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 1 ms 8540 KB Output is correct
30 Correct 1 ms 8540 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8540 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 1 ms 8540 KB Output is correct
37 Correct 1 ms 8660 KB Output is correct
38 Correct 2 ms 8668 KB Output is correct
39 Correct 2 ms 8672 KB Output is correct
40 Correct 1 ms 8540 KB Output is correct
41 Correct 4 ms 8796 KB Output is correct
42 Correct 6 ms 8796 KB Output is correct
43 Correct 4 ms 8796 KB Output is correct
44 Correct 4 ms 8796 KB Output is correct
45 Correct 5 ms 8796 KB Output is correct
46 Correct 4 ms 9052 KB Output is correct
47 Correct 4 ms 9052 KB Output is correct
48 Correct 5 ms 8792 KB Output is correct
49 Correct 5 ms 8796 KB Output is correct
50 Correct 6 ms 8796 KB Output is correct
51 Correct 4 ms 8792 KB Output is correct
52 Correct 4 ms 8796 KB Output is correct
53 Correct 4 ms 8676 KB Output is correct
54 Correct 5 ms 8796 KB Output is correct
55 Correct 5 ms 8796 KB Output is correct
56 Correct 5 ms 8792 KB Output is correct
57 Correct 4 ms 8796 KB Output is correct
58 Correct 4 ms 8936 KB Output is correct
59 Correct 4 ms 9052 KB Output is correct
60 Correct 4 ms 8796 KB Output is correct
61 Correct 4 ms 8792 KB Output is correct
62 Correct 134 ms 31284 KB Output is correct
63 Correct 185 ms 31176 KB Output is correct
64 Incorrect 289 ms 31316 KB Output isn't correct
65 Halted 0 ms 0 KB -