Submission #1354600

#TimeUsernameProblemLanguageResultExecution timeMemory
1354600takoshanavaDetecting Molecules (IOI16_molecules)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
#include "molecules.h"
#define pb push_back
#define fs first
#define sc second
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int, int>> p;
    for(int i = 0; i < w.size(); i++) p.pb({w[i], i}); 
    sort(p.begin(), p.end());
    int l1 = 0, r = 0; 
    long long sum = 0;
    bool ok = 0;
    int n = w.size();
    while(r < n){
        if(sum >= l and sum <= u){ok = 1; break;}
        if(sum < l) r++, sum += p[r].fs;
        if(sum > u) sum -= p[l1].sc, l1++;
    }
    vector<int> ans;
    if(!ok) return ans;
    for(int i = l1; i < r; i++) ans.pb(p[i].sc);
    return ans; 
}
#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...