| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1284691 | Rares | Detecting Molecules (IOI16_molecules) | C++20 | 40 ms | 4128 KiB |
#include <bits/stdc++.h>
using namespace std;
vector <int> rez;
int s,n;
vector <pair <int,int>> p;
vector <int> a;
vector <int> find_subset (int l, int r, vector <int> v){
n=v.size ();
for (int i=0;i<n;++i){
p.push_back ({v[i],i});
}
sort (p.begin (),p.end ());
sort (v.begin (),v.end ());
int j=0;
for (int i=0;i<n;++i){
s+=v[i];
while (j<=i and s>r){
s-=v[j];
j++;
}
if (s>=l){
for (int k=j;k<=i;++k){
a.push_back (p[k].second);
}
return a;
}
}
return a;
}
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... | ||||
