Submission #892652

#	Time	Username	Problem	Language	Result	Execution time	Memory
892652		Macker	Hiring (IOI09_hiring)	C++17	30 / 100	269 ms	20156 KiB

hiring

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")

struct node {
    int cnt = 0; ld val = 0;
};

const int len = 32768;
const ld eps = 1e-50;
vector<node> st(len * 2);

void add(int idx, ld val, int i = 1, int s = 0, int e = len){
    if(idx >= e || idx < s) return;
    if(idx == s && s + 1 == e) {
        st[i].val += val;
        st[i].cnt++;
        return;
    }
    add(idx, val, i * 2, s, (s + e) / 2);
    add(idx, val, i * 2 + 1, (s + e) / 2, e);
    st[i].val = st[i * 2].val + st[i * 2 + 1].val;
    st[i].cnt = st[i * 2].cnt + st[i * 2 + 1].cnt;
}

int walk(ld b, ld m, int i = 1){
    if(i >= len){
        if(b - st[i].val * m > -eps) return st[i].cnt;
        else return 0;
    }
    if(b - st[i * 2].val * m > -eps) return st[i * 2].cnt + walk(b - st[i * 2].val * m, m, i * 2 + 1);
    else return walk(b, m, i * 2);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, b; cin >> n >> b;
    vector<pair<ld, int>> v;
    for (int i = 0; i < n; i++) {
        int c, q; cin >> c >> q;
        v.push_back({(ld)c / (ld)q, q});
    }
    sort(all(v));

    int mx = 0, mxi;
    for (int i = 0; i < n; i++) {
        auto& [x, q] = v[i];
        add(q, q);
        int ret = walk(b, x);
        if(ret > mx){
            mx = ret;
            mxi = i;
        }
    }
    
    cout << mx << "\n";
    for (int i = 0; i < mx; i++)
        cout << 0 << "\n";
    
}

Compilation message (stderr)

hiring.cpp: In function 'int main()':
hiring.cpp:53:17: warning: variable 'mxi' set but not used [-Wunused-but-set-variable]
   53 |     int mx = 0, mxi;
      |                 ^~~

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