# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019869 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 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<bits/stdc++.h>
#define int long long
#define vi vector<long long>
#define vvi vector<vi>
#define pi pair<long long, long long>
#define vpi vector<pi>
#define loop(a, b) for(long long a = 0;a<b;a++)
#define all(a) a.begin(), a.end()
#define space << " " <<
#define flase false
#define fasle flase
using namespace std;
const int VeryBigNumber = 1e18 + 42 + 1;
const int VeryNiceNumber = 420 + 69;
vi find_subset(int l, int u, vi w){
int wnow = 0;
loop(i, w.size()){
wnow += w[i];
if (wnow <= u and wnow >= l){
vi ans = {};
loop(j, i){
ans.push_back(j);
}
return ans;
}
}
}
/*
l < k*Wi < u
*/