Submission #1163101

#TimeUsernameProblemLanguageResultExecution timeMemory
1163101boclobanchatDetecting Molecules (IOI16_molecules)C++20
0 / 100
0 ms324 KiB
#include"molecules.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
	int idx=0;
	vector< pair<int,int> > x;
	for(auto v:w) x.push_back({v,idx++});
	sort(w.begin(),w.end());
	sort(x.begin(),x.end());
	int sum=0;
	for(int i=0;i<w.size()-1;i++)
	{
		sum+=w[i];
		if(sum>=l&&sum<=u)
		{
			vector<int> ans;
			for(int j=0;j<=i;j++) ans.push_back(x[j].second);
			sort(ans.begin(),ans.end());
			return ans;
		}
		if(sum-w[0]>=l&&sum-w[0]<=u)
		{
			vector<int> ans;
			for(int j=1;j<=i;j++) ans.push_back(x[j].second);
			sort(ans.begin(),ans.end());
			return ans;
		}
		if(sum-w[0]+w[w.size()-1]>=l&&sum-w[0]+w[w.size()-1]<=u)
		{
			vector<int> ans;
			for(int j=1;j<=i;j++) ans.push_back(x[j].second);
			ans.push_back(x[w.size()-1].second);
			sort(ans.begin(),ans.end());
			return ans;
		}
		if(sum+w[w.size()-1]>=l&&sum+w[w.size()-1]<=u)
		{
			vector<int> ans;
			for(int j=0;j<=i;j++) ans.push_back(x[j].second);
			ans.push_back(x[w.size()-1].second);
			sort(ans.begin(),ans.end());
			return ans;
		}
	}
	return vector<int>(0);
}

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#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...