Submission #1370711

#TimeUsernameProblemLanguageResultExecution timeMemory
1370711n.bahizi_dylanDetecting Molecules (IOI16_molecules)C++20
100 / 100
27 ms5288 KiB
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> pii;
v<int> find_subset(int l, int u, v<int> we) {
    int n = we.size();
    int rr = 0;
    ll su = 0;
    v<int> re;
    v<pii> ite(n);
    for(int i = 0; i < n;i++) {
        ite[i] = {we[i], i};
    }
    sort(ite.begin(), ite.end());
    for(int i = 0; i < n; i++) {
     su += ite[i].first;
     while(su > u) {
        su -= ite[rr].first;
        rr++;
     }
     if(su >= l && su <= u) {
         for(int j = rr; j <= i; j++) {
        re.pb(ite[j].second); 
         }
         return re;
     }
        }
  return{};
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...