Submission #778178

#	Time	Username	Problem	Language	Result	Execution time	Memory
778178		vjudge1	Detecting Molecules (IOI16_molecules)	C++17	69 / 100	38 ms	5716 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 8e5+37;

#include <cstdio>
#include <vector>
#include <cassert>

#include "molecules.h"

void f(){
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
}




vector<int> find_subset(int l, int u, vector<int> w) {
   	int n= w.size();
   	vector<array<int, 2>> a(n);
   	vector<int> vis(n);

   	for(int i=0; i<n; i++){
   		a[i]={w[i], i};
   	}

	sort(a.begin(), a.end());

	if(a[0][0]>u)
    return vector<int>(0);
		
	vector<array<int, 2>> pff;

	int sum=0, k=-1;
	for(int i=0; i<n&&k==-1; i++){
		if(sum+a[i][0]>=l){
			k=i;
		}
		else{
			sum+=a[i][0];
			vis[i]=1;
		}
	}	

	if(k==-1)   return std::vector<int>(0);

	if(k==0){
		vector<int> ans(1);
		ans[0]=a[0][1];
		return ans;
	}
	if(sum+a[k][0]>=l&&sum+a[k][0]<=u){
		vector<int> ans;
		for(int i=0; i<=k; i++) ans.push_back(a[i][1]);
			return ans;
	}

	int p=n-1;

	for(int i=0; i<k&&2*i<p; i++){
		sum+=a[p-i][0]-a[i][0];
		vis[p-i]=1; vis[i] = 0;
		if(sum>=l) break;		
	}

	if(sum<l||sum>u)   return std::vector<int>(0);

	vector<int> ans;

	for(int i=0; i<n; i++){
		if(vis[i]==1)
		ans.push_back(a[i][1]);
	}

	sort(ans.begin(), ans.end());
	return ans;


}

Compilation message (stderr)

molecules.cpp: In function 'void f()':
molecules.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen("in.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen("out.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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