Submission #1337456

#	Time	Username	Problem	Language	Result	Execution time	Memory
1337456		hyyh	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	34 ms	4124 KiB

molecules

#include "molecules.h"
#include <vector>
#include <deque>
#include <iostream>
#include <algorithm>

using namespace std;
using pii = pair<int,int>;
using ll = long long;

#define endl '\n'
#define f first
#define s second
#define all(x) begin(x),end(x)


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int p1 = 0;
    int p2 = 0;
    ll sum = 0;
    vector<pii> vc;
    int N = w.size();
    for(int i{};i < N;i++){
        vc.emplace_back(w[i],i);
    }
    sort(all(vc));
    while(p2 < vc.size()){
        sum += vc[p2].f;
        while(sum > u) sum -= vc[p1].f,p1++;
        if(sum >= l){
            vector<int> ans;
            for(int i{p1};i <= p2;i++){
                ans.emplace_back(vc[i].s);
            }
            return ans;
        }
        p2++;
    }
    return std::vector<int>(0);
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31