제출 #545365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545365		alextodoran	Hiring (IOI09_hiring)	C++17	100 / 100	533 ms	61536 KiB

hiring

#include <bits/stdc++.h>

using namespace std;
typedef long double ld;

const int N_MAX = 500000;

int N; ld budget;

struct Worker {
    int initId;
    ld qualif;
    ld base;
};
bool operator < (const Worker &x, const Worker &y) {
    return x.base < y.base;
}

Worker workers[N_MAX + 2];

int perm[N_MAX + 2];
int id[N_MAX + 2];

ld sumFen[N_MAX + 2];
int cntFen[N_MAX + 2];
void update (int pos, ld val) {
    for (int i = pos; i <= N; i += i & -i) {
        sumFen[i] += val;
        cntFen[i] += 1;
    }
}
pair <int, ld> maxLower (ld budget) {
    int i = 0, cnt = 0;
    for (int step = (1 << 19); step >= 1; step >>= 1) {
        if (i + step <= N && sumFen[i + step] <= budget) {
            i += step;
            budget -= sumFen[i];
            cnt += cntFen[i];
        }
    }
    return make_pair(cnt, budget);
}

pair <int, ld> best[N_MAX + 2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> budget;
    for (int i = 1; i <= N; i++) {
        int minSal; cin >> minSal;
        cin >> workers[i].qualif;
        workers[i].base = minSal / workers[i].qualif;
        workers[i].initId = i;
    }
    sort(workers + 1, workers + N + 1);

    iota(perm + 1, perm + N + 1, 1);
    sort(perm + 1, perm + N + 1, [&] (const int &i, const int &j) {
        return workers[i].qualif < workers[j].qualif;
    });
    for (int i = 1; i <= N; i++) {
        id[perm[i]] = i;
    }

    int k = 1;
    for (int i = 1; i <= N; i++) {
        update(id[i], workers[i].qualif);
        best[i] = maxLower(budget / workers[i].base);
        best[i].second *= workers[i].base;
        if (best[i] > best[k]) {
            k = i;
        }
    }

    vector <int> ids;
    for (int i = 1; i <= k; i++) {
        ids.push_back(id[i]);
    }
    sort(ids.begin(), ids.end());
    while ((int) ids.size() > best[k].first) {
        ids.pop_back();
    }
    cout << (int) ids.size() << "\n";
    for (int i : ids) {
        cout << workers[perm[i]].initId << "\n";
    }

    return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 28 / 28
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 6 / 6
• Subtask 7: 6 / 6
• Subtask 8: 6 / 6
• Subtask 9: 6 / 6