Submission #915148

#	Time	Username	Problem	Language	Result	Execution time	Memory
915148		winter0101	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	49 ms	7388 KiB

molecules

#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
long long f[200009];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int>ans;
    vector<pii>a;
    int n=sz(w);
    for1(i,0,n-1)a.pb({w[i],i});
    sort(all(a));
    if (a[0].fi>u)return {};
    for1(i,0,n-1){
    if (a[i].fi>=l&&a[i].se<=u){
    return {a[i].se};
    }
    }
    int sum=0;
    vector<int>id;
    for1(i,0,n-1){
    f[i+1]=f[i]+a[i].fi;
    }
    for1(i,1,n){
    int l1=1,r1=i,ans=-1;
    while (l1<=r1){
    int mid=(l1+r1)>>1;
    if (f[i]-f[mid-1]>u){
    l1=mid+1;
    }
    else {
    r1=mid-1;
    ans=mid;
    }
    }
    if (ans!=-1&&f[i]-f[ans-1]>=l){
    for1(j,ans,i)id.pb(a[j-1].se);
    return id;
    }
    }
    return {};
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:30:9: warning: unused variable 'sum' [-Wunused-variable]
   30 |     int sum=0;
      |         ^~~

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