oj.uz

Submission #906501

# Submission time Handle Problem Language Result Execution time Memory
906501 2024-01-14T11:09:24 Z JakobZorz Hiring (IOI09_hiring) C++17
55 / 100
 1500 ms 25940 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second
 
struct Obj{
    ll s; // min salary
    ll q; // skill
    int i;
};
 
bool cmp(Obj&a,Obj&b){
    return a.s*b.q<b.s*a.q;
}

ll w;
int n;
const int TREE_SIZE=1<<19;
ll vals[TREE_SIZE];
ll valst[2*TREE_SIZE];
int present[2*TREE_SIZE];

void update_node(int node){
    if(node<TREE_SIZE){
        valst[node]=valst[2*node]+valst[2*node+1];
        present[node]=present[2*node]+present[2*node+1];
    }
}

void add(ll val){
    /*vals.push_back(val);
    sort(vals.begin(),vals.end());*/
    int l=0,r=n;
    while(l<r-1){
        int m=(l+r)/2;
        if(vals[m]>val||(vals[m]==val&&present[TREE_SIZE+m]))
            r=m;
        else
            l=m;
    }
    present[TREE_SIZE+l]=1;
    valst[TREE_SIZE+l]=vals[l];
}

int get(ll&cost,ll m1,ll m2){
    int cres=0;
    int res=0;
    while(cres<n){
        if((cost+valst[TREE_SIZE+cres])*m1<=w*m2){
            cost+=valst[TREE_SIZE+cres];
            res+=present[TREE_SIZE+cres];
            cres++;
        }else{
            break;
        }
    }
    return res;
}

void solve(){
    cin>>n>>w;
    vector<Obj>arr(n);
    for(int i=0;i<n;i++){
        cin>>arr[i].s>>arr[i].q;
        arr[i].i=i+1;
        vals[i]=arr[i].q;
    }
    sort(vals,vals+n);
    
    for(int i=TREE_SIZE-1;i>0;i--)
        update_node(i);
    
    sort(arr.begin(),arr.end(),cmp);
    int res=0;
    int opt=0;
    ll m1=0,m2=1; // spends m1/m2
    for(int i=0;i<n;i++){
        if(i)
            add(arr[i-1].q);
        
        ll cost=arr[i].q;
        if(cost*arr[i].s>w*arr[i].q)
            continue;
        
        int cres=get(cost,arr[i].s,arr[i].q);
        
        if(cres+1>res){
            res=cres+1;
            opt=i;
            m1=cost*arr[i].s;
            m2=arr[i].q;
        }else if(cres+1==res){
            if((__int128)cost*arr[i].s*m2<(__int128)m1*arr[i].q){
                opt=i;
                m1=cost;
                m2=arr[i].q;
            }
        }
    }
    
    
    cout<<res<<"\n";
    if(res){
        cout<<arr[opt].i<<"\n";
        int i=opt;
        vector<pair<ll,int>>vals;
        for(int j=0;j<i;j++)
            vals.emplace_back(arr[j].q,arr[j].i);
        sort(vals.begin(),vals.end());
        ll cost=arr[i].q;
        int cres=0;
        while(cres<(int)vals.size()){
            if((cost+vals[cres].first)*arr[i].s<=w*arr[i].q){
                cost+=vals[cres].first;
                cout<<vals[cres].second<<"\n";
                cres++;
            }else{
                break;
            }
        }
    }
}
 
int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}
 
/*
 
4 100
5 1000
10 100
8 10
20 1
 
2
2
3
 
3 4
1 2
1 3
1 3
 
3
1
2
3
 
 
3 40
10 1
10 2
10 3
 
2
2
3
 
 
5 30
1 1
2 2
4 4
8 8
16 16
 
4
1
2
3
4
 
2 2
2 2
1 1

1
2
 
6 5
1 96
2 100
2 97
3 95
4 98
5 99
 
2
1
2
 
 */

Subtask #1
26.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Partially correct 3 ms 8792 KB Partially correct
6 Correct 5 ms 9048 KB Output is correct
7 Partially correct 5 ms 9052 KB Partially correct
8 Correct 6 ms 9204 KB Output is correct
9 Correct 14 ms 9052 KB Output is correct
10 Correct 17 ms 9132 KB Output is correct
11 Correct 14 ms 9308 KB Output is correct
12 Correct 47 ms 9216 KB Output is correct
13 Partially correct 30 ms 9084 KB Partially correct
14 Correct 87 ms 9568 KB Output is correct
15 Partially correct 115 ms 9624 KB Partially correct

Subtask #2
14.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Partially correct 2 ms 8796 KB Partially correct
3 Correct 3 ms 8792 KB Output is correct
4 Partially correct 214 ms 9756 KB Partially correct
5 Partially correct 1487 ms 13428 KB Partially correct
6 Execution timed out 1520 ms 21416 KB Time limit exceeded
7 Execution timed out 1512 ms 22372 KB Time limit exceeded

Subtask #3
3.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9048 KB Output is correct
2 Partially correct 4 ms 9052 KB Partially correct
3 Correct 3 ms 9052 KB Output is correct

Subtask #4
6.0 / 6.0

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

Subtask #5
6.0 / 6.0

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

Subtask #6
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1569 ms 15176 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1558 ms 16932 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1547 ms 25428 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1514 ms 25940 KB Time limit exceeded
2 Halted 0 ms 0 KB -