# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161591 | kostia244 | Detecting Molecules (IOI16_molecules) | C++14 | 191 ms | 18152 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<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<int>;
vector<pair<int, int>> v;
vi find_subset(int l, int u, std::vector<int> w) {
for(int i = 0; i < w.size(); i++) v.pb({w[i], i});
sort(all(v));
set<pair<ll, ll>> x;
x.insert({0, -1});
ll sm = 0;
for(int i = 0; i < w.size(); i++) {
sm += v[i].first;
auto it = x.lower_bound({sm-u, -99999});
if(it!=x.end()) {
// cout << j << " " << (it->second) << "\n";
ll val = sm - it->first;
if(val >= l && val <= u) {
vi ans;
for(int j = it->second+1; j <= i; j++)
ans.pb(v[j].second);
return ans;
}
}
x.insert({sm, i});
}
return {};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |