oj.uz

Submission #893271

# Submission time Handle Problem Language Result Execution time Memory
893271 2023-12-26T19:33:27 Z Macker Hiring (IOI09_hiring) C++17
100 / 100
 456 ms 53800 KB 
#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;
}

pair<int, ld> walk(ld b, ld m, int i = 1) {
    if(i >= len){
        if(st[i].cnt == 0) return {0, b};
        if(st[i].val < eps) return {st[i].cnt, b};
        ld val = st[i].val / st[i].cnt * m;
        return {(int)(floor(b / val) + 0.5), b - floor(b / val) * val};
    }
    if(b - st[i * 2].val * m > -eps){
        pair<int, int> r = walk(b - st[i * 2].val * m, m, i * 2 + 1);
        return {st[i * 2].cnt + r.first, r.second};
    }
    else return walk(b, m, i * 2);
}

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

    pair<int, int> mx = {0, 0}; int mxi;
    for (int i = 0; i < n; i++) {
        auto& [x, q] = v[i].first;
        add(q, q);
        pair<int, int> ret = walk(b, x);
        if(ret > mx){
            mx = ret;
            mxi = i;
        }
    }
    
    set<pair<int, int>> s;
    vector<int> res;
    for (int i = 0; i <= mxi; i++) {
        int q = v[i].first.second, j = v[i].second;
        s.insert({q, j});
    }
    int j = 0;
    for (auto &i : s) {
        if(j >= mx.first) break;
        res.push_back(i.second);
        j++;
    }
    cout << mx.first << "\n";
    for (auto &i : res) {
        cout << i + 1 << "\n";
    }
}

Compilation message

hiring.cpp: In function 'int main()':
hiring.cpp:71:23: warning: 'mxi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |     for (int i = 0; i <= mxi; i++) {
      |                     ~~^~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 3 ms 2648 KB Output is correct
7 Correct 3 ms 2652 KB Output is correct
8 Correct 3 ms 2652 KB Output is correct
9 Correct 7 ms 2980 KB Output is correct
10 Correct 5 ms 3100 KB Output is correct
11 Correct 6 ms 3160 KB Output is correct
12 Correct 7 ms 3160 KB Output is correct
13 Correct 7 ms 3416 KB Output is correct
14 Correct 11 ms 3796 KB Output is correct
15 Correct 12 ms 3796 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 17 ms 4304 KB Output is correct
5 Correct 38 ms 10184 KB Output is correct
6 Correct 257 ms 31324 KB Output is correct
7 Correct 335 ms 43272 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct

Subtask #6
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 14040 KB Output is correct
2 Correct 99 ms 14012 KB Output is correct
3 Correct 98 ms 14236 KB Output is correct

Subtask #7
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 23980 KB Output is correct
2 Correct 152 ms 24596 KB Output is correct
3 Correct 152 ms 23592 KB Output is correct

Subtask #8
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 387 ms 47936 KB Output is correct
2 Correct 376 ms 48492 KB Output is correct
3 Correct 380 ms 47780 KB Output is correct

Subtask #9
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 456 ms 53464 KB Output is correct
2 Correct 450 ms 53800 KB Output is correct
3 Correct 455 ms 53580 KB Output is correct