Submission #69344

#	Time	Username	Problem	Language	Result	Execution time	Memory
69344		hamzqq9	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	80 ms	31660 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define umax(x,y) x=max(x,y)
#define umin(x,y) x=min(x,y)
#define ll long long
#define ii pair<int,int>
#define iii pair<int,ii>
#define sz(x) ((int) x.size())
#define orta ((bas+son)>>1)
#define all(x) x.begin(),x.end()
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define pw(x) (1<<(x))
#define inf 2000000000
#define MOD 1000000007
#define N 755
#define MAX 10000006
#define LOG 30
#define KOK 200
using namespace std;

vector<int> found(int bas,int son,vector<ii>& now) {

	vector<int> res;

	for(int i=bas;i<=son;i++) res.pb(now[i].nd);

	sort(all(res));

	return res;

}

vector<int> find_subset(int l, int u, std::vector<int> w) {

	vector<ii> v2;

	for(int i=0;i<sz(w);i++) {

		v2.pb({w[i],i});

	}

	sort(all(v2));

	ll sum=0;

	int bas=0;

	for(int i=0;i<sz(v2);i++) {

		sum+=v2[i].st;

		while(sum>u) {

			sum-=v2[bas++].st;

		}

		if(sum>=l && sum<=u) {

			return found(bas,i,v2);

		}

	}

	vector<int> res;

	return res;

}

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