# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164603 | Aza | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
//AzaLE (Azamat Alisherov)
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector <int> find_subset(int x, int y, vector<int> v){
int n = v.size();
vector <pair<int, int>> g;
for(int i = 0; i < n; i++){
g.emplace_back(v[i], i);
}
sort(g.begin(), g.end());
long long sum = 0;
int l = 0, r = 0;
for(r = r; r < n; r++){
sum += g[r].first;
while(sum > y and l < r){
sum -= g[l].first;
l++;
}
if(sum >= x){
vector <int> ans;
for(int i = l; i <= r; i++){
ans.emplace_back(g[i].second);
}
return ans;
}
}
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... |