# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001617 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 64 ms | 17152 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 ll long long
vector<vector<ll>> ve;
vector<ll> pr;
int bs(int n, int si, int a, int b){
int l = si, r = n, best = -1;
while (l <= r){
int mid = (l + r) / 2;
ll res = pr[mid] - pr[mid - si];
if (res > b){
r = mid - 1;
}
else if (res < a){
l = mid + 1;
}
else{
return mid;
}
}
return -1;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
int n = w.size();
ve.push_back({0, 0});
for (int i = 0; i < n; i++){
ve.push_back({w[i], i});
}
sort(ve.begin(), ve.end());
pr.assign(n + 1, 0);
for (int i = 1; i <= n; i++){
pr[i] = pr[i - 1] + ve[i][0];
}
for (int i = 1; i <= n; i++){
int res = bs(n, i, l, u);
if (res != -1){
for (int j = res - i + 1; j <= res; j++){
ans.push_back(ve[j][1]);
}
sort(ans.begin(), ans.end());
return ans;
}
}
return ans;
}
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... |