oj.uz

Submission #890697

# Submission time Handle Problem Language Result Execution time Memory
890697 2023-12-21T18:43:48 Z arbuzick Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 1677 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n), b(n);
    vector<pair<int, int>> s_a;
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
        s_a.emplace_back(a[i], i);
    }
    sort(s_a.begin(), s_a.end());
    long double ans = 1e9 + 7;
    for (int pr_a = 0; pr_a <= k; ++pr_a) {
        for (int cnt_b = k - pr_a; cnt_b < k; ++cnt_b) {
            vector<int> used(n);
            long double ans_nw = 0;
            for (int i = 0; i < pr_a; ++i) {
                used[s_a[i].second] = 1;
                ans_nw += s_a[i].first / (double)(cnt_b + 1);
            }
            vector<double> s_b1;
            vector<pair<double, double>> s_b2;
            for (int i = 0; i < n; ++i) {
                if (b[i] != -1 && !used[i]) {
                    s_b1.push_back(b[i]);
                } else if (b[i] != -1) {
                    s_b2.emplace_back(b[i], a[i] / (double)(cnt_b + 1));
                }
            }
            sort(s_b1.begin(), s_b1.end());
            sort(s_b2.begin(), s_b2.end());
            if (s_b1.size() + s_b2.size() < cnt_b) {
                continue;
            }
            int pos1 = 0, pos2 = 0;
            int cnt = pr_a;
            int cnt_b_vl = 0;
            double speed = 1;
            while (cnt < k || cnt_b_vl < cnt_b) {
                if (pos1 < (int)s_b1.size() && pos2 < (int)s_b2.size()) {
                    if (s_b1[pos1] / speed < s_b2[pos2].first / speed - s_b2[pos2].second) {
                        ans_nw += s_b1[pos1] / speed;
                        cnt++;
                        pos1++;
                        cnt_b_vl++;
                        speed += 1;
                    } else {
                        ans_nw += s_b2[pos2].first / speed - s_b2[pos2].second;
                        pos2++;
                        cnt_b_vl++;
                        speed += 1;
                    }
                } else if (pos1 < (int)s_b1.size()) {
                    ans_nw += s_b1[pos1] / speed;
                    cnt++;
                    pos1++;
                    cnt_b_vl++;
                    speed += 1;
                } else if (pos2 < (int)s_b2.size()) {
                    ans_nw += s_b2[pos2].first / speed - s_b2[pos2].second;
                    pos2++;
                    cnt_b_vl++;
                    speed += 1;
                } else {
                    break;
                }
            }
            if (cnt >= k && cnt_b_vl >= cnt_b) {
                ans = min(ans, ans_nw);
            }
        }
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(25);
    cout << fixed;
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:35:43: warning: comparison of integer expressions of different signedness: 'std::vector<double>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |             if (s_b1.size() + s_b2.size() < cnt_b) {
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 500 KB Output is correct
6 Correct 8 ms 464 KB Output is correct
7 Correct 44 ms 348 KB Output is correct
8 Correct 134 ms 348 KB Output is correct
9 Correct 300 ms 348 KB Output is correct
10 Correct 110 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 500 KB Output is correct
6 Correct 8 ms 464 KB Output is correct
7 Correct 44 ms 348 KB Output is correct
8 Correct 134 ms 348 KB Output is correct
9 Correct 300 ms 348 KB Output is correct
10 Correct 110 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 102 ms 456 KB Output is correct
13 Correct 68 ms 456 KB Output is correct
14 Correct 27 ms 344 KB Output is correct
15 Correct 702 ms 464 KB Output is correct
16 Correct 423 ms 600 KB Output is correct
17 Correct 189 ms 344 KB Output is correct
18 Correct 1659 ms 464 KB Output is correct
19 Correct 949 ms 504 KB Output is correct
20 Correct 461 ms 344 KB Output is correct

Subtask #3
0 / 11.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 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.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 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.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 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1677 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 500 KB Output is correct
6 Correct 8 ms 464 KB Output is correct
7 Correct 44 ms 348 KB Output is correct
8 Correct 134 ms 348 KB Output is correct
9 Correct 300 ms 348 KB Output is correct
10 Correct 110 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 102 ms 456 KB Output is correct
13 Correct 68 ms 456 KB Output is correct
14 Correct 27 ms 344 KB Output is correct
15 Correct 702 ms 464 KB Output is correct
16 Correct 423 ms 600 KB Output is correct
17 Correct 189 ms 344 KB Output is correct
18 Correct 1659 ms 464 KB Output is correct
19 Correct 949 ms 504 KB Output is correct
20 Correct 461 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Incorrect 0 ms 348 KB Output isn't correct
30 Halted 0 ms 0 KB -