Submission #754331

#	Time	Username	Problem	Language	Result	Execution time	Memory
754331		DJeniUp	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	312 KiB

molecules

#include "molecules.h"
#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<ll,ll>pairll;

#define fr first
#define sc second
#define pb push_back
#define N 100007

priority_queue<pairll,vector<pairll>,greater<pairll> >q;

priority_queue<pairll>g;

struct D{
    ll a,n;
}d[2*N];

bool mcp(D d1, D d2){
    return d1.a<d2.a;
}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    for(int i=0;i<w.size();i++){
        d[i]={w[i],i};
    }
    sort(d,d+w.size(),mcp);
    ll r=0;
    for(int i=w.size()-1;i>0;i--){
        if(r<l){
            r+=d[i].a;
            g.push({d[i].a,d[i].n});
        }else{
            q.push({d[i].a,d[i].n});
        }
    }
    while(q.size()>0 && r>u && g.size()>0){
        r-=g.top().fr;
        g.pop();
        g.push(q.top());
        r+=q.top().fr;
        q.pop();
    }
    //cout<<r<<" "<<l<<" "<<u<<" "<<g.size()<<endl;
    if(r<l || r>u)return std::vector<int>(0);
    vector<int>res;
    while(g.size()>0){
        res.pb(int(g.top().sc));
        //cout<<g.top().sc<<endl;
        g.pop();
    }
    sort(res.begin(),res.end());
    return res;
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<w.size();i++){
      |                 ~^~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31