Submission #1330203

#TimeUsernameProblemLanguageResultExecution timeMemory
1330203Francisco_MartinDetecting Molecules (IOI16_molecules)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;

vector<int> find_subset(int l,int u,vector<int> W){
    int n=W.size(); long long cur=0;
    vector<pair<int,int>> A(n);
    for(int i=0; i<n; i++) A[i]={W[i],i+1};
    sort(A.begin(),A.end());
    int a=0, b=0;
    while(a<n){
        while(b<n && cur<l) cur+=A[b].first, b++;
        if(l<=cur && cur<=u){
            vector<int> ans;
            for(int i=a; i<b; i++) ans.push_back(A[i].second);
            return ans; 
        }
        cur-=A[a].first; a++;
        if(b==a) cur+=A[a].first, b=a; 
    }
    return vector<int>{};
}
#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...