Submission #780671

#TimeUsernameProblemLanguageResultExecution timeMemory
780671JoenPoenManDetecting Molecules (IOI16_molecules)C++17
69 / 100
1080 ms3584 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define ALL(arr) begin(arr), end(arr) typedef pair<int, int> ii; std::vector<int> find_subset(int l, int u, std::vector<int> w) { vector<bool> subset(w.size(), false); vector<ii> sw; for (int i = 0; i < w.size(); i++) { sw.push_back({w[i], i}); } sort(ALL(sw)); int sum = 0; for (int attempts = 2*w.size(); attempts >= 0; attempts--) { if (sum < l) { bool suc = false; if (sw.back().first + sum >= l) for (auto [weight, ind] : sw) if (!subset[ind]) { if (sum + weight >= l) { subset[ind] = true; sum += weight; suc = true; break; } } if (!suc) { for (int i = 0; i < sw.size(); i++) if (!subset[sw[i].second]) { auto [weight, ind] = sw[i]; subset[ind] = true; sum += weight; suc = true; break; } } if (!suc) break; } else if (sum > u) { bool suc = false; if (sum - sw.back().first <= u) for (int i = 0; i < sw.size(); i++) if (subset[sw[i].second]) { if (sum - sw[i].first <= u) { auto [weight, ind] = sw[i]; sw.erase(sw.begin()+i); subset[ind] = false; sum -= weight; suc = true; break; } } if (!suc) { for (int i = 0; i < sw.size(); i++) if (subset[sw[i].second]) { auto [weight, ind] = sw[i]; sw.erase(sw.begin()+i); subset[ind] = false; sum -= weight; break; } } } else { vector<int> res; for (int n = 0; n < subset.size(); n++) if (subset[n]) res.push_back(n); return res; } } return std::vector<int>(0); }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i = 0; i < w.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:30:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |                 for (int i = 0; i < sw.size(); i++) if (!subset[sw[i].second]) {
      |                                 ~~^~~~~~~~~~~
molecules.cpp:41:63: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             if (sum - sw.back().first <= u) for (int i = 0; i < sw.size(); i++) if (subset[sw[i].second]) {
      |                                                             ~~^~~~~~~~~~~
molecules.cpp:52:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |                 for (int i = 0; i < sw.size(); i++) if (subset[sw[i].second]) {
      |                                 ~~^~~~~~~~~~~
molecules.cpp:62:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for (int n = 0; n < subset.size(); n++) if (subset[n]) res.push_back(n);
      |                             ~~^~~~~~~~~~~~~~~
#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...