oj.uz

답안 #527926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527926 2022-02-18T18:27:19 Z SorahISA Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 32 ms 3372 KB 
#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
// #define double long double
using pii = pair<int, int>;
template <typename T>
using Prior = std::priority_queue<T>;
template <typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define ee emplace
#define eb emplace_back
#define ef push_front
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    cerr << "\u001b[33m" << "At func " << __FUNCTION__ << ", line " << __LINE__ << ": ",\
    cerr << "(" << #__VA_ARGS__ << ") = ",\
    _do(__VA_ARGS__),\
    cerr << "\u001b[0m"
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

const double INFd = 1e12;
const int INF = 1E6;

void solve() {
    int N, K; cin >> N >> K;
    
    vector<pii> AB(N);
    for (auto &[A, B] : AB) cin >> A >> B, B = B == -1 ? INF : B;
    sort(ALL(AB), [](pii &a, pii &b) {return a.Y < b.Y;});
    
    // for (auto &[A, B] : AB) debug(A, B);
    
    vector<vector<int>> suf_min_k(N+1, vector<int>(K+1, 0));
    for (int i = N-1; i >= 0; --i) {
        vector<pii> tmp(i + ALL(AB));
        sort(ALL(tmp));
        for (int j = 0; j < min(SZ(tmp), K); ++j) suf_min_k[i][j+1] = tmp[j].X;
        partial_sum(ALL(suf_min_k[i]), begin(suf_min_k[i]));
    }
    
    auto calc = [&](int goal) -> double {
        double ret = INFd;
        vector<vector<double>> dp(N, vector<double>(goal+1, INFd));
        dp[0][0] = (double)AB[0].X / (goal+1), dp[0][1] = AB[0].Y;
        for (int i = 1; i < N; ++i) {
            for (int j = goal; j >= 0; --j) {
                chmin(dp[i][j], dp[i-1][j] + (double)AB[i].X / (goal+1));
                if (j) chmin(dp[i][j], dp[i-1][j-1] + (double)AB[i].Y / j);
            }
        }
        for (int i = goal; i <= K; ++i) {
            chmin(ret, dp[i-1][goal] + (double)suf_min_k[i][K-i] / (goal+1));
        }
        return ret;
    };
    
    int lo = 1, hi = K, mi;
    while (lo < hi) {
        mi = (lo + hi) >> 1;
        if (calc(mi) < calc(mi+1)) hi = mi;
        else                       lo = mi + 1;
    }
    cout << fixed << setprecision(12) << min((double)suf_min_k[0][K], calc(lo)) << "\n";
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 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 6 ms 592 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1376 KB Output is correct
8 Correct 8 ms 1756 KB Output is correct
9 Correct 9 ms 2280 KB Output is correct
10 Correct 4 ms 1744 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 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 6 ms 592 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1376 KB Output is correct
8 Correct 8 ms 1756 KB Output is correct
9 Correct 9 ms 2280 KB Output is correct
10 Correct 4 ms 1744 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 11 ms 1100 KB Output is correct
14 Correct 8 ms 972 KB Output is correct
15 Correct 15 ms 2456 KB Output is correct
16 Correct 19 ms 2076 KB Output is correct
17 Correct 12 ms 1740 KB Output is correct
18 Correct 20 ms 3372 KB Output is correct
19 Correct 18 ms 2812 KB Output is correct
20 Correct 13 ms 2280 KB Output is correct

Subtask #3
11.0 / 11.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 1 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 264 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 1 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 1 ms 204 KB Output is correct

Subtask #4
12.0 / 12.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 1 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 264 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 1 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 1 ms 204 KB Output is correct
16 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 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 0 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 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 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 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct

Subtask #5
33.0 / 33.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 1 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 264 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 1 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 1 ms 204 KB Output is correct
16 Correct 0 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 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 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 0 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 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 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 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 2800 KB Output is correct
2 Correct 22 ms 2848 KB Output is correct
3 Correct 20 ms 2856 KB Output is correct
4 Correct 25 ms 3088 KB Output is correct
5 Correct 24 ms 3088 KB Output is correct
6 Correct 18 ms 2360 KB Output is correct
7 Correct 32 ms 3200 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 216 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 6 ms 592 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1376 KB Output is correct
8 Correct 8 ms 1756 KB Output is correct
9 Correct 9 ms 2280 KB Output is correct
10 Correct 4 ms 1744 KB Output is correct
11 Correct 1 ms 216 KB Output is correct
12 Correct 7 ms 1264 KB Output is correct
13 Correct 11 ms 1100 KB Output is correct
14 Correct 8 ms 972 KB Output is correct
15 Correct 15 ms 2456 KB Output is correct
16 Correct 19 ms 2076 KB Output is correct
17 Correct 12 ms 1740 KB Output is correct
18 Correct 20 ms 3372 KB Output is correct
19 Correct 18 ms 2812 KB Output is correct
20 Correct 13 ms 2280 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 264 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 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 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 0 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 0 ms 204 KB Output is correct
53 Correct 0 ms 204 KB Output is correct
54 Correct 0 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 0 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 1 ms 332 KB Output is correct
75 Correct 1 ms 332 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 1 ms 332 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 1 ms 332 KB Output is correct
80 Correct 1 ms 332 KB Output is correct
81 Correct 18 ms 2800 KB Output is correct
82 Correct 22 ms 2848 KB Output is correct
83 Correct 20 ms 2856 KB Output is correct
84 Correct 25 ms 3088 KB Output is correct
85 Correct 24 ms 3088 KB Output is correct
86 Correct 18 ms 2360 KB Output is correct
87 Correct 32 ms 3200 KB Output is correct
88 Correct 6 ms 588 KB Output is correct
89 Correct 8 ms 656 KB Output is correct
90 Correct 7 ms 848 KB Output is correct
91 Correct 10 ms 1032 KB Output is correct
92 Correct 9 ms 1380 KB Output is correct
93 Correct 13 ms 1716 KB Output is correct
94 Correct 12 ms 1776 KB Output is correct
95 Correct 21 ms 2412 KB Output is correct
96 Correct 16 ms 2584 KB Output is correct
97 Correct 21 ms 2840 KB Output is correct
98 Correct 13 ms 1740 KB Output is correct
99 Correct 10 ms 1740 KB Output is correct
100 Correct 15 ms 1740 KB Output is correct
101 Correct 16 ms 2088 KB Output is correct
102 Correct 18 ms 2276 KB Output is correct
103 Correct 17 ms 2276 KB Output is correct
104 Correct 16 ms 2076 KB Output is correct
105 Correct 4 ms 1740 KB Output is correct