oj.uz

Submission #592665

# Submission time Handle Problem Language Result Execution time Memory
592665 2022-07-09T12:35:34 Z dxz05 Let's Win the Election (JOI22_ho_t3) C++14
28 / 100
 2500 ms 340 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 5555;

typedef long double ld;

void solve(int TC) {
    int n, k;
    cin >> n >> k;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];

    ld ans = 1e18;
    for (int mask = 0; mask < (1 << n); mask++){
        vector<int> v;
        bool ok = true;
        for (int i = 0; i < n; i++){
            if (mask & (1 << i)) {
                if (b[i] == -1) ok = false;
                v.push_back(b[i]);
            }
        }

        if (!ok) continue;

        int m = (int)v.size();

        sort(all(v));

        ld cur = 0;
        for (int i = 0; i < m; i++){
            cur += (ld)v[i] / (i + 1);
        }

        v.clear();
        for (int i = 0; i < n; i++){
            if (!(mask & (1 << i))) v.push_back(a[i]);
        }

        sort(all(v));

        for (int i = 0; i < k - m; i++){
            cur += (ld)v[i] / (m + 1);
        }

        ans = min(ans, cur);
    }

    cout << fixed << setprecision(15) << ans << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1326 ms 320 KB Output is correct
6 Correct 1408 ms 340 KB Output is correct
7 Correct 1349 ms 340 KB Output is correct
8 Correct 1333 ms 324 KB Output is correct
9 Correct 1329 ms 340 KB Output is correct
10 Correct 1368 ms 316 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1326 ms 320 KB Output is correct
6 Correct 1408 ms 340 KB Output is correct
7 Correct 1349 ms 340 KB Output is correct
8 Correct 1333 ms 324 KB Output is correct
9 Correct 1329 ms 340 KB Output is correct
10 Correct 1368 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Execution timed out 2573 ms 328 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 534 ms 304 KB Output is correct
17 Correct 510 ms 308 KB Output is correct
18 Correct 243 ms 316 KB Output is correct
19 Correct 515 ms 324 KB Output is correct
20 Correct 226 ms 304 KB Output is correct
21 Correct 205 ms 300 KB Output is correct
22 Correct 551 ms 332 KB Output is correct
23 Correct 226 ms 304 KB Output is correct
24 Correct 213 ms 308 KB Output is correct
25 Correct 597 ms 312 KB Output is correct
26 Correct 312 ms 304 KB Output is correct
27 Correct 529 ms 300 KB Output is correct
28 Correct 536 ms 308 KB Output is correct
29 Correct 527 ms 308 KB Output is correct
30 Correct 536 ms 308 KB Output is correct
31 Correct 542 ms 304 KB Output is correct
32 Correct 576 ms 308 KB Output is correct
33 Correct 525 ms 308 KB Output is correct
34 Correct 554 ms 320 KB Output is correct
35 Correct 529 ms 300 KB Output is correct
36 Correct 535 ms 308 KB Output is correct
37 Correct 538 ms 304 KB Output is correct
38 Correct 542 ms 308 KB Output is correct
39 Correct 536 ms 308 KB Output is correct
40 Correct 579 ms 340 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 534 ms 304 KB Output is correct
17 Correct 510 ms 308 KB Output is correct
18 Correct 243 ms 316 KB Output is correct
19 Correct 515 ms 324 KB Output is correct
20 Correct 226 ms 304 KB Output is correct
21 Correct 205 ms 300 KB Output is correct
22 Correct 551 ms 332 KB Output is correct
23 Correct 226 ms 304 KB Output is correct
24 Correct 213 ms 308 KB Output is correct
25 Correct 597 ms 312 KB Output is correct
26 Correct 312 ms 304 KB Output is correct
27 Correct 529 ms 300 KB Output is correct
28 Correct 536 ms 308 KB Output is correct
29 Correct 527 ms 308 KB Output is correct
30 Correct 536 ms 308 KB Output is correct
31 Correct 542 ms 304 KB Output is correct
32 Correct 576 ms 308 KB Output is correct
33 Correct 525 ms 308 KB Output is correct
34 Correct 554 ms 320 KB Output is correct
35 Correct 529 ms 300 KB Output is correct
36 Correct 535 ms 308 KB Output is correct
37 Correct 538 ms 304 KB Output is correct
38 Correct 542 ms 308 KB Output is correct
39 Correct 536 ms 308 KB Output is correct
40 Correct 579 ms 340 KB Output is correct
41 Incorrect 1 ms 256 KB Output isn't correct
42 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1326 ms 320 KB Output is correct
6 Correct 1408 ms 340 KB Output is correct
7 Correct 1349 ms 340 KB Output is correct
8 Correct 1333 ms 324 KB Output is correct
9 Correct 1329 ms 340 KB Output is correct
10 Correct 1368 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Execution timed out 2573 ms 328 KB Time limit exceeded
13 Halted 0 ms 0 KB -