제출 #265600

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

molecules

#include "molecules.h"

#include <iostream>
#include <vector>
#include <map>
#include <cassert>

using namespace std;

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);

   VI can(u+1);
   VI P(u+1, -1);
   can[0] = true;
   for (int n = 0; n < N; ++n) {
      VI new_can(u+1);
      for (int sum = 0; sum <= u; ++sum) {
         if ( can[sum] ) {
            new_can[sum] = true;
            if (sum + w[n] <= u) {
               new_can[sum + w[n]] = true;
               P[sum + w[n]] = n;
            }
         }
      }
      can = new_can;
   }

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

   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