# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207798 | ansori | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 3656 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
#define se second
#define fi first
#define ll long long
using namespace std;
std::vector<int> find_subset(int f, int u, std::vector<int> w) {
ll n = w.size();
vector<pair<int , int>> p(n);
for(int i = 0;i < n; ++ i) p[i] = {w[i] , i};
sort(p.begin() , p.end());
ll sm = 0 , r = 0;
for(ll l = 0;l < n; ++ l){
r = max(r , l);
while(r < n and sm + p[r].fi <= u){
sm += p[r].fi;
r ++;
}
if(sm >= f){
vector<int> ans;
for(int i = l;i < r; ++ i) ans.push_back(p[i].se);
return ans;
}
if(r > l) sm -= p[l].fi;
}
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... |