Submission #680358

#TimeUsernameProblemLanguageResultExecution timeMemory
680358Nahian9696Detecting Molecules (IOI16_molecules)C++17
0 / 100
1 ms300 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define f0(i, n) for(int i = 0; i < n; i++) #define f1(i, n) for(int i = 1; i <= n; i++) std::vector<int> find_subset(int l, int u, std::vector<int> w) { sort(w.begin(), w.end()); long long sum = 0, n = w.size(); vector<int> ans; for (long long i = 0; i < w.size(); i++) { if (sum + w[i] <= u) { sum += w[i]; ans.push_back(i); } else { if(sum >= l) { return ans; } else { int nn = ans.size(); f1(i, nn) { sum -= w[nn - i]; sum += w[n - i]; ans[nn - i] = n - i; if(sum >= l) { return ans; } } return vector<int>(0); } break; } } return ans; }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for (long long i = 0; i < w.size(); i++) {
      |                           ~~^~~~~~~~~~
#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...