# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851567 | askow | Detecting Molecules (IOI16_molecules) | C++14 | 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>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n=w.size();
set<int>s;
for(int i=0;i<n;i++)s.insert(w[i]);
if(n<=100&&s.size()==1){
int pref[n];
pref[0]=a[0];
for(int i=1;i<n;i++)pref[i]=pref[i-1]+w[i];
vector<int>ans;
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
int C=-1;
if(i==0)C=pref[j];
else C=pref[j]-pref[i-1];
if(C>=l&&C<=u){
for(int k=i;k<=j;k++)ans.push_back(k);
return ans;
}
}
}
return {};
}
}/*
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,u,v;
cin>>n>>u>>v;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
for(auto it:find_subset(u,v,a))cout<<it<<" ";
}*/