Submission #784941

#TimeUsernameProblemLanguageResultExecution timeMemory
784941BoasDetecting Molecules (IOI16_molecules)C++17
0 / 100
4 ms8492 KiB
#include "molecules.h" using namespace std; #include <bits/stdc++.h> #define MAX_N 200001 typedef vector<int> vi; vi find_subset(int l, int u, vi w) { unordered_map<int, int> lastAddition; unordered_multimap<int, bitset<MAX_N>> possible = {{0, {}}}; for (int inx = 0; inx < w.size(); inx++) { int i = w[inx]; for (const auto &[p, used] : possible) { if (used[inx]) continue; int n = i + p; if (n > u) continue; lastAddition[n] = inx; if (n >= l && n <= u) { vi solution = {inx}; int weightRemaining = p; while (weightRemaining > 0) { solution.push_back(lastAddition[weightRemaining]); weightRemaining -= w[lastAddition[weightRemaining]]; } return solution; } bitset<MAX_N> newUsed(used); newUsed[inx] = true; possible.insert({n, newUsed}); } } return vi(0); }

Compilation message (stderr)

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:16:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int inx = 0; inx < w.size(); inx++)
      |                       ~~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...