Submission #774578

#	Time	Username	Problem	Language	Result	Execution time	Memory
774578		Matblube	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	37 ms	5580 KiB

molecules

#include "molecules.h"
#include <iostream>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
using namespace std;
#define fr(i, x) for(ll i=0 ; i<x ; i++)
#define fra(x, v) for(auto x:v)
#define fra1(x, v) for(auto &x:v)
#define all(v) v.begin(), v.end()

vector<int> find_subset(int l, int u, vector<int> w){
    int n=w.size();
    vector<pair<int, int>>v(n);
    vector<int>ans;
    int pos=0;
    fra(x, w){
        v[pos].first=x;
        v[pos].second=pos;
        pos++;
    }
    sort(all(v));
    int i=-1, j=-1;
    ll cc=0;
    while(1){
        if(cc<l){
            j++;
            if(j>=n) break;
            cc+=v[j].first;
        }else if(cc>u){
            i++;
            if(i>=j) break;
            cc-=v[i].first;
        }else{
            for(ll a=i+1 ; a<=j ; a++){
                ans.push_back(v[a].second);
            }
            return ans;
        }
    }
    return 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