# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778096 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
const int N = 8e5+37;
#define int long long
#include "molecules.h"
/*void f(){
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}*/
vector<int> find_subset(int l, int u, vector<int> w) {
vector<array<int, 2>> a(w.size());
for(int i=0; i<w.size(); i++){
a[i]={w[i], i};
}
sort(a.begin(), a.end());
if(a[0][0]>u)
return std::vector<int>(0);
int sum=0, k=-1;
for(int i=0; i<a.size()&&k==-1; i++){
if(sum+a[i][0]>l){
k=i;
}
else{
sum+=a[i][0];
}
}
if(k==-1) return std::vector<int>(0);
if(k==0){
vector<int> ans(1);
ans[0]=a[0][1]+1;
return ans;
}
sum-=a[a.size()-1][0];
sum+=a[a.size()-1][0];
if(sum<l||sum>u) return std::vector<int>(0);
vector<int> ans;
for(int i=1; i<k; i++){
ans.push_back(a[i][1]+1);
}
ans.push_back(a[a.size()-1][1]+1);
sort(ans.begin(), ans.end());
return ans;
}
/*
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
f();
int n; cin >> n;
int u, v; cin >> u>>v;
vector<int> a(n);
for(int i=0; i<n; i++) cin >> a[i];
auto x= find_subset(u, v, a);
cout<<x.size()<<"\n";
for(auto i: x) cout<<i<<" ";
cout<<"\n";
}*/