Submission #875701

#TimeUsernameProblemLanguageResultExecution timeMemory
875701Elvin_FritlDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e5 + 545 , inf = 1e9 + 199;

#include "molecules.h"

vector<int> find_subset(int left, int right, vector<int> a){
    int n = a.size();
    int l = 0 , r = 0;
    ll sum = 0;
    sort(a.begin() , a.end());
    vector<int> res;
    for(int i=0;i<n;i++) {
		if(r < n && sum < left){
			 sum += a[r++];
		 }
		 else if(sum > right) {
			 sum -= a[l++];
		 }
		 else{
			 break;
		 }
	 }
	 if(sum < left || sum > right) {
		 return res;
	 }
	 for(int i=l;i<r;i++){
		 res.push_back(i);
	 }
	 return res;
}
#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...