제출 #265607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
265607		cjoa	Detecting Molecules (IOI16_molecules)	C++11	19 / 100	4 ms	768 KiB

molecules

#include "molecules.h"

#include <iostream>
#include <vector>
#include <bitset>
#include <cassert>

using namespace std;

typedef bitset<500001> BS;

typedef vector<int> VI;
typedef vector<VI> VVI;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
   const int N = w.size();
// assert(N <= 100 && u <= 1000);

   BS can;
   can[0] = true;
   for (int n = 0; n < N; ++n) {
   // cerr << "* n:" << n << "  w:" << w[n] << endl;
   // cerr << can[n] << endl;
   // cerr << (can[n] << w[n]) << endl;
      can |= can << w[n];
   }

   for (int sum = l; sum <= u; ++sum) {
      if (can[sum]) {
         vector<int> res;
         for (int s = sum, n = N-1; s != 0; --n) {
            assert(n >= 0);
            if (s - w[n] >= 0 && can[s - w[n]]) {
               res.push_back(n);
               s -= w[n];
            }
         }
         return res;
      }
   }

   return {};
}

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