oj.uz

답안 #527913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527913 2022-02-18T17:10:40 Z SorahISA Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 1012 ms 6588 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 INF = 1e18;

void solve() {
    int N, K; cin >> N >> K;
    
    vector<pii> AB(N);
    for (auto &[A, B] : AB) cin >> A >> B, B = B == -1 ? (int)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>(N+1, 0));
    for (int i = N-1; i >= 0; --i) {
        vector<pii> tmp(i + ALL(AB));
        sort(ALL(tmp));
        for (int j = 0; j < SZ(tmp); ++j) suf_min_k[i][j+1] = tmp[j].X;
        partial_sum(ALL(suf_min_k[i]), begin(suf_min_k[i]));
    }
    
    double min_time = suf_min_k[0][K]; /// goal = 0
    for (int goal = 1; goal <= K; ++goal) {
        vector<vector<double>> dp(N, vector<double>(goal+1, INF));
        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(min_time, dp[i-1][goal] + (double)suf_min_k[i][K-i] / (goal+1));
        }
    }
    cout << fixed << setprecision(12) << min_time << "\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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 2780 KB Output is correct
6 Correct 57 ms 3488 KB Output is correct
7 Correct 256 ms 4520 KB Output is correct
8 Correct 496 ms 5516 KB Output is correct
9 Correct 760 ms 6516 KB Output is correct
10 Correct 370 ms 5312 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 2780 KB Output is correct
6 Correct 57 ms 3488 KB Output is correct
7 Correct 256 ms 4520 KB Output is correct
8 Correct 496 ms 5516 KB Output is correct
9 Correct 760 ms 6516 KB Output is correct
10 Correct 370 ms 5312 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 77 ms 3772 KB Output is correct
13 Correct 71 ms 3804 KB Output is correct
14 Correct 76 ms 3900 KB Output is correct
15 Correct 478 ms 5284 KB Output is correct
16 Correct 457 ms 5304 KB Output is correct
17 Correct 418 ms 5280 KB Output is correct
18 Correct 950 ms 6472 KB Output is correct
19 Correct 870 ms 6500 KB Output is correct
20 Correct 1012 ms 6504 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 216 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 216 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 216 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 332 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 332 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 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 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 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 216 KB Output is correct
13 Correct 1 ms 216 KB Output is correct
14 Correct 1 ms 216 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 1 ms 216 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 216 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 332 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 332 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 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 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 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 2 ms 460 KB Output is correct
44 Correct 1 ms 460 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 588 KB Output is correct
47 Correct 5 ms 716 KB Output is correct
48 Correct 3 ms 716 KB Output is correct
49 Correct 8 ms 716 KB Output is correct
50 Correct 5 ms 716 KB Output is correct
51 Correct 5 ms 760 KB Output is correct
52 Correct 6 ms 760 KB Output is correct
53 Correct 5 ms 684 KB Output is correct
54 Correct 5 ms 716 KB Output is correct
55 Correct 4 ms 704 KB Output is correct
56 Correct 3 ms 716 KB Output is correct
57 Correct 5 ms 716 KB Output is correct
58 Correct 3 ms 716 KB Output is correct
59 Correct 3 ms 716 KB Output is correct
60 Correct 3 ms 716 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 875 ms 6532 KB Output is correct
2 Correct 813 ms 6532 KB Output is correct
3 Correct 826 ms 6588 KB Output is correct
4 Correct 819 ms 6564 KB Output is correct
5 Correct 895 ms 6496 KB Output is correct
6 Correct 983 ms 6504 KB Output is correct
7 Correct 971 ms 6484 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 13 ms 2780 KB Output is correct
6 Correct 57 ms 3488 KB Output is correct
7 Correct 256 ms 4520 KB Output is correct
8 Correct 496 ms 5516 KB Output is correct
9 Correct 760 ms 6516 KB Output is correct
10 Correct 370 ms 5312 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 77 ms 3772 KB Output is correct
13 Correct 71 ms 3804 KB Output is correct
14 Correct 76 ms 3900 KB Output is correct
15 Correct 478 ms 5284 KB Output is correct
16 Correct 457 ms 5304 KB Output is correct
17 Correct 418 ms 5280 KB Output is correct
18 Correct 950 ms 6472 KB Output is correct
19 Correct 870 ms 6500 KB Output is correct
20 Correct 1012 ms 6504 KB Output is correct
21 Correct 1 ms 216 KB Output is correct
22 Correct 1 ms 216 KB Output is correct
23 Correct 1 ms 216 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 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 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 1 ms 216 KB Output is correct
33 Correct 1 ms 216 KB Output is correct
34 Correct 1 ms 216 KB Output is correct
35 Correct 1 ms 216 KB Output is correct
36 Correct 1 ms 216 KB Output is correct
37 Correct 1 ms 216 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 216 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 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 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 204 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 204 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 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 460 KB Output is correct
62 Correct 2 ms 460 KB Output is correct
63 Correct 2 ms 460 KB Output is correct
64 Correct 1 ms 460 KB Output is correct
65 Correct 2 ms 588 KB Output is correct
66 Correct 2 ms 588 KB Output is correct
67 Correct 5 ms 716 KB Output is correct
68 Correct 3 ms 716 KB Output is correct
69 Correct 8 ms 716 KB Output is correct
70 Correct 5 ms 716 KB Output is correct
71 Correct 5 ms 760 KB Output is correct
72 Correct 6 ms 760 KB Output is correct
73 Correct 5 ms 684 KB Output is correct
74 Correct 5 ms 716 KB Output is correct
75 Correct 4 ms 704 KB Output is correct
76 Correct 3 ms 716 KB Output is correct
77 Correct 5 ms 716 KB Output is correct
78 Correct 3 ms 716 KB Output is correct
79 Correct 3 ms 716 KB Output is correct
80 Correct 3 ms 716 KB Output is correct
81 Correct 875 ms 6532 KB Output is correct
82 Correct 813 ms 6532 KB Output is correct
83 Correct 826 ms 6588 KB Output is correct
84 Correct 819 ms 6564 KB Output is correct
85 Correct 895 ms 6496 KB Output is correct
86 Correct 983 ms 6504 KB Output is correct
87 Correct 971 ms 6484 KB Output is correct
88 Correct 22 ms 2820 KB Output is correct
89 Correct 16 ms 2832 KB Output is correct
90 Correct 84 ms 3476 KB Output is correct
91 Correct 78 ms 3612 KB Output is correct
92 Correct 205 ms 4544 KB Output is correct
93 Correct 341 ms 4696 KB Output is correct
94 Correct 478 ms 5472 KB Output is correct
95 Correct 447 ms 5516 KB Output is correct
96 Correct 695 ms 6120 KB Output is correct
97 Correct 652 ms 6108 KB Output is correct
98 Correct 396 ms 5300 KB Output is correct
99 Correct 372 ms 5292 KB Output is correct
100 Correct 432 ms 5396 KB Output is correct
101 Correct 472 ms 5360 KB Output is correct
102 Correct 374 ms 5380 KB Output is correct
103 Correct 352 ms 5408 KB Output is correct
104 Correct 384 ms 5280 KB Output is correct
105 Correct 366 ms 5296 KB Output is correct