Submission #1363888

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

molecules

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

using ll = long long;
using pi = pair<int, int>;

vector<int> find_subset(int l, int u, vector<int> w){
   int n = (int)w.size();
   vector<pi> p(n);
   for(int i = 0; i < n; i++){
      p[i].first = w[i], p[i].second = i;
   }
   sort(p.begin(), p.end());
   ll sum = 0;
   vector<int> idx;
   for(int i = 0, j = 0; i < n; i++){
      while(sum < l && j < n){
         sum += p[j].first;
         j++;
      }
      if(sum >= l && sum <= u){
         for(int k = i; k < j; k++){
            idx.push_back(p[j].second);
         }
         break;
      }
      sum -= p[i].first;
   }
   return idx;
}

//int main(){
//	ios::sync_with_stdio(0);
//	cin.tie(0);
//	
//}

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