#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define Mor_Te ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define intt long long
#define ll long long
#define pb push_back
#define all(v) v.begin() , v.end()
#define rall(v) v.rbegin() , v.rend()
#define F first
#define S second
#define szz(x) ((int)(x).size())
#define pii pair<intt , intt>
using namespace std;
using namespace __gnu_pbds;
const intt sz = 1e6 + 5;
const intt INF = 1e18;
const intt MOD = 998244353;
vector<int> find_subset(int l , int u , vector<int> w){
int n = w.size();
vector<pii> a;
for(int i = 0; i < n; i++){
a[i].F = w[i];
a[i].S = i;
}
sort(all(a));
int sum = 0;
vector<int> v;
int i1;
for(int i = n - 1; i >= 0; i--){
if(sum > l) break;
sum += w[i];
v.pb(i);
i1 = i;
}
for(int i = 0 , j = 0; i < i1; i++ , j++){
if(j >= v.size()) break;
if(sum >= l and sum <= u) break;
sum -= a[v[j]].F;
v[j] = i;
sum += a[i].F;
}
if(sum >= l and sum <= u){
for(auto x: v) x = a[x].S;
return v;
}
v.clear();
return v;
}
// void Yusiff(){
// int n , k; cin >> n >> k;
// int a[n];
// for(int i = 0; i < n; i++){
// cin >> a[i];
// }
// vector<intt> v;
// if(n <= k){
// cout << n << '\n'; return;
// } else{
// for(int i = 1; i < n; i++){
// v.pb(a[i] - a[i - 1]);
// }
// sort(all(v));
// int m = n - k;
// intt ans = 0;
// for(int i = 0; i < m; i++){
// ans += v[i];
// }
// cout << n + ans - (n - k) << '\n'; return;
// }
// }
// signed main(){
// Mor_Te
// int t = 1;
// //cin >> t;
// for(intt i = 1; i <= t; i++){
// Mor_Te
// Yusiff();
// }
// }
// /* BY Yusif Nazarli */
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... |