Submission #867486

#TimeUsernameProblemLanguageResultExecution timeMemory
867486lolismekDetecting Molecules (IOI16_molecules)C++14
19 / 100
1 ms444 KiB
#include "molecules.h"

#include <iostream>
#include <deque>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w){
    deque <int> dq;
    long long sum = 0;

    for(int i = 0; i < (int)w.size(); i++){
        sum += w[i];
        dq.push_back(i);
        while(!dq.empty() && sum > u){
            sum -= w[dq.front()];
            dq.pop_front();
        }

        if(l <= sum && sum <= u){
            vector <int> ans;
            while(!dq.empty()){
                ans.push_back(dq.front());
                dq.pop_front();
            }
            return ans;
        }
    }

    return {};
}

/*
4 15 17
6 8 8 7
*/

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...