Submission #403705

#	Time	Username	Problem	Language	Result	Execution time	Memory
403705		Pietra	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	58 ms	6172 KiB

molecules

#include<bits/stdc++.h>
#include "molecules.h"
using namespace std ; 

long long sum ; 
vector<int> ans ; 
vector<pair<int,int>> v ; 

vector<int> find_subset(int l, int u, vector<int> w){

	for(int i = 0 ; i < w.size() ; i++) v.push_back({w[i], i}) ;

	sort(v.begin(), v.end()) ; 
    
    int ini = 0, fim = 0 ; 
    
    sum = v[0].first ; 

    while(ini < v.size()){
    	
    	if(sum >= l && sum <= u) break ; 
    	
    	if(sum < l){
    		if(fim + 1 < v.size()) sum += v[++fim].first ; 
    		else break ; 
    	}
    	
    	else if(sum > l) sum -= v[ini++].first ; 

    }

    if(sum < l || sum > u) return ans ; 
    while(ini <= fim) ans.push_back(v[ini++].second) ; 
    return ans ; 

}

/*int main(){

	vector<int> h ; 
	vector<int> f = {6, 8, 8, 7} ;
	h = find_subset(15, 17, f)  ; 
	for(int i = 0 ; i < h.size() ; i++) cout << h[i] << " " ; 
		cout << "\n" ; 
}*/

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(int i = 0 ; i < w.size() ; i++) v.push_back({w[i], i}) ;
      |                  ~~^~~~~~~~~~
molecules.cpp:19:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     while(ini < v.size()){
      |           ~~~~^~~~~~~~~~
molecules.cpp:24:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |       if(fim + 1 < v.size()) sum += v[++fim].first ;
      |          ~~~~~~~~^~~~~~~~~~

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