Submission #1002112

#	Time	Username	Problem	Language	Result	Execution time	Memory
1002112		rahidilbayramli	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	47 ms	8232 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll int
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
vl find_subset(ll l, ll u, vl w) {
    ll f = min(l, u);
    ll g = max(l, u);
    l = f, u = g;
    vl ans;
    vector<pll>vect;
    vect.pb({0, 0});
    for(ll i = 0; i < w.size(); i++)
        vect.pb({w[i] * 1LL, i});
    sort(all(vect));
    ll n = w.size(), i;
    long long pref[n+5];
    pref[0] = 0LL;
    for(i = 1; i <= n; i++)
        pref[i] = pref[i-1] * 1LL + vect[i].f * 1LL;
    //for(i = 1; i <= n; i++)
        //cout << pref[i]<< "\n";
    for(i = 1; i <= n; i++)
    {
        ll lo = i, hi = n;
        //cout << "i: " << i << "\n";
        while(lo <= hi)
        {
            ll mid = (lo + hi) / 2;
            ll sum = pref[mid] * 1LL - pref[i-1] * 1LL;
            //cout << "mid: " << mid << " sum: " << sum << "\n";
            if(sum > u)
                hi = mid - 1;
            else    if(sum < l)
                lo = mid + 1;
            else    if(l <= sum && sum <= u)
            {
                for(ll j = i; j <= mid; j++)
                    ans.pb(vect[j].s);
                return ans;
            }
        }
    }
    return ans;
}

Compilation message (stderr)

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

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