| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 290783 | REALITYNB | 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 all(a) a.begin(),a.end()
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
using namespace std;
vector<int> find_subset(int l , int r , vector<int> a){
vector<pii> w(n) ;
for(int i=0;i<n;i++){
w[i].F=a[i] ;
w[i].S =i ;
}
sort(all(w)) ;
for(int i=1;i<n;i++) w[i].F+=w[i-1].F ;
for(int i=x-1;i<n;i++){
int L =i-x ;
if(L==-1) sum = 0 ;
else sum= w[L].S ;
if(r>=w[i].F-sum&&w[i].F-sum>=L){
vector<int> ans ;
for(int j=i-x+1;j<=i;j++) ans.push_back(w[j].S) ;
return ans ;
}
}
vector<int> poop ;
return poop ;
}
