Submission #922719

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922719	2024-02-06T04:08:09 Z	GrindMachine	Let's Win the Election (JOI22_ho_t3)	C++17	56 / 100	2500 ms	4444 KB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<pll> a(n);
    rep(i,n) cin >> a[i].ff >> a[i].ss;
    rep(i,n) if(a[i].ss == -1) a[i].ss = inf2;

    auto cmp = [&](pll p1, pll p2){
        return p1.ss < p2.ss;
    };

    sort(all(a),cmp);
    ld ans = inf2;
    ld dp[n+5][n+5];

    rep(cnt,n+1){
        rep(votes,n+1){
            rep(guys,n+1){
                dp[votes][guys] = inf2;
            }
        }
        dp[0][0] = 0;

        rep(i,n){
            rev(votes,n,0){
                rev(guys,n,0){
                    // vote
                    amin(dp[votes+1][guys],dp[votes][guys]+(ld)a[i].ff/(cnt+1));

                    // collab
                    amin(dp[votes+1][guys+1],dp[votes][guys]+(ld)a[i].ss/(guys+1));
                }
            }
        }

        amin(ans,dp[k][cnt]);
    }

    cout << fixed << setprecision(11);
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2573 ms	4444 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2573 ms	4444 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	452 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	2 ms	456 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	3 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	2 ms	348 KB	Output is correct
33	Correct	2 ms	348 KB	Output is correct
34	Correct	2 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	2 ms	348 KB	Output is correct
37	Correct	2 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	2 ms	348 KB	Output is correct
40	Correct	2 ms	348 KB	Output is correct

Subtask #5
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	2 ms	452 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	2 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	2 ms	348 KB	Output is correct
24	Correct	2 ms	348 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	2 ms	456 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	3 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	2 ms	348 KB	Output is correct
32	Correct	2 ms	348 KB	Output is correct
33	Correct	2 ms	348 KB	Output is correct
34	Correct	2 ms	348 KB	Output is correct
35	Correct	2 ms	348 KB	Output is correct
36	Correct	2 ms	348 KB	Output is correct
37	Correct	2 ms	348 KB	Output is correct
38	Correct	2 ms	348 KB	Output is correct
39	Correct	2 ms	348 KB	Output is correct
40	Correct	2 ms	348 KB	Output is correct
41	Correct	1050 ms	852 KB	Output is correct
42	Correct	1033 ms	604 KB	Output is correct
43	Correct	1078 ms	604 KB	Output is correct
44	Correct	1035 ms	604 KB	Output is correct
45	Correct	1034 ms	600 KB	Output is correct
46	Correct	1068 ms	604 KB	Output is correct
47	Correct	1033 ms	604 KB	Output is correct
48	Correct	1027 ms	604 KB	Output is correct
49	Correct	1038 ms	600 KB	Output is correct
50	Correct	1030 ms	612 KB	Output is correct
51	Correct	1025 ms	604 KB	Output is correct
52	Correct	1022 ms	604 KB	Output is correct
53	Correct	1029 ms	604 KB	Output is correct
54	Correct	1041 ms	600 KB	Output is correct
55	Correct	1027 ms	604 KB	Output is correct
56	Correct	1027 ms	604 KB	Output is correct
57	Correct	1033 ms	852 KB	Output is correct
58	Correct	1052 ms	616 KB	Output is correct
59	Correct	1051 ms	612 KB	Output is correct
60	Correct	1046 ms	604 KB	Output is correct

Subtask #6
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2517 ms	4440 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Execution timed out	2573 ms	4444 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Submission #922719

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 33.0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
0 / 5.0

Subtask #2
0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
33.0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0