oj.uz

답안 #875343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875343 2023-11-19T07:34:02 Z efedmrlr Financial Report (JOI21_financial) C++17
100 / 100
 690 ms 313692 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i)<(n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 4e5+5;
const int MOD = 1e9+7;
const int INF = 1e12;
const int M = 1e6+5;
const long double EPS = 0.00001;
 
int n,m,q,d;
vector<int> dp, b;
vector<array<int,2> > a;
queue<array<int,2> > ques[N];
vector<int> vis(N, 0);
struct SegTree {
    int sz;
    vector<int> data;
    SegTree(int sz) {
        this->sz = sz;
        data.assign(4*(sz + 2), -INF);

    }
    void update(int tl, int tr ,int v, int ind, int val) {
        if(tl == tr) {
            data[v] = val;
            return;
        }
        int tm = (tl + tr) >> 1;
        if(ind <= tm) {
            update(tl, tm, v*2, ind, val);
        }
        else {
            update(tm + 1, tr, v*2+1, ind, val);
        }
        data[v] = max(data[v*2], data[v*2+1]);
    }
    void update(int ind ,int val) {
        update(0, sz, 1, ind ,val);
    }
    int query(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) return data[v];
        if(tl > r || tr < l) {
            return -INF;
        }
        int tm = (tl + tr) >> 1;
        return max(query(tl, tm, v*2, l, r) , query(tm + 1, tr, v*2+1, l, r));
    }
    int query(int l, int r) {
        return query(0, sz, 1, l, r);
    }
};

struct IndexedSeg {
    int sz;
    vector<array<int,2> > data;
    IndexedSeg(int sz) {
        this->sz = sz;
        data.assign(4*(sz + 2), {-INF, -INF});

    }
    void update(int tl, int tr ,int v, int ind, int val) {
        if(tl == tr) {
            data[v] = {val, tl};
            return;
        }
        int tm = (tl + tr) >> 1;
        if(ind <= tm) {
            update(tl, tm, v*2, ind, val);
        }
        else {
            update(tm + 1, tr, v*2+1, ind, val);
        }
        data[v] = max(data[v*2], data[v*2+1]);
    }
    void update(int ind ,int val) {
        update(0, sz, 1, ind ,val);
    }
    array<int,2>  query(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) return data[v];
        if(tl > r || tr < l) {
            return {-INF, -INF};
        }
        int tm = (tl + tr) >> 1;
        return max(query(tl, tm, v*2, l, r) , query(tm + 1, tr, v*2+1, l, r));
    }
    array<int,2> query(int l, int r) {
        return query(0, sz, 1, l, r);
    }
};

void operate(SegTree &st, int ind ,int order) {
    while(ques[ind].size() && ques[ind].front()[0] <= dp[order]) {
        ques[ind].pop();
    }
    ques[ind].push({dp[order], order});
    st.update(ind, ques[ind].front()[0]);
}
void remove_el(SegTree &st, int ind) {
    while(ques[ind].size() && vis[ ques[ind].front()[1] ]) {
        ques[ind].pop();
        
    }
    if(ques[ind].size()) {
        st.update(ind, ques[ind].front()[0]);       
    }
    else {
        st.update(ind, -INF);
    }

}

void compress() {
    sort(a.begin(), a.end());
    int last = -1;
    int cur = 0;
    for(int i = 0; i<n; i++) {
        if(a[i][0] == last) {
            a[i][0] = cur;
        }
        else {
            last = a[i][0];
            cur++;
            a[i][0] = cur;
        }
    }
    b.assign(n+1, 0);
    for(auto c : a) {
        b[c[1]] = c[0];
    }

}
signed main() {
    fastio();
    cin>>n>>d;
    a.resize(n);
    dp.assign(n + 1, 1);
    REP(i,n) {
        cin>>a[i][0];
        a[i][1] = i + 1;
    }
    
    compress();
    SegTree stmain(n + 500); 
    IndexedSeg stsec(n + 500);
    dp[n] = 1;
    operate(stmain, b[n], n);
    stsec.update(n, -b[n]);
    for(int i = n - 1; i>=1; i--) {
        dp[i] = stmain.query(b[i] + 1, n + 3) + 1;
        dp[i] = max(dp[i] , 1ll);
        operate(stmain, b[i], i);
        stsec.update(i, -b[i]);
        if(i + d <= n) {
            int cur = stsec.query(i, i + d - 1)[0];
            cur *= -1;
            array<int,2> last = stsec.query(i + d, n+2);
            last[0] = abs(last[0]);
            while(last[0] <= cur) {
                vis[last[1]] = 1;
                remove_el(stmain, b[last[1]]);
                stsec.update(last[1], -INF);
                last = stsec.query(i + d, n+2);
                last[0] = abs(last[0]);
            }
        }
        

    }
    
    int ans = 0;
    for(int i = 1 ;i<=n;i++) {
        ans = max(ans , dp[i]);
    }
    cout<<ans<<"\n";

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:8:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    8 | #define REP(i,n) for(int (i) = 0; (i)<(n); (i)++)
      |                          ^
Main.cpp:148:5: note: in expansion of macro 'REP'
  148 |     REP(i,n) {
      |     ^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 272724 KB Output is correct
2 Correct 119 ms 272880 KB Output is correct
3 Correct 121 ms 272896 KB Output is correct
4 Correct 127 ms 272776 KB Output is correct
5 Correct 133 ms 272724 KB Output is correct
6 Correct 122 ms 272800 KB Output is correct
7 Correct 125 ms 272980 KB Output is correct
8 Correct 119 ms 272724 KB Output is correct
9 Correct 122 ms 272720 KB Output is correct
10 Correct 122 ms 272720 KB Output is correct
11 Correct 124 ms 272800 KB Output is correct
12 Correct 120 ms 272724 KB Output is correct
13 Correct 118 ms 272720 KB Output is correct
14 Correct 122 ms 272716 KB Output is correct
15 Correct 119 ms 272724 KB Output is correct
16 Correct 120 ms 272868 KB Output is correct
17 Correct 119 ms 272720 KB Output is correct
18 Correct 121 ms 272724 KB Output is correct
19 Correct 122 ms 272816 KB Output is correct
20 Correct 122 ms 272720 KB Output is correct
21 Correct 119 ms 272720 KB Output is correct
22 Correct 119 ms 272760 KB Output is correct
23 Correct 119 ms 272684 KB Output is correct
24 Correct 120 ms 272692 KB Output is correct
25 Correct 121 ms 272724 KB Output is correct
26 Correct 119 ms 272724 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 272724 KB Output is correct
2 Correct 119 ms 272880 KB Output is correct
3 Correct 121 ms 272896 KB Output is correct
4 Correct 127 ms 272776 KB Output is correct
5 Correct 133 ms 272724 KB Output is correct
6 Correct 122 ms 272800 KB Output is correct
7 Correct 125 ms 272980 KB Output is correct
8 Correct 119 ms 272724 KB Output is correct
9 Correct 122 ms 272720 KB Output is correct
10 Correct 122 ms 272720 KB Output is correct
11 Correct 124 ms 272800 KB Output is correct
12 Correct 120 ms 272724 KB Output is correct
13 Correct 118 ms 272720 KB Output is correct
14 Correct 122 ms 272716 KB Output is correct
15 Correct 119 ms 272724 KB Output is correct
16 Correct 120 ms 272868 KB Output is correct
17 Correct 119 ms 272720 KB Output is correct
18 Correct 121 ms 272724 KB Output is correct
19 Correct 122 ms 272816 KB Output is correct
20 Correct 122 ms 272720 KB Output is correct
21 Correct 119 ms 272720 KB Output is correct
22 Correct 119 ms 272760 KB Output is correct
23 Correct 119 ms 272684 KB Output is correct
24 Correct 120 ms 272692 KB Output is correct
25 Correct 121 ms 272724 KB Output is correct
26 Correct 119 ms 272724 KB Output is correct
27 Correct 133 ms 272772 KB Output is correct
28 Correct 137 ms 272956 KB Output is correct
29 Correct 134 ms 272876 KB Output is correct
30 Correct 149 ms 272768 KB Output is correct
31 Correct 142 ms 272764 KB Output is correct
32 Correct 137 ms 272864 KB Output is correct
33 Correct 134 ms 272860 KB Output is correct
34 Correct 133 ms 272724 KB Output is correct
35 Correct 141 ms 273232 KB Output is correct
36 Correct 148 ms 272724 KB Output is correct
37 Correct 133 ms 272748 KB Output is correct
38 Correct 135 ms 272740 KB Output is correct
39 Correct 134 ms 272948 KB Output is correct
40 Correct 137 ms 272884 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 272724 KB Output is correct
2 Correct 119 ms 272880 KB Output is correct
3 Correct 121 ms 272896 KB Output is correct
4 Correct 127 ms 272776 KB Output is correct
5 Correct 133 ms 272724 KB Output is correct
6 Correct 122 ms 272800 KB Output is correct
7 Correct 125 ms 272980 KB Output is correct
8 Correct 119 ms 272724 KB Output is correct
9 Correct 122 ms 272720 KB Output is correct
10 Correct 122 ms 272720 KB Output is correct
11 Correct 124 ms 272800 KB Output is correct
12 Correct 120 ms 272724 KB Output is correct
13 Correct 118 ms 272720 KB Output is correct
14 Correct 122 ms 272716 KB Output is correct
15 Correct 119 ms 272724 KB Output is correct
16 Correct 120 ms 272868 KB Output is correct
17 Correct 119 ms 272720 KB Output is correct
18 Correct 121 ms 272724 KB Output is correct
19 Correct 122 ms 272816 KB Output is correct
20 Correct 122 ms 272720 KB Output is correct
21 Correct 119 ms 272720 KB Output is correct
22 Correct 119 ms 272760 KB Output is correct
23 Correct 119 ms 272684 KB Output is correct
24 Correct 120 ms 272692 KB Output is correct
25 Correct 121 ms 272724 KB Output is correct
26 Correct 119 ms 272724 KB Output is correct
27 Correct 133 ms 272772 KB Output is correct
28 Correct 137 ms 272956 KB Output is correct
29 Correct 134 ms 272876 KB Output is correct
30 Correct 149 ms 272768 KB Output is correct
31 Correct 142 ms 272764 KB Output is correct
32 Correct 137 ms 272864 KB Output is correct
33 Correct 134 ms 272860 KB Output is correct
34 Correct 133 ms 272724 KB Output is correct
35 Correct 141 ms 273232 KB Output is correct
36 Correct 148 ms 272724 KB Output is correct
37 Correct 133 ms 272748 KB Output is correct
38 Correct 135 ms 272740 KB Output is correct
39 Correct 134 ms 272948 KB Output is correct
40 Correct 137 ms 272884 KB Output is correct
41 Correct 141 ms 273688 KB Output is correct
42 Correct 150 ms 274020 KB Output is correct
43 Correct 142 ms 273784 KB Output is correct
44 Correct 141 ms 273496 KB Output is correct
45 Correct 139 ms 273744 KB Output is correct
46 Correct 142 ms 273628 KB Output is correct
47 Correct 140 ms 273740 KB Output is correct
48 Correct 140 ms 273748 KB Output is correct
49 Correct 148 ms 273744 KB Output is correct
50 Correct 138 ms 273644 KB Output is correct
51 Correct 143 ms 273744 KB Output is correct
52 Correct 141 ms 273756 KB Output is correct
53 Correct 140 ms 273744 KB Output is correct
54 Correct 139 ms 273744 KB Output is correct
55 Correct 142 ms 273848 KB Output is correct
56 Correct 142 ms 273748 KB Output is correct
57 Correct 142 ms 273624 KB Output is correct
58 Correct 136 ms 273604 KB Output is correct
59 Correct 145 ms 273788 KB Output is correct
60 Correct 142 ms 273656 KB Output is correct
61 Correct 140 ms 273748 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 449 ms 310488 KB Output is correct
2 Correct 490 ms 310484 KB Output is correct
3 Correct 506 ms 313424 KB Output is correct
4 Correct 600 ms 313272 KB Output is correct
5 Correct 567 ms 313168 KB Output is correct
6 Correct 690 ms 313424 KB Output is correct
7 Correct 424 ms 313144 KB Output is correct
8 Correct 472 ms 313280 KB Output is correct
9 Correct 432 ms 313384 KB Output is correct
10 Correct 501 ms 313388 KB Output is correct
11 Correct 647 ms 313384 KB Output is correct
12 Correct 614 ms 313300 KB Output is correct
13 Correct 587 ms 313388 KB Output is correct
14 Correct 623 ms 313388 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 310352 KB Output is correct
2 Correct 287 ms 310384 KB Output is correct
3 Correct 303 ms 310628 KB Output is correct
4 Correct 377 ms 310364 KB Output is correct
5 Correct 363 ms 310352 KB Output is correct
6 Correct 375 ms 310344 KB Output is correct
7 Correct 256 ms 310560 KB Output is correct
8 Correct 244 ms 310356 KB Output is correct
9 Correct 299 ms 310100 KB Output is correct
10 Correct 336 ms 310352 KB Output is correct
11 Correct 368 ms 310352 KB Output is correct
12 Correct 346 ms 310352 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 272724 KB Output is correct
2 Correct 119 ms 272880 KB Output is correct
3 Correct 121 ms 272896 KB Output is correct
4 Correct 127 ms 272776 KB Output is correct
5 Correct 133 ms 272724 KB Output is correct
6 Correct 122 ms 272800 KB Output is correct
7 Correct 125 ms 272980 KB Output is correct
8 Correct 119 ms 272724 KB Output is correct
9 Correct 122 ms 272720 KB Output is correct
10 Correct 122 ms 272720 KB Output is correct
11 Correct 124 ms 272800 KB Output is correct
12 Correct 120 ms 272724 KB Output is correct
13 Correct 118 ms 272720 KB Output is correct
14 Correct 122 ms 272716 KB Output is correct
15 Correct 119 ms 272724 KB Output is correct
16 Correct 120 ms 272868 KB Output is correct
17 Correct 119 ms 272720 KB Output is correct
18 Correct 121 ms 272724 KB Output is correct
19 Correct 122 ms 272816 KB Output is correct
20 Correct 122 ms 272720 KB Output is correct
21 Correct 119 ms 272720 KB Output is correct
22 Correct 119 ms 272760 KB Output is correct
23 Correct 119 ms 272684 KB Output is correct
24 Correct 120 ms 272692 KB Output is correct
25 Correct 121 ms 272724 KB Output is correct
26 Correct 119 ms 272724 KB Output is correct
27 Correct 133 ms 272772 KB Output is correct
28 Correct 137 ms 272956 KB Output is correct
29 Correct 134 ms 272876 KB Output is correct
30 Correct 149 ms 272768 KB Output is correct
31 Correct 142 ms 272764 KB Output is correct
32 Correct 137 ms 272864 KB Output is correct
33 Correct 134 ms 272860 KB Output is correct
34 Correct 133 ms 272724 KB Output is correct
35 Correct 141 ms 273232 KB Output is correct
36 Correct 148 ms 272724 KB Output is correct
37 Correct 133 ms 272748 KB Output is correct
38 Correct 135 ms 272740 KB Output is correct
39 Correct 134 ms 272948 KB Output is correct
40 Correct 137 ms 272884 KB Output is correct
41 Correct 141 ms 273688 KB Output is correct
42 Correct 150 ms 274020 KB Output is correct
43 Correct 142 ms 273784 KB Output is correct
44 Correct 141 ms 273496 KB Output is correct
45 Correct 139 ms 273744 KB Output is correct
46 Correct 142 ms 273628 KB Output is correct
47 Correct 140 ms 273740 KB Output is correct
48 Correct 140 ms 273748 KB Output is correct
49 Correct 148 ms 273744 KB Output is correct
50 Correct 138 ms 273644 KB Output is correct
51 Correct 143 ms 273744 KB Output is correct
52 Correct 141 ms 273756 KB Output is correct
53 Correct 140 ms 273744 KB Output is correct
54 Correct 139 ms 273744 KB Output is correct
55 Correct 142 ms 273848 KB Output is correct
56 Correct 142 ms 273748 KB Output is correct
57 Correct 142 ms 273624 KB Output is correct
58 Correct 136 ms 273604 KB Output is correct
59 Correct 145 ms 273788 KB Output is correct
60 Correct 142 ms 273656 KB Output is correct
61 Correct 140 ms 273748 KB Output is correct
62 Correct 449 ms 310488 KB Output is correct
63 Correct 490 ms 310484 KB Output is correct
64 Correct 506 ms 313424 KB Output is correct
65 Correct 600 ms 313272 KB Output is correct
66 Correct 567 ms 313168 KB Output is correct
67 Correct 690 ms 313424 KB Output is correct
68 Correct 424 ms 313144 KB Output is correct
69 Correct 472 ms 313280 KB Output is correct
70 Correct 432 ms 313384 KB Output is correct
71 Correct 501 ms 313388 KB Output is correct
72 Correct 647 ms 313384 KB Output is correct
73 Correct 614 ms 313300 KB Output is correct
74 Correct 587 ms 313388 KB Output is correct
75 Correct 623 ms 313388 KB Output is correct
76 Correct 257 ms 310352 KB Output is correct
77 Correct 287 ms 310384 KB Output is correct
78 Correct 303 ms 310628 KB Output is correct
79 Correct 377 ms 310364 KB Output is correct
80 Correct 363 ms 310352 KB Output is correct
81 Correct 375 ms 310344 KB Output is correct
82 Correct 256 ms 310560 KB Output is correct
83 Correct 244 ms 310356 KB Output is correct
84 Correct 299 ms 310100 KB Output is correct
85 Correct 336 ms 310352 KB Output is correct
86 Correct 368 ms 310352 KB Output is correct
87 Correct 346 ms 310352 KB Output is correct
88 Correct 539 ms 313428 KB Output is correct
89 Correct 608 ms 313188 KB Output is correct
90 Correct 538 ms 313388 KB Output is correct
91 Correct 522 ms 313396 KB Output is correct
92 Correct 413 ms 313172 KB Output is correct
93 Correct 439 ms 313692 KB Output is correct
94 Correct 409 ms 313172 KB Output is correct
95 Correct 580 ms 313620 KB Output is correct
96 Correct 621 ms 313392 KB Output is correct
97 Correct 567 ms 313488 KB Output is correct
98 Correct 509 ms 313172 KB Output is correct
99 Correct 508 ms 313428 KB Output is correct
100 Correct 520 ms 313428 KB Output is correct
101 Correct 404 ms 313396 KB Output is correct
102 Correct 410 ms 313172 KB Output is correct
103 Correct 435 ms 313172 KB Output is correct
104 Correct 453 ms 313396 KB Output is correct
105 Correct 471 ms 313392 KB Output is correct
106 Correct 562 ms 313280 KB Output is correct
107 Correct 624 ms 313396 KB Output is correct
108 Correct 657 ms 313404 KB Output is correct
109 Correct 603 ms 313644 KB Output is correct
110 Correct 684 ms 313172 KB Output is correct
111 Correct 603 ms 313312 KB Output is correct
112 Correct 543 ms 313368 KB Output is correct
113 Correct 509 ms 313428 KB Output is correct
114 Correct 508 ms 313172 KB Output is correct
115 Correct 261 ms 313408 KB Output is correct
116 Correct 264 ms 313244 KB Output is correct
117 Correct 363 ms 313172 KB Output is correct
118 Correct 356 ms 313172 KB Output is correct
119 Correct 466 ms 313348 KB Output is correct
120 Correct 466 ms 313172 KB Output is correct