# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238595 | rahul_a_n | Detecting Molecules (IOI16_molecules) | C++14 | 67 ms | 6256 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;
#define ll long long int
#define pb(x) push_back(x)
#define PI pair<int,int>
#define PL pair<long int,long int>
#define PLL pair<ll,ll>
#define Tcase int t;cin>>t;while(t--)
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define MAXN 200005
#define F first
#define S second
vector<int> find_subset(int l,int r,vector<int> a){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n=(int)a.size();
vector<pair<int,int> >v;
vector<int>ans;
for(int i=0;i<n;i++)
v.pb(make_pair(a[i],i));
sort(all(v));
ll curr=0;int L=0,R=-1;
while(L<n && R<n){
if(curr>r){
curr-=v[L].F;L++;
}
else if(curr<l){
R++;
curr+=v[R].F;
}
else{
for(int i=L;i<=R;i++)
ans.pb(v[i].S);
return ans;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |