Submission #288365

#	Time	Username	Problem	Language	Result	Execution time	Memory
288365		Ruba_K	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	288 KiB

molecules

#include "molecules.h"

#include<bits/stdc++.h>

using namespace std ;

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

    int n = w.size() ;

    map<int , vector<int> > pos ;

    for(int i = 0 ; i < n ; i ++){

        pos[w[i]].push_back(i);

    }
     int firstn , secondn ;

     firstn = pos.begin()->first , secondn = pos.end()->first ;

     int cnt1 , cnt2 ;
     if(firstn == secondn)
            cnt2 = secondn = 0 ;
     cnt1 = pos[firstn].size() ;
     cnt2 = pos[secondn].size();



     for(int i = 0 ; i <= cnt1 ; i ++ ){

        long long sum = i * firstn ;

        for(int j = 0 ; j <= cnt2 ; j ++){
            sum += (j * secondn);

            if(sum >= l && sum <= u){
                vector<int>ans ;

                for(int c = 0 ; c < j ; c ++){
                    ans.push_back(pos[firstn][c]);
                }
                for(int c = 0 ; c < j ; c ++){
                    ans.push_back(pos[secondn][c]);
                }
                return ans ;
            }
        }
     }


    return vector<int>() ;
}

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