Submission #729036

#	Time	Username	Problem	Language	Result	Execution time	Memory
729036		grogu	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	91 ms	18284 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define endl '\n'
#define here cerr<<"=========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#define ll long long
#define pb push_back
#define popb pop_back
#define all(a_) a_.begin(),a_.end()
#define pll pair<ll,ll>
#define sc second
#define fi first

using namespace std;
#define maxn 200005
ll n;
pll a[maxn];
ll last[maxn];
ll l,r;
vector<int> find_subset(int L, int R, vector<int> w) {
    n = w.size(); l = L; r = R;
    ll sum = 0;
    for(ll i = 1;i<=n;i++){
        a[i].fi = w[i-1];
        a[i].sc = i-1;
        if(a[i].fi>=l&&a[i].fi<=r) return {i-1};
        sum+=a[i].fi;
    }
    sort(a+1,a+1+n);
    ll cur = 0;
    set<pll> s;
    for(ll i = 1;i<=n;i++){
        cur+=a[i].fi;
        s.insert(a[i]);
        if(cur<=r&&cur>=l){
            vector<int> ans;
            for(pll p : s) ans.pb(p.sc);
            sort(all(ans));
            return ans;
        }
        while(cur>r){
            cur-=s.begin()->fi;
            s.erase(s.begin());
        }
        if(cur<=r&&cur>=l){
            vector<int> ans;
            for(pll p : s) ans.pb(p.sc);
            sort(all(ans));
            return ans;
        }
    }
    return {};
}
/**
4 15 17
6 8 8 7


4 14 15
5 5 6 6

4 10 20
15 17 16 18
**/

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:26:45: warning: narrowing conversion of '(i - 1)' from 'long long int' to 'int' [-Wnarrowing]
   26 |         if(a[i].fi>=l&&a[i].fi<=r) return {i-1};
      |                                            ~^~
molecules.cpp:26:45: warning: narrowing conversion of '(i - 1)' from 'long long int' to 'int' [-Wnarrowing]

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