Submission #1354629

#	Time	Username	Problem	Language	Result	Execution time	Memory
1354629		nini_gvenetadze	Detecting Molecules (IOI16_molecules)	C++20	9 / 100	0 ms	344 KiB

molecules

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

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

{
    int n=w.size();
    vector<pair<int, int>> vec(n);
      for(int i=0; i<n; i++)
      {
        vec[i].first=w[i];
        vec[i].second=i;
      }
      sort(vec.begin(), vec.end());
      vector<int> vec2;
      long long int sum=0;
     
      //vector
      for(int i=0; i<n; i++)
      {
         sum+=vec[i].first;
         
         if(sum>=l)
         {
            if(sum<=u){
                for(int k=0; k<=i; k++){
                vec2.push_back(vec[k].second);}
             }
             return vec2;}
            if(sum>u)
            {   
                long long p=0;
            
              while(sum>u && p<n)
              {
                
                    sum-=vec[p].first;
                    p++;
                
              }
              if(sum>=l && sum<=u)
              {
                 for(int k=p; k<n; k++)
                 {
                    vec2.push_back(vec[k].second);
                 }
                 return vec2;
              }
                
               
            }

         }
         return vec2;
      }  

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