oj.uz

답안 #420014

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420014 2021-06-07T22:26:33 Z Runtime_error_ Financial Report (JOI21_financial) C++14
100 / 100
 885 ms 37416 KB 
//JOIOC 2021 p2 finanicial
#include <bits/stdc++.h>
#define le node+node
#define ri node+node+1
#define mid (l+r)/2
#define pi pair<int,int>
using namespace std;
const int inf = 3e5+9;
int n,d,ans,cnt,a[inf],dp[inf];
map<int,int> mp;

int tree[inf<<2];
void update(int node,int l,int r,int idx,int val,int del){
    if(l == r){
        if(del)
            return void(tree[node] = val);
        return void(tree[node] = max(tree[node],val));
    }
    if(idx<=mid)
        update(le,l,mid,idx,val,del);
    else
        update(ri,mid+1,r,idx,val,del);
    tree[node] = max(tree[le],tree[ri]);
}

int query(int node,int l,int r,int x,int y){
    if(l>r || r<x || l>y || x>y)
        return 0;
    if(l>=x && r<=y)
        return tree[node];
    return max(query(le,l,mid,x,y),query(ri,mid+1,r,x,y));
}
deque<pair<int,int> > dq;//pair<time,val>
set<int> vals;

int main(){
    scanf("%d%d",&n,&d);
    for(int i=1;i<=n;i++)
        scanf("%d",a+i),mp[a[i]];

    for(auto &o:mp)
        o.second = ++cnt;
    for(int i=1;i<=n;i++)
        a[i] = mp[a[i]];

    for(int i=1;i<=n;i++){
        dp[i] = query(1,1,cnt,1,a[i]-1)+1;
        update(1,1,cnt,a[i],dp[i],0);
        vals.insert(a[i]);
        if(i == n)
            ans = tree[1];
        //cout<<dp[i]<<" ";
        while(!dq.empty() && dq.back().second >= a[i])
            dq.pop_back();
        dq.push_back(pi(i,a[i]));
        while(dq.front().first <= i-d)
            dq.pop_front();
        int LimitToDelete = dq.front().second-1;
        while(!vals.empty() && *vals.begin() <= LimitToDelete){
            update(1,1,cnt,*vals.begin(),0,1);
            vals.erase(vals.begin());
        }
    }
    printf("%d\n",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     scanf("%d%d",&n,&d);
      |     ~~~~~^~~~~~~~~~~~~~
Main.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         scanf("%d",a+i),mp[a[i]];
      |         ~~~~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 8 ms 716 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 8 ms 672 KB Output is correct
46 Correct 8 ms 972 KB Output is correct
47 Correct 7 ms 760 KB Output is correct
48 Correct 8 ms 812 KB Output is correct
49 Correct 9 ms 844 KB Output is correct
50 Correct 8 ms 896 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 716 KB Output is correct
53 Correct 7 ms 716 KB Output is correct
54 Correct 7 ms 716 KB Output is correct
55 Correct 8 ms 972 KB Output is correct
56 Correct 8 ms 972 KB Output is correct
57 Correct 9 ms 940 KB Output is correct
58 Correct 6 ms 972 KB Output is correct
59 Correct 6 ms 972 KB Output is correct
60 Correct 6 ms 972 KB Output is correct
61 Correct 6 ms 972 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 2620 KB Output is correct
2 Correct 85 ms 2512 KB Output is correct
3 Correct 156 ms 2632 KB Output is correct
4 Correct 618 ms 16908 KB Output is correct
5 Correct 520 ms 20768 KB Output is correct
6 Correct 652 ms 20900 KB Output is correct
7 Correct 314 ms 20828 KB Output is correct
8 Correct 332 ms 34752 KB Output is correct
9 Correct 298 ms 20904 KB Output is correct
10 Correct 327 ms 27740 KB Output is correct
11 Correct 450 ms 20788 KB Output is correct
12 Correct 481 ms 20804 KB Output is correct
13 Correct 494 ms 20804 KB Output is correct
14 Correct 668 ms 20816 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 2556 KB Output is correct
2 Correct 110 ms 2544 KB Output is correct
3 Correct 215 ms 3012 KB Output is correct
4 Correct 795 ms 34792 KB Output is correct
5 Correct 666 ms 34948 KB Output is correct
6 Correct 807 ms 34884 KB Output is correct
7 Correct 326 ms 37416 KB Output is correct
8 Correct 341 ms 34816 KB Output is correct
9 Correct 310 ms 34984 KB Output is correct
10 Correct 463 ms 34756 KB Output is correct
11 Correct 803 ms 34876 KB Output is correct
12 Correct 636 ms 34884 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 6 ms 332 KB Output is correct
42 Correct 8 ms 716 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 8 ms 672 KB Output is correct
46 Correct 8 ms 972 KB Output is correct
47 Correct 7 ms 760 KB Output is correct
48 Correct 8 ms 812 KB Output is correct
49 Correct 9 ms 844 KB Output is correct
50 Correct 8 ms 896 KB Output is correct
51 Correct 7 ms 716 KB Output is correct
52 Correct 8 ms 716 KB Output is correct
53 Correct 7 ms 716 KB Output is correct
54 Correct 7 ms 716 KB Output is correct
55 Correct 8 ms 972 KB Output is correct
56 Correct 8 ms 972 KB Output is correct
57 Correct 9 ms 940 KB Output is correct
58 Correct 6 ms 972 KB Output is correct
59 Correct 6 ms 972 KB Output is correct
60 Correct 6 ms 972 KB Output is correct
61 Correct 6 ms 972 KB Output is correct
62 Correct 53 ms 2620 KB Output is correct
63 Correct 85 ms 2512 KB Output is correct
64 Correct 156 ms 2632 KB Output is correct
65 Correct 618 ms 16908 KB Output is correct
66 Correct 520 ms 20768 KB Output is correct
67 Correct 652 ms 20900 KB Output is correct
68 Correct 314 ms 20828 KB Output is correct
69 Correct 332 ms 34752 KB Output is correct
70 Correct 298 ms 20904 KB Output is correct
71 Correct 327 ms 27740 KB Output is correct
72 Correct 450 ms 20788 KB Output is correct
73 Correct 481 ms 20804 KB Output is correct
74 Correct 494 ms 20804 KB Output is correct
75 Correct 668 ms 20816 KB Output is correct
76 Correct 48 ms 2556 KB Output is correct
77 Correct 110 ms 2544 KB Output is correct
78 Correct 215 ms 3012 KB Output is correct
79 Correct 795 ms 34792 KB Output is correct
80 Correct 666 ms 34948 KB Output is correct
81 Correct 807 ms 34884 KB Output is correct
82 Correct 326 ms 37416 KB Output is correct
83 Correct 341 ms 34816 KB Output is correct
84 Correct 310 ms 34984 KB Output is correct
85 Correct 463 ms 34756 KB Output is correct
86 Correct 803 ms 34876 KB Output is correct
87 Correct 636 ms 34884 KB Output is correct
88 Correct 280 ms 2708 KB Output is correct
89 Correct 711 ms 20500 KB Output is correct
90 Correct 397 ms 6032 KB Output is correct
91 Correct 860 ms 33328 KB Output is correct
92 Correct 92 ms 2612 KB Output is correct
93 Correct 246 ms 3232 KB Output is correct
94 Correct 717 ms 24460 KB Output is correct
95 Correct 608 ms 20832 KB Output is correct
96 Correct 700 ms 22780 KB Output is correct
97 Correct 803 ms 25540 KB Output is correct
98 Correct 869 ms 33192 KB Output is correct
99 Correct 830 ms 34872 KB Output is correct
100 Correct 806 ms 34808 KB Output is correct
101 Correct 325 ms 20804 KB Output is correct
102 Correct 372 ms 20792 KB Output is correct
103 Correct 383 ms 20852 KB Output is correct
104 Correct 459 ms 21160 KB Output is correct
105 Correct 561 ms 25100 KB Output is correct
106 Correct 422 ms 34240 KB Output is correct
107 Correct 500 ms 34856 KB Output is correct
108 Correct 754 ms 34896 KB Output is correct
109 Correct 464 ms 20880 KB Output is correct
110 Correct 709 ms 29920 KB Output is correct
111 Correct 758 ms 32688 KB Output is correct
112 Correct 506 ms 32480 KB Output is correct
113 Correct 885 ms 34896 KB Output is correct
114 Correct 839 ms 34892 KB Output is correct
115 Correct 388 ms 34884 KB Output is correct
116 Correct 370 ms 34872 KB Output is correct
117 Correct 341 ms 34908 KB Output is correct
118 Correct 362 ms 34820 KB Output is correct
119 Correct 363 ms 34740 KB Output is correct
120 Correct 353 ms 34808 KB Output is correct