Submission #651352

#	Time	Username	Problem	Language	Result	Execution time	Memory
651352		pauloamed	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	308 KiB

molecules

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

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

  vector<pair<int,int>> W;
  for(int i = 0; i < n; ++i){
    W.push_back({w[i], i});
  }
  sort(W.begin(), W.end());

  vector<int> ans;
  for(int i = 0; i < n; ++i){
    int mini = W[i].first;
    int id_mini = W[i].second;

    int maxi = W.back().first;
    int id_maxi = W.back().second;

    if(mini > u) return {};
    else if(mini >= l){
      ans.push_back(id_mini);
      return ans;
    }else{
      // mini ta a esquerda
      // maxi ta dentro ou a esquerda
      assert(maxi <= u);
      ans.push_back(id_maxi);
      if(maxi >= l){ // maxi ta dentro
        return ans;
      }else{ // maxi ta a esquerda
        l -= maxi;
        u -= maxi;
      }
    }
  }


  if(0 >= l && 0 <= u) return ans;
  else return {};
}

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