# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388556 | alishahali1382 | Detecting Molecules (IOI16_molecules) | C++14 | 57 ms | 6076 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
#define pb push_back
#define all(x) x.begin(), x.end()
int n, m, k;
vector<int> out;
vector<pli> vec;
vector<int> find_subset(int l, int u, vector<int> W){
for (int i=0; i<W.size(); i++) vec.pb({W[i], i});
sort(all(vec));
while (vec.size() && vec.back().first>u) vec.pop_back();
n=vec.size();
ll sum=0;
while (k<n && sum+vec[k].first<l) sum+=vec[k++].first;
if (k==n) return out; // jame kol < l
if (sum+vec[k].first<=u){
for (int i=0; i<=k; i++) out.pb(vec[i].second);
return out;
}
for (int i=k; i<n; i++){
sum+=vec[i].first-vec[i-k].first;
if (sum>=l){
for (int j=i-k+1; j<=i; j++) out.pb(vec[j].second);
return out;
}
}
// har k_ta<l
// har k+1_ta>u
return out;
}
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... |