# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001666 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 348 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>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
ll p[200005];
std::vector<int> find_subset(int k, int u, std::vector<int> w) {
vector<pair<int, int>>v;
for (int i = 0; i<w.size(); i++){
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
for (ll i = 0; i<v.size(); i++){
p[i+1] = p[i] + v[i].first;
}
vector<int>f;
ll x = -1, y = -1;
for (ll i = 0; i<v.size(); i++){
ll l = i, r = v.size()-1;
while (l <= r){
ll m = (l + r)/2;
if (p[m+1] - p[i] >= k and p[m+1] - p[i] <= u and v[m].first - v[i].first <= (u - k)){
x = i;
y = m;
break;
}
else if (p[m+1] - p[i] < k){
l = m + 1;
}
else {
r = m - 1;
}
}
if (x != -1 and y != -1) break;
}
for (ll i = x; i<=y; i++){
f.push_back(v[i].second);
}
return f;
}
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... |