Submission #718730

#	Time	Username	Problem	Language	Result	Execution time	Memory
718730		n1k	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	71 ms	6168 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
#define ll long long
using namespace std;
 
 
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<array<int, 2>> v;
	for(int i = 0; i < sz(w); i++){
		v.push_back({w[i], i});
	}
 
	sort(all(v));
	sort(all(w));
	ll ps = 0, ss = 0;
	for(int i = 0; i < sz(w); i++){
		ps += w[i];
		ss += w[sz(w) - i - 1];
		if(ps <= u && ss >= l){
			int l1 = 0, r1 = i;
			int l2 = sz(w) - i - 1, r2 = sz(w) - 1;
			set<int> ans;
			for(int j = l1; j <= r1; j++){
				ans.insert(v[j][1]);
			}
			for(int j = l1; j <= r1; j++){
				if(l <= ps && ps <= u){
					return vector(all(ans));
				}
				ps -= w[j];
				ps += w[sz(w) - j - 1];

				ans.erase(v[j][1]);
				ans.insert(v[sz(w) - j - 1][1]);
			}
			if(l <= ps && ps <= u){
				return vector<int>(all(ans));
			}
		}
	}
    return std::vector<int>(0);
}

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for(int i = 0; i < sz(w); i++){
      |                   ^
molecules.cpp:19:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i = 0; i < sz(w); i++){
      |                   ^
molecules.cpp:24:8: warning: unused variable 'l2' [-Wunused-variable]
   24 |    int l2 = sz(w) - i - 1, r2 = sz(w) - 1;
      |        ^~
molecules.cpp:24:28: warning: unused variable 'r2' [-Wunused-variable]
   24 |    int l2 = sz(w) - i - 1, r2 = sz(w) - 1;
      |                            ^~

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