//*** Bismillah ***//
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
#include "molecules.h"
ll l, r, lf, rt, cm;
pll v[maxn];
std::vector<int> find_subset(int _l, int _r, std::vector<int>a){
n = len(a), l = _l, r = _r;
for(ll i = 0; i < n; i ++) v[i] = {a[i], i};
sort(v, v + n);
lf = rt = cm = 0;
while(rt < n){
cm += v[rt].fr;
while(cm > r){
cm -= v[lf].fr;
lf ++;
}
if(l <= cm and cm <= r){
vector<int> cv;
for(ll i = lf; i <= rt; i ++){
cv.pb(v[i].sc);
}
return cv;
}
rt ++;
}
return {};
}
// void _(ll tt){
// }
// signed main(){
// ll tm=clock();
// cin.tie(0)->sync_with_stdio(0);
// ll t=1;
// cin>>t;
// for(ll tt=1;tt<=t;tt++){
// _(tt);
// }
// cerr<<"\n\033[1;31mTime: \033[1;30m" \
// <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n";
// }
Compilation message (stderr)
molecules.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
# | 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... |