# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165887 | Dpika | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 5192 KiB |
#include "molecules.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
long long n=w.size();
vector<pair<long long,long long>>v(n);
for (long long i=0;i<n;i++){
v[i]={w[i],i};
}
sort(v.begin(),v.end());
long long a=0,b=0;
vector<int>p;
long long c=v[0].first;
while(b<n){
if(c>u){
c=c-v[a].first;
a++;
}
else if (c<l){
b++;
c=c+v[b].first;
}
else{
for (long long i=a;i<=b;i++){
p.push_back(v[i].second);
}
sort(p.begin(),p.end());
return p;
}
}
return p;
}
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... |