oj.uz

답안 #738165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738165 2023-05-08T08:29:10 Z maomao90 Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 862 ms 6276 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 505;

int n, k, m;
int a[MAXN], b[MAXN];
int aid[MAXN], bid[MAXN];
bool done[MAXN];
ld dp[MAXN][MAXN], pa[MAXN][MAXN], pb[MAXN][MAXN];
ld ans;

ld calc(int i) {
    REP (l, 0, n + 1) {
        REP (o, 0, n + 1) {
            dp[l][o] = INF;
        }
    }
    dp[0][0] = 0;
    REP (j, 1, n + 1) {
        RREP (l, min(i, j), 0) {
            RREP (o, min(k - i, j - l), 0) {
                if (o) {
                    mnto(dp[l][o],
                            dp[l][o - 1] + pa[i][j]);
                    //dp[l][o - 1] + a[bid[j]] / (ld) (i + 1));
                }
                if (l && b[bid[j]] != -1) {
                    mnto(dp[l][o],
                            dp[l - 1][o] + pb[j][l]);
                    //dp[l - 1][o] + b[bid[j]] / (ld) l);
                }
                //cerr << j << ' ' << l << ' ' << o << ": " << dp[j][l][o] << '\n';
            }
        }
    }
    //cerr << i << ": " << dp[n][i][k - i] << '\n';
    return dp[i][k - i];
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> k;
    REP (i, 1, n + 1) {
        cin >> a[i] >> b[i];
        if (b[i] != -1) {
            m++;
        }
    }
    iota(aid + 1, aid + n + 1, 1);
    iota(bid + 1, bid + n + 1, 1);
    sort(aid + 1, aid + n + 1, [&] (int l, int r) {
            return a[l] < a[r];
            });
    sort(bid + 1, bid + n + 1, [&] (int l, int r) {
            return b[l] < b[r];
            });
    ans = INF;
    REP (i, 0, min(k, m) + 1) {
        REP (j, 1, n + 1) {
            pa[i][j] = a[bid[j]] / (ld) (i + 1);
            pb[j][i] = b[bid[j]] / (ld) i;
        }
    }
    int lo = 0, hi = min(k, m);
    while (hi - lo > 2) {
        int mid1 = lo + (hi - lo) / 3, mid2 = lo + (hi - lo) / 3 * 2;
        if (calc(mid1) < calc(mid2)) {
            hi = mid2;
        } else {
            lo = mid1;
        }
    }
    REP (i, lo, hi + 1) {
        mnto(ans, calc(i));
    }
    cout << setprecision(10) << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 49 ms 4880 KB Output is correct
13 Correct 103 ms 4876 KB Output is correct
14 Correct 77 ms 4692 KB Output is correct
15 Correct 183 ms 5676 KB Output is correct
16 Correct 465 ms 5456 KB Output is correct
17 Correct 298 ms 4684 KB Output is correct
18 Correct 265 ms 6272 KB Output is correct
19 Correct 862 ms 5492 KB Output is correct
20 Correct 317 ms 4652 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 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 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 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 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 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 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 468 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 2 ms 1196 KB Output is correct
44 Correct 2 ms 1236 KB Output is correct
45 Correct 3 ms 1236 KB Output is correct
46 Correct 4 ms 1364 KB Output is correct
47 Correct 4 ms 1412 KB Output is correct
48 Correct 5 ms 1396 KB Output is correct
49 Correct 6 ms 1456 KB Output is correct
50 Correct 6 ms 1364 KB Output is correct
51 Correct 7 ms 1536 KB Output is correct
52 Correct 6 ms 1376 KB Output is correct
53 Correct 3 ms 1364 KB Output is correct
54 Correct 4 ms 1364 KB Output is correct
55 Correct 4 ms 1364 KB Output is correct
56 Correct 3 ms 1364 KB Output is correct
57 Correct 5 ms 1364 KB Output is correct
58 Correct 3 ms 1364 KB Output is correct
59 Correct 4 ms 1364 KB Output is correct
60 Correct 4 ms 1364 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 834 ms 6276 KB Output is correct
2 Correct 807 ms 6260 KB Output is correct
3 Correct 814 ms 6268 KB Output is correct
4 Correct 629 ms 6264 KB Output is correct
5 Correct 481 ms 6264 KB Output is correct
6 Correct 842 ms 6268 KB Output is correct
7 Correct 476 ms 6228 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4308 KB Output is correct
7 Correct 2 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 49 ms 4880 KB Output is correct
13 Correct 103 ms 4876 KB Output is correct
14 Correct 77 ms 4692 KB Output is correct
15 Correct 183 ms 5676 KB Output is correct
16 Correct 465 ms 5456 KB Output is correct
17 Correct 298 ms 4684 KB Output is correct
18 Correct 265 ms 6272 KB Output is correct
19 Correct 862 ms 5492 KB Output is correct
20 Correct 317 ms 4652 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 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 0 ms 340 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 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 0 ms 468 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 0 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 0 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 1108 KB Output is correct
62 Correct 1 ms 1108 KB Output is correct
63 Correct 2 ms 1196 KB Output is correct
64 Correct 2 ms 1236 KB Output is correct
65 Correct 3 ms 1236 KB Output is correct
66 Correct 4 ms 1364 KB Output is correct
67 Correct 4 ms 1412 KB Output is correct
68 Correct 5 ms 1396 KB Output is correct
69 Correct 6 ms 1456 KB Output is correct
70 Correct 6 ms 1364 KB Output is correct
71 Correct 7 ms 1536 KB Output is correct
72 Correct 6 ms 1376 KB Output is correct
73 Correct 3 ms 1364 KB Output is correct
74 Correct 4 ms 1364 KB Output is correct
75 Correct 4 ms 1364 KB Output is correct
76 Correct 3 ms 1364 KB Output is correct
77 Correct 5 ms 1364 KB Output is correct
78 Correct 3 ms 1364 KB Output is correct
79 Correct 4 ms 1364 KB Output is correct
80 Correct 4 ms 1364 KB Output is correct
81 Correct 834 ms 6276 KB Output is correct
82 Correct 807 ms 6260 KB Output is correct
83 Correct 814 ms 6268 KB Output is correct
84 Correct 629 ms 6264 KB Output is correct
85 Correct 481 ms 6264 KB Output is correct
86 Correct 842 ms 6268 KB Output is correct
87 Correct 476 ms 6228 KB Output is correct
88 Correct 10 ms 4424 KB Output is correct
89 Correct 12 ms 4508 KB Output is correct
90 Correct 75 ms 4784 KB Output is correct
91 Correct 65 ms 4780 KB Output is correct
92 Correct 275 ms 5324 KB Output is correct
93 Correct 243 ms 5284 KB Output is correct
94 Correct 522 ms 5836 KB Output is correct
95 Correct 457 ms 5784 KB Output is correct
96 Correct 817 ms 6092 KB Output is correct
97 Correct 605 ms 6068 KB Output is correct
98 Correct 375 ms 5676 KB Output is correct
99 Correct 249 ms 5696 KB Output is correct
100 Correct 492 ms 5588 KB Output is correct
101 Correct 504 ms 5684 KB Output is correct
102 Correct 412 ms 5588 KB Output is correct
103 Correct 378 ms 5672 KB Output is correct
104 Correct 467 ms 5672 KB Output is correct
105 Correct 160 ms 5672 KB Output is correct