oj.uz

답안 #592780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592780 2022-07-09T15:28:39 Z dxz05 Let's Win the Election (JOI22_ho_t3) C++14
33 / 100
 538 ms 352 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 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];

    if (n <= 20){
        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;
        return;
    }

    ld ans = 1e18;
    for (int m = 0; m <= k; m++){
        vector<int> v;
        for (int i = 0; i < n; i++){
            if (b[i] != -1) v.push_back(i);
        }

        if (v.size() < m) break;

        sort(all(v), [&](int i, int j){
            return b[i] < b[j];
        });

        ld cur = 0;
        set<int> s;
        for (int i = 0; i < m; i++){
            cur += (ld)b[v[i]] / (i + 1);
            s.insert(v[i]);
        }

        v.clear();
        for (int i = 0; i < n; i++){
            if (!s.count(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;
}

Compilation message

Main.cpp: In function 'void solve(int)':
Main.cpp:101:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |         if (v.size() < m) break;
      |             ~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 19 ms 348 KB Output is correct
16 Correct 14 ms 344 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 33 ms 352 KB Output is correct
19 Correct 15 ms 340 KB Output is correct
20 Correct 3 ms 328 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 316 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 212 KB Output is correct
16 Correct 489 ms 300 KB Output is correct
17 Correct 484 ms 304 KB Output is correct
18 Correct 247 ms 304 KB Output is correct
19 Correct 476 ms 304 KB Output is correct
20 Correct 266 ms 304 KB Output is correct
21 Correct 207 ms 304 KB Output is correct
22 Correct 496 ms 312 KB Output is correct
23 Correct 227 ms 308 KB Output is correct
24 Correct 221 ms 212 KB Output is correct
25 Correct 479 ms 300 KB Output is correct
26 Correct 300 ms 308 KB Output is correct
27 Correct 464 ms 304 KB Output is correct
28 Correct 476 ms 300 KB Output is correct
29 Correct 456 ms 304 KB Output is correct
30 Correct 496 ms 304 KB Output is correct
31 Correct 453 ms 304 KB Output is correct
32 Correct 470 ms 300 KB Output is correct
33 Correct 469 ms 336 KB Output is correct
34 Correct 460 ms 304 KB Output is correct
35 Correct 478 ms 304 KB Output is correct
36 Correct 474 ms 304 KB Output is correct
37 Correct 510 ms 304 KB Output is correct
38 Correct 538 ms 304 KB Output is correct
39 Correct 488 ms 312 KB Output is correct
40 Correct 518 ms 308 KB Output is correct

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 316 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 212 KB Output is correct
16 Correct 489 ms 300 KB Output is correct
17 Correct 484 ms 304 KB Output is correct
18 Correct 247 ms 304 KB Output is correct
19 Correct 476 ms 304 KB Output is correct
20 Correct 266 ms 304 KB Output is correct
21 Correct 207 ms 304 KB Output is correct
22 Correct 496 ms 312 KB Output is correct
23 Correct 227 ms 308 KB Output is correct
24 Correct 221 ms 212 KB Output is correct
25 Correct 479 ms 300 KB Output is correct
26 Correct 300 ms 308 KB Output is correct
27 Correct 464 ms 304 KB Output is correct
28 Correct 476 ms 300 KB Output is correct
29 Correct 456 ms 304 KB Output is correct
30 Correct 496 ms 304 KB Output is correct
31 Correct 453 ms 304 KB Output is correct
32 Correct 470 ms 300 KB Output is correct
33 Correct 469 ms 336 KB Output is correct
34 Correct 460 ms 304 KB Output is correct
35 Correct 478 ms 304 KB Output is correct
36 Correct 474 ms 304 KB Output is correct
37 Correct 510 ms 304 KB Output is correct
38 Correct 538 ms 304 KB Output is correct
39 Correct 488 ms 312 KB Output is correct
40 Correct 518 ms 308 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 352 KB Output is correct
43 Incorrect 1 ms 212 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 32 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 320 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 19 ms 348 KB Output is correct
16 Correct 14 ms 344 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 33 ms 352 KB Output is correct
19 Correct 15 ms 340 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 489 ms 300 KB Output is correct
37 Correct 484 ms 304 KB Output is correct
38 Correct 247 ms 304 KB Output is correct
39 Correct 476 ms 304 KB Output is correct
40 Correct 266 ms 304 KB Output is correct
41 Correct 207 ms 304 KB Output is correct
42 Correct 496 ms 312 KB Output is correct
43 Correct 227 ms 308 KB Output is correct
44 Correct 221 ms 212 KB Output is correct
45 Correct 479 ms 300 KB Output is correct
46 Correct 300 ms 308 KB Output is correct
47 Correct 464 ms 304 KB Output is correct
48 Correct 476 ms 300 KB Output is correct
49 Correct 456 ms 304 KB Output is correct
50 Correct 496 ms 304 KB Output is correct
51 Correct 453 ms 304 KB Output is correct
52 Correct 470 ms 300 KB Output is correct
53 Correct 469 ms 336 KB Output is correct
54 Correct 460 ms 304 KB Output is correct
55 Correct 478 ms 304 KB Output is correct
56 Correct 474 ms 304 KB Output is correct
57 Correct 510 ms 304 KB Output is correct
58 Correct 538 ms 304 KB Output is correct
59 Correct 488 ms 312 KB Output is correct
60 Correct 518 ms 308 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 352 KB Output is correct
63 Incorrect 1 ms 212 KB Output isn't correct
64 Halted 0 ms 0 KB -