Submission #589829

#	Time	Username	Problem	Language	Result	Execution time	Memory
589829		Sam_a17	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	340 KiB

molecules

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "molecules.h"
#include <cstdio>
using namespace std;
#define ll long long

const int N = 1e4 + 10;

int n;
bool dp[N];
bitset<N> bit[N]; 

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

  vector<int> possible{0};
  vector<int> answ;
  dp[0] = true;


  for(int i = 0; i < n; i++) {
    vector<int> to_add;

    for(auto j: possible) {
      if(j + w[i] > u) {
        continue;
      }
      to_add.push_back(j);
    } 

    for(auto j: to_add) {
      bit[j + w[i]] = bit[j];
      bit[j + w[i]][i] = 1;
      if(j + w[i] >= l && j + w[i] <= u) {
        for(int k = 0; k < n; k++) {
          if(bit[j + w[i]][k]) {
            answ.push_back(k + 1);
          }
        }
        break;
      }
      possible.push_back(j + w[i]);
      dp[j + w[i]] = true;
    }

    if(!answ.empty()) {
      break;
    }

    sort(possible.rbegin(), possible.rend());
  }
  
  return answ;
}

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