# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1265829 | WH8 | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
v.push_back({w[i], i});
}
vector<int> ans;
//~ sort(v.begin(),v.end());
//~ for(auto it: v){
//~ printf(" (%lld, %lld) ", it.f, it.s);
//~ }
//~ cout<<endl;
int sm=0, i;
for(i=0;i<n;i++){
sm+=v[i].f;
if(sm >= l and sm <= u){
for(int j=0;j<=i;j++){
ans.push_back(v[j].s);
}
return ans;
}
if(sm > u){
sm -= v[i].f;
break;
}
}
for(int r=i;r<n;r++){
sm -= v[r-i].f;
sm += v[r].f;
if(sm >= l and sm <= u){
for(int j=r-i+1;j<=r;j++){
ans.push_back(v[j].s);
}
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... |