# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
778186 | 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 8e5+37;
#include <cstdio>
#include <vector>
#include <cassert>
#include "molecules.h"
void f(){
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
vector<int> find_subset(int x, int y, vector<long long> w) {
long long l=x; long long u=y;
int n= w.size();
vector<array<long long, 2>> a(n);
vector<int> vis(n);
for(int i=0; i<n; i++){
a[i]={w[i], i};
}
sort(a.begin(), a.end());
if(a[0][0]>u)
return vector<int>(0);
long long sum=0, k=-1;
for(int i=0; i<n&&k==-1; i++){
if(sum+a[i][0]>=l){
k=i;
}
else{
sum+=a[i][0];
vis[i]=1;
}
}
if(k==-1) return std::vector<int>(0);
if(k==0){
vector<int> ans(1);
ans[0]=a[0][1];
return ans;
}
if(sum+a[k][0]>=l&&sum+a[k][0]<=u){
vector<int> ans;
for(int i=0; i<=k; i++) ans.push_back(a[i][1]);
return ans;
}
int p=n-1;
for(long long i=0; i<k&&2*i<p; i++){
sum+=a[p-i][0]-a[i][0];
vis[p-i]=1; vis[i] = 0;
if(sum>=l) break;
}
if(sum<l||sum>u) return std::vector<int>(0);
vector<int> ans;
for(int i=0; i<n; i++){
if(vis[i]==1)
ans.push_back(a[i][1]);
}
sort(ans.begin(), ans.end());
return ans;
}
/*
signed main() {
f();
long long n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> result = find_subset(l, u, w);
// BEGIN SECRET
puts("14e047d7a2907b9034950b074822b302");
// END SECRET
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}*/
/*
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<<n<<"\n";
for(auto i: x) cout<<i<<" ";
cout<<"\n";
}*/