Submission #137391

#	Time	Username	Problem	Language	Result	Execution time	Memory
137391		Hassoony	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	62 ms	5624 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
//#include "grader.cpp"

using namespace std;
typedef long long ll;
const int MX=2e5+9;
bool dp[MX];
int last[MX];
pair<int,int>a[MX];
vector<int> ans(int l,int r){
    vector<int>ret;
    for(int i=l;i<=r;i++)ret.push_back(a[i].second);
    return ret;
}
vector<int> find_subset(int l, int u, vector<int> w) {
    int n=w.size();
    for(int i=0;i<n;i++)a[i].first=w[i],a[i].second=i;
    sort(a,a+n);
    int p1=0,p2=0;
    ll sum=0;
    while(p1<n&&p2<n){
        while(sum<l&&p2<n){
            sum+=a[p2++].first;
        }
//        cout<<p1<<" "<<p2<<" "<<sum<<endl;
        if(sum>=l&&sum<=u){
            return ans(p1,p2-1);
        }
        while(sum>u&&p1<n){
            sum-=a[p1++].first;
        }
        if(sum>=l&&sum<=u){
            return ans(p1,p2-1);
        }
    }
    vector<int>anss;
    return anss;
}

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