# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21175 | sbansalcs | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 5152 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 <algorithm>
#include <assert.h>
#include <iostream>
typedef long long ll;
using namespace std;
const int N = 2e5+5;
pair<int,int> arr[N];
ll sums[N];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
int n=w.size();
for(int i=1;i<=n;i++) {
arr[i].first=w[i-1];
arr[i].second=i-1;
}
sort(arr+1,arr+1+n);
for(int i=1;i<=n;i++) {
if(arr[i].first>=l && arr[i].first<=u) {
ans.push_back(arr[i].second);
return ans;
}
sums[i]=sums[i-1]+arr[i].first;
}
int k=0;
if(sums[n]>=l && sums[n]<=u) {
for(int i=0;i<n;i++) {
ans.push_back(i);
}
return ans;
}
for(int i=2;i<n;i++) {
if(sums[i]>u || sums[n]-sums[n-i]<l) continue;
int lx=1,rx=i;
ll sm=sums[i];
while(rx<n) {
// cout<<lx<<" "<<rx<<" "<<sm<<endl;
sm-=arr[lx].first;lx++;
rx++;
sm+=arr[rx].first;
if(sm>=l && sm<=u) {
// cout<<lx<<" "<<rx<<" "<<sm<<endl;
for(int j=lx;j<=rx;j++) {
ans.push_back(arr[j].second);
// cout<<j<<" :: "<<arr[j].first<<" , "<<arr[j].second<<endl;;
}
break;
}
}
assert(sm>=l && sm<=u);
break;
}
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... |