# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
773365 | Matblube | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";
#define fr(i, x) for(ll i=0 ; i<x ; i++)
#define fra(x, v) for(auto x:v)
#define fra1(x,v) for(auto &x:v)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb(x) push_back(x)
#define F first
#define S second;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(all(w));
ll a, b, cc, pos;
std::vector<int>result;
a=b=cc=pos=0;
while(1){
if(b>=n || a>=n) break;
if(cc<l){
cc+=w[a++]; continue;
}
if(cc>u){
cc-=w[b++]; continue;
}
for(int i=a; i<b ; i++){
result.pb(w[i]);
}
return result;
}
return std::vector<int>(0);
}