oj.uz

답안 #660850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660850 2022-11-23T10:34:17 Z Danilo21 Financial Report (JOI21_financial) C++14
100 / 100
 488 ms 28364 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) (__builtin_popcountll(a))
#define bithigh(a) (63-__builtin_clzll(a))
#define lg bithigh
#define highpow(a) (1LL << (ll)lg(a))

using namespace std;

class segtree{

    int n;
    vector<int> tree;

    int update(int s, int l, int r, int pos, int x){
        if (l > pos || r < pos) return tree[s];
        if (l == r) return tree[s] = x;
        int m = (l + r)>>1;
        int a = update(2*s, l, m, pos, x);
        int b = update(2*s+1, m+1, r, pos, x);
        return tree[s] = max(a, b);
    }

    int query(int s, int l, int r, int ql, int qr) const {
        if (l > qr || r < ql) return 0;
        if (l >= ql && r <= qr) return tree[s];
        int m = (l + r)>>1;
        int a = query(2*s, l, m, ql, qr);
        int b = query(2*s+1, m+1, r, ql, qr);
        return max(a, b);
    }

public:
    void Assign(int s){
        n = highpow(s);
        if (bitcnt(s) > 1) n <<= 1;
        tree.assign(2*n, 0);
    }
    void update(int pos, int x){ update(1, 0, n-1, pos, x); }
    int query(int l, int r) const { return query(1, 0, n-1, l, r); }
};

const ll LINF = 4e18;
const int mxN = 1e6+10, INF = 2e9;
ll n, m, r[mxN], dp[mxN];
array<ll, 2> a[mxN];
segtree st;

void Solve(){

    cin >> n >> m;
    set<int> s;
    for (int i = 0; i < n; i++){
        cin >> a[i][0]; a[i][1] = -i;
        if (i >= m-1) s.insert(i);
    }
    sort(a, a+n);
    for (int i = 0; i < n; i++){
        int j = -a[i][1];
        vector<int> v;
        for (auto it = s.lower_bound(j); it != s.end() && *it < j+m; it++)
            v.pb(*it);
        for (int t : v) s.erase(t);
        auto it = s.lower_bound(j);
        if (it == s.end()) r[j] = n-1;
        else r[j] = *it;
    }
    reverse(a, a+n);
    st.Assign(n);
    int ans = 0;
    for (int i = 0; i < n; i++){
        int j = -a[i][1];
        int cur = st.query(j, r[j])+1;
        smax(ans, cur);
        st.update(j, cur);
    }
    cout << ans << en;
}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0); cerr.tie(0);
    cout << setprecision(12) << fixed;
    cerr << setprecision(12) << fixed;
    cerr << "Started!" << endl;

    int t = 1;
    //cin >> t;
    while (t--)
        Solve();

    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 6 ms 904 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 5 ms 868 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 5 ms 852 KB Output is correct
46 Correct 4 ms 604 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 6 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 5 ms 840 KB Output is correct
51 Correct 6 ms 852 KB Output is correct
52 Correct 7 ms 860 KB Output is correct
53 Correct 4 ms 864 KB Output is correct
54 Correct 5 ms 836 KB Output is correct
55 Correct 5 ms 852 KB Output is correct
56 Correct 5 ms 820 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 5 ms 868 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 258 ms 24480 KB Output is correct
2 Correct 311 ms 24016 KB Output is correct
3 Correct 421 ms 24368 KB Output is correct
4 Correct 488 ms 28364 KB Output is correct
5 Correct 359 ms 24432 KB Output is correct
6 Correct 475 ms 24332 KB Output is correct
7 Correct 227 ms 24204 KB Output is correct
8 Correct 252 ms 24268 KB Output is correct
9 Correct 236 ms 24372 KB Output is correct
10 Correct 255 ms 24392 KB Output is correct
11 Correct 353 ms 24268 KB Output is correct
12 Correct 372 ms 24388 KB Output is correct
13 Correct 340 ms 24356 KB Output is correct
14 Correct 485 ms 24328 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 14696 KB Output is correct
2 Correct 198 ms 14288 KB Output is correct
3 Correct 190 ms 14324 KB Output is correct
4 Correct 179 ms 14344 KB Output is correct
5 Correct 164 ms 14320 KB Output is correct
6 Correct 183 ms 14300 KB Output is correct
7 Correct 120 ms 14368 KB Output is correct
8 Correct 118 ms 14308 KB Output is correct
9 Correct 134 ms 14228 KB Output is correct
10 Correct 163 ms 14296 KB Output is correct
11 Correct 174 ms 14360 KB Output is correct
12 Correct 167 ms 14288 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 6 ms 904 KB Output is correct
42 Correct 6 ms 852 KB Output is correct
43 Correct 5 ms 868 KB Output is correct
44 Correct 5 ms 724 KB Output is correct
45 Correct 5 ms 852 KB Output is correct
46 Correct 4 ms 604 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 6 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 5 ms 840 KB Output is correct
51 Correct 6 ms 852 KB Output is correct
52 Correct 7 ms 860 KB Output is correct
53 Correct 4 ms 864 KB Output is correct
54 Correct 5 ms 836 KB Output is correct
55 Correct 5 ms 852 KB Output is correct
56 Correct 5 ms 820 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 5 ms 868 KB Output is correct
62 Correct 258 ms 24480 KB Output is correct
63 Correct 311 ms 24016 KB Output is correct
64 Correct 421 ms 24368 KB Output is correct
65 Correct 488 ms 28364 KB Output is correct
66 Correct 359 ms 24432 KB Output is correct
67 Correct 475 ms 24332 KB Output is correct
68 Correct 227 ms 24204 KB Output is correct
69 Correct 252 ms 24268 KB Output is correct
70 Correct 236 ms 24372 KB Output is correct
71 Correct 255 ms 24392 KB Output is correct
72 Correct 353 ms 24268 KB Output is correct
73 Correct 372 ms 24388 KB Output is correct
74 Correct 340 ms 24356 KB Output is correct
75 Correct 485 ms 24328 KB Output is correct
76 Correct 135 ms 14696 KB Output is correct
77 Correct 198 ms 14288 KB Output is correct
78 Correct 190 ms 14324 KB Output is correct
79 Correct 179 ms 14344 KB Output is correct
80 Correct 164 ms 14320 KB Output is correct
81 Correct 183 ms 14300 KB Output is correct
82 Correct 120 ms 14368 KB Output is correct
83 Correct 118 ms 14308 KB Output is correct
84 Correct 134 ms 14228 KB Output is correct
85 Correct 163 ms 14296 KB Output is correct
86 Correct 174 ms 14360 KB Output is correct
87 Correct 167 ms 14288 KB Output is correct
88 Correct 450 ms 24364 KB Output is correct
89 Correct 421 ms 24372 KB Output is correct
90 Correct 368 ms 24380 KB Output is correct
91 Correct 278 ms 24268 KB Output is correct
92 Correct 270 ms 24440 KB Output is correct
93 Correct 273 ms 23756 KB Output is correct
94 Correct 200 ms 14608 KB Output is correct
95 Correct 389 ms 24328 KB Output is correct
96 Correct 356 ms 24332 KB Output is correct
97 Correct 304 ms 24488 KB Output is correct
98 Correct 297 ms 24280 KB Output is correct
99 Correct 291 ms 24356 KB Output is correct
100 Correct 286 ms 24276 KB Output is correct
101 Correct 239 ms 24324 KB Output is correct
102 Correct 262 ms 24268 KB Output is correct
103 Correct 248 ms 24292 KB Output is correct
104 Correct 270 ms 24264 KB Output is correct
105 Correct 261 ms 23500 KB Output is correct
106 Correct 289 ms 24372 KB Output is correct
107 Correct 279 ms 24464 KB Output is correct
108 Correct 276 ms 24140 KB Output is correct
109 Correct 326 ms 24348 KB Output is correct
110 Correct 315 ms 24328 KB Output is correct
111 Correct 289 ms 24280 KB Output is correct
112 Correct 272 ms 24268 KB Output is correct
113 Correct 287 ms 24188 KB Output is correct
114 Correct 283 ms 24216 KB Output is correct
115 Correct 122 ms 14412 KB Output is correct
116 Correct 127 ms 14388 KB Output is correct
117 Correct 199 ms 17452 KB Output is correct
118 Correct 204 ms 17420 KB Output is correct
119 Correct 283 ms 24316 KB Output is correct
120 Correct 263 ms 24388 KB Output is correct