# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216648 | 2fat2code | 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>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
const int mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;
vector<int> find_subset(int l,int u,vector<int>w){
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
srand(chrono::steady_clock::now().time_since_epoch().count());
vector<pair<int,int>>a;
for(int i=0;i<w.size();i++) a.push_back({w[i],i});
sort(all(a));
int sum=0,le=0;
int n=w.size()-1;
while(le<=n && sum+a[le].fr<=l){
sum+=a[le].fr;
le++;
}
vector<int>ans;
int r=-1;
while(le<n){
if(sum>=u){
for(int i=r+1;i<=le;i++){
ans.push_back(a[i].sc);
}
return ans;
}
le++;
sum+=a[le].fr;
r++;
sum-=a[r].fr;
}
if(sum>=u){
for(int i=r+1;i<=le;i++){
ans.push_back(a[i].sc);
}
return ans;
}
ans.push_back(0);
return ans;
}