Submission #216915

#	Time	Username	Problem	Language	Result	Execution time	Memory
216915		2fat2code	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	74 ms	8300 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;


vector<int> find_subset(int l,int u,vector<int>w){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    long long l1=l;
    long long u1=u;
    vector<pair<long,long>>a;
    for(int i=0;i<w.size();i++) a.push_back({w[i],i});
    sort(all(a));
    long long sum=0;
    int le=0;
    int n=w.size()-1;
    while(le<=n && sum+a[le].fr<=u1){
        sum+=a[le].fr;
        le++;
    }
    le--;
    vector<int>ans;
    int r=-1;
    while(le<n){
        if(sum>=l1 && sum<=u1){
            for(int i=r+1;i<=le;i++){
                ans.push_back(a[i].sc);
            }
            return ans;
        }
        le++;
        sum+=a[le].fr;
        r++;
        sum-=a[r].fr;
    }
    if(sum>=l1 && sum<=u1){
        for(int i=r+1;i<=le;i++){
            ans.push_back(a[i].sc);
        }
        return ans;
    }
    return ans;
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<w.size();i++) a.push_back({w[i],i});
                 ~^~~~~~~~~

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