제출 #1163102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163102		boclobanchat	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	328 KiB

molecules

#include"molecules.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l,int u,vector<int> w)
{
	if(w.size()==1)
	{
		vector<int> ans;
		if(w[0]>=l&&w[0]<=u) ans.push_back(0);
		return ans;
	}
	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);
}

컴파일 시 표준 에러 (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
      |         ^~~~

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