oj.uz

Submission #738151

# Submission time Handle Problem Language Result Execution time Memory
738151 2023-05-08T08:16:27 Z maomao90 Let's Win the Election (JOI22_ho_t3) C++17
61 / 100
 2500 ms 4296 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;

#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 long 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];
ld ans;

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 (l, 0, n + 1) {
            REP (o, 0, n + 1) {
                dp[l][o] = INF;
            }
        }
        dp[0][0] = 0;
        REP (j, 1, n + 1) {
            RREP (l, n, 0) {
                RREP (o, n, 0) {
                    if (o) {
                        mnto(dp[l][o],
                                dp[l][o - 1] + a[bid[j]] / (ld) (i + 1));
                    }
                    if (l && b[bid[j]] != -1) {
                        mnto(dp[l][o],
                                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';
        mnto(ans, dp[i][k - i]);
    }
    cout << setprecision(10) << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 507 ms 4292 KB Output is correct
6 Correct 500 ms 4180 KB Output is correct
7 Correct 509 ms 4276 KB Output is correct
8 Correct 511 ms 4280 KB Output is correct
9 Correct 504 ms 4296 KB Output is correct
10 Correct 501 ms 4284 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory 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 507 ms 4292 KB Output is correct
6 Correct 500 ms 4180 KB Output is correct
7 Correct 509 ms 4276 KB Output is correct
8 Correct 511 ms 4280 KB Output is correct
9 Correct 504 ms 4296 KB Output is correct
10 Correct 501 ms 4284 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Execution timed out 2556 ms 4180 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 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 0 ms 340 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 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 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 428 KB Output is correct
35 Correct 2 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 2 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 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 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 428 KB Output is correct
35 Correct 2 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 2 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 114 ms 888 KB Output is correct
42 Correct 115 ms 972 KB Output is correct
43 Correct 219 ms 884 KB Output is correct
44 Correct 209 ms 896 KB Output is correct
45 Correct 372 ms 896 KB Output is correct
46 Correct 351 ms 888 KB Output is correct
47 Correct 471 ms 888 KB Output is correct
48 Correct 453 ms 888 KB Output is correct
49 Correct 588 ms 888 KB Output is correct
50 Correct 536 ms 892 KB Output is correct
51 Correct 737 ms 888 KB Output is correct
52 Correct 585 ms 972 KB Output is correct
53 Correct 502 ms 852 KB Output is correct
54 Correct 489 ms 972 KB Output is correct
55 Correct 488 ms 884 KB Output is correct
56 Correct 502 ms 972 KB Output is correct
57 Correct 471 ms 972 KB Output is correct
58 Correct 463 ms 972 KB Output is correct
59 Correct 473 ms 884 KB Output is correct
60 Correct 473 ms 888 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2555 ms 4180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory 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 507 ms 4292 KB Output is correct
6 Correct 500 ms 4180 KB Output is correct
7 Correct 509 ms 4276 KB Output is correct
8 Correct 511 ms 4280 KB Output is correct
9 Correct 504 ms 4296 KB Output is correct
10 Correct 501 ms 4284 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Execution timed out 2556 ms 4180 KB Time limit exceeded
13 Halted 0 ms 0 KB -