oj.uz

답안 #423457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423457 2021-06-11T07:09:27 Z 최서현(#7497) Financial Report (JOI21_financial) C++17
100 / 100
 280 ms 10848 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <set>
#include <cstdlib>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define tiii tuple<int, int, int>
#define tiiii tuple<int, int, int, int>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
#define DEBUG
const int INF = (int)1e9 + 7;

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

//    srand(10);
//while(1)
//{
    int n, k; cin >> n >> k;
//    int n, k; n = 10; k = 1;
    pii A[n]; for(int i = 0; i < n; ++i) cin >> A[i].ff, A[i].ss = -i;
//    pii A[n]; for(int i = 0; i < n; ++i) A[i].ff = rand() % 7, A[i].ss = -i;
//    int Q[n]; for(int i = 0; i < n; ++i) Q[i] = A[i].ff;
    sort(A, A + n);
    int P[n]; for(int i = 0; i < n; ++i) P[i] = -A[i].ss;

    int B[n];
    set<pii> S;
    S.insert({n, 0});
    for(int i = 0; i < n; ++i)
    {
//        for(auto i : S) cout << "(" << i.ff << ", " << i.ss << ") "; cout << endl;
        auto it = S.upper_bound({P[i], INF});
        if(it != S.end() && P[i] >= it->ss)
        {
            if(it->ff - P[i] - 1 >= k) S.insert({it->ff, P[i] + 1});
            if(P[i] - it->ss >= k) S.insert({P[i], it->ss});
            S.erase(it);
        }
        it = S.upper_bound({P[i], INF});
        B[P[i]] = min(n, (it == S.end() ? n : max(P[i] + 1, it->ss) + k));
    }

//    for(auto i : P) cout << i << ' '; cout << endl;
//    for(auto i : B) cout << i << ' '; cout << endl;

    int ans = 0;
    int ind[n << 1]{};
    for(int i = n - 1; i >= 0; --i)
    {
        int ret = 0;
        for(int x = P[i] + n, y = B[P[i]] + n; x != y; x >>= 1, y >>= 1)
        {
            if(x & 1) ret = max(ret, ind[x++]);
            if(y & 1) ret = max(ret, ind[--y]);
        }

        ++ret;
        ans = max(ans, ret);

        int pos = P[i] + n;
        ind[pos] = ret;
        while(pos >>= 1) ind[pos] = max(ind[pos << 1], ind[pos << 1 | 1]);
    }

    cout << ans;

//    for(int i = 0; i < n; ++i) cout << ind[i + n] << ' '; cout << endl;

//    int ans2;
//    {
//        vector<int> V;
//        int ans = 0;
//        for(int i = n - 1; i >= 0; --i)
//        {
//            while(V.size() && V.back() <= Q[i]) V.pop_back();
//            V.push_back(Q[i]);
//            ans = max(ans, (int)V.size());
//        }
//        ans2 = ans;
//    }
//
//    if(ans != ans2)
//    {
//        for(auto i : Q) cout << i << ' '; cout << endl;
//        cout << ans << ' ' << ans2 << endl;
//        return 0;
//    }
//}
}

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 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 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 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 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 1 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 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 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 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 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 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 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 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 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 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 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 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 5 ms 492 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 360 KB Output is correct
51 Correct 4 ms 460 KB Output is correct
52 Correct 4 ms 460 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 3 ms 460 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 3 ms 460 KB Output is correct
58 Correct 2 ms 460 KB Output is correct
59 Correct 2 ms 460 KB Output is correct
60 Correct 2 ms 460 KB Output is correct
61 Correct 2 ms 460 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 7284 KB Output is correct
2 Correct 180 ms 10724 KB Output is correct
3 Correct 223 ms 10812 KB Output is correct
4 Correct 280 ms 10848 KB Output is correct
5 Correct 215 ms 9888 KB Output is correct
6 Correct 267 ms 10836 KB Output is correct
7 Correct 80 ms 7232 KB Output is correct
8 Correct 94 ms 7244 KB Output is correct
9 Correct 87 ms 7240 KB Output is correct
10 Correct 97 ms 7252 KB Output is correct
11 Correct 202 ms 7384 KB Output is correct
12 Correct 224 ms 7764 KB Output is correct
13 Correct 149 ms 7364 KB Output is correct
14 Correct 215 ms 7508 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 7380 KB Output is correct
2 Correct 125 ms 7244 KB Output is correct
3 Correct 135 ms 7248 KB Output is correct
4 Correct 151 ms 7236 KB Output is correct
5 Correct 115 ms 7252 KB Output is correct
6 Correct 122 ms 7252 KB Output is correct
7 Correct 81 ms 7236 KB Output is correct
8 Correct 87 ms 7252 KB Output is correct
9 Correct 87 ms 7244 KB Output is correct
10 Correct 109 ms 7248 KB Output is correct
11 Correct 121 ms 7252 KB Output is correct
12 Correct 110 ms 7236 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 1 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 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 1 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 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 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 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 5 ms 492 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 360 KB Output is correct
51 Correct 4 ms 460 KB Output is correct
52 Correct 4 ms 460 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 3 ms 460 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 3 ms 460 KB Output is correct
58 Correct 2 ms 460 KB Output is correct
59 Correct 2 ms 460 KB Output is correct
60 Correct 2 ms 460 KB Output is correct
61 Correct 2 ms 460 KB Output is correct
62 Correct 95 ms 7284 KB Output is correct
63 Correct 180 ms 10724 KB Output is correct
64 Correct 223 ms 10812 KB Output is correct
65 Correct 280 ms 10848 KB Output is correct
66 Correct 215 ms 9888 KB Output is correct
67 Correct 267 ms 10836 KB Output is correct
68 Correct 80 ms 7232 KB Output is correct
69 Correct 94 ms 7244 KB Output is correct
70 Correct 87 ms 7240 KB Output is correct
71 Correct 97 ms 7252 KB Output is correct
72 Correct 202 ms 7384 KB Output is correct
73 Correct 224 ms 7764 KB Output is correct
74 Correct 149 ms 7364 KB Output is correct
75 Correct 215 ms 7508 KB Output is correct
76 Correct 89 ms 7380 KB Output is correct
77 Correct 125 ms 7244 KB Output is correct
78 Correct 135 ms 7248 KB Output is correct
79 Correct 151 ms 7236 KB Output is correct
80 Correct 115 ms 7252 KB Output is correct
81 Correct 122 ms 7252 KB Output is correct
82 Correct 81 ms 7236 KB Output is correct
83 Correct 87 ms 7252 KB Output is correct
84 Correct 87 ms 7244 KB Output is correct
85 Correct 109 ms 7248 KB Output is correct
86 Correct 121 ms 7252 KB Output is correct
87 Correct 110 ms 7236 KB Output is correct
88 Correct 249 ms 9412 KB Output is correct
89 Correct 219 ms 8792 KB Output is correct
90 Correct 170 ms 7876 KB Output is correct
91 Correct 128 ms 7372 KB Output is correct
92 Correct 122 ms 7236 KB Output is correct
93 Correct 130 ms 7236 KB Output is correct
94 Correct 127 ms 7256 KB Output is correct
95 Correct 201 ms 8920 KB Output is correct
96 Correct 160 ms 7848 KB Output is correct
97 Correct 140 ms 7460 KB Output is correct
98 Correct 129 ms 7384 KB Output is correct
99 Correct 129 ms 7236 KB Output is correct
100 Correct 129 ms 7256 KB Output is correct
101 Correct 84 ms 7240 KB Output is correct
102 Correct 96 ms 7260 KB Output is correct
103 Correct 100 ms 7244 KB Output is correct
104 Correct 112 ms 7336 KB Output is correct
105 Correct 119 ms 7364 KB Output is correct
106 Correct 109 ms 7332 KB Output is correct
107 Correct 118 ms 7252 KB Output is correct
108 Correct 123 ms 7256 KB Output is correct
109 Correct 129 ms 7376 KB Output is correct
110 Correct 151 ms 7512 KB Output is correct
111 Correct 127 ms 7364 KB Output is correct
112 Correct 111 ms 7372 KB Output is correct
113 Correct 137 ms 7252 KB Output is correct
114 Correct 122 ms 7336 KB Output is correct
115 Correct 83 ms 7336 KB Output is correct
116 Correct 82 ms 7256 KB Output is correct
117 Correct 111 ms 7260 KB Output is correct
118 Correct 110 ms 7240 KB Output is correct
119 Correct 115 ms 7384 KB Output is correct
120 Correct 113 ms 7256 KB Output is correct