oj.uz

답안 #507587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
507587 2022-01-12T18:53:46 Z tabr Hiring (IOI09_hiring) C++17
100 / 100
 641 ms 22128 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    long long w;
    cin >> n >> w;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j) {
        auto x = a[i];
        auto y = a[j];
        if (x.first * y.second != x.second * y.first) {
            return x.first * y.second < x.second * y.first;
        }
        return x.first < y.first;
    });
    multiset<pair<int, int>> st;
    long long sum = 0;
    pair<int, long double> ans = make_pair(0, 0);
    for (int i : order) {
        sum += a[i].second;
        st.emplace(a[i].second, i);
        while (sum * 1LL * a[i].first > w * a[i].second) {
            auto it = prev(st.end());
            sum -= it->first;
            st.erase(it);
        }
        ans = max(ans, make_pair((int) st.size(), -1.0L * sum * a[i].first / a[i].second));
    }
    if (ans.first == 0) {
        cout << 0 << '\n';
        return 0;
    }
    st.clear();
    sum = 0;
    for (int i : order) {
        sum += a[i].second;
        st.emplace(a[i].second, i);
        while (sum * 1LL * a[i].first > w * a[i].second) {
            auto it = prev(st.end());
            sum -= it->first;
            st.erase(it);
        }
        if (make_pair((int) st.size(), -1.0L * sum * a[i].first / a[i].second) == ans) {
            cout << ans.first << '\n';
            for (auto p : st) {
                cout << p.second + 1 << '\n';
            }
            break;
        }
    }
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 424 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 4 ms 452 KB Output is correct
14 Correct 7 ms 844 KB Output is correct
15 Correct 8 ms 836 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 10 ms 1080 KB Output is correct
5 Correct 26 ms 1992 KB Output is correct
6 Correct 246 ms 9880 KB Output is correct
7 Correct 365 ms 13764 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 320 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #6
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 4356 KB Output is correct
2 Correct 109 ms 4204 KB Output is correct
3 Correct 83 ms 4204 KB Output is correct

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 7044 KB Output is correct
2 Correct 117 ms 7012 KB Output is correct
3 Correct 116 ms 7096 KB Output is correct

Subtask #8
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 435 ms 14916 KB Output is correct
2 Correct 422 ms 15028 KB Output is correct
3 Correct 397 ms 14900 KB Output is correct

Subtask #9
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 641 ms 17732 KB Output is correct
2 Correct 609 ms 22128 KB Output is correct
3 Correct 580 ms 22128 KB Output is correct