Submission #1001590

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001590		LilPluton	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	37 ms	7344 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
/// author: LilPluton auuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu
#define OPT         ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb          push_back
#define arr         array
#define vll         vector<int>
#define ll          long long
#define segment_tree int l=n*2,r=l+1,mid=(b+e)/2
#define fi          first
#define se          second
#define rep(i,j,k)  for(int i = j; i <= k; ++i)
#define all(a)      a.begin(),a.end()
#define pii         pair<ll,int>
#define endll       '\n'
using namespace std;
const int N = 1e5 + 5;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pii>a(n);
    for(int i = 0; i < n; ++i)
        a[i] = {w[i], i};
    sort(all(a));
    ll sum = 0;
    int lb = 0, rb = 0;
    vector<int>ans;
    int r = 0;
    	for (int i = 0; i < n; i++)
    	{
    		while (r < n && sum < l)
    		{
    			sum += a[r].first;
    			r++;
    		}
    		if (sum >= l && sum <= u)
    		{
    			vector<int> ans;
    			for (int j = i; j < r; j++)
    			{
    				ans.push_back(a[j].second);
    			}
    			return ans;
    		}
    		sum -= a[i].first;
    	}
    return ans;
}

Compilation message (stderr)

molecules.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("unroll-loops")
      | 
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:29:9: warning: unused variable 'lb' [-Wunused-variable]
   29 |     int lb = 0, rb = 0;
      |         ^~
molecules.cpp:29:17: warning: unused variable 'rb' [-Wunused-variable]
   29 |     int lb = 0, rb = 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