Submission #1102202

#TimeUsernameProblemLanguageResultExecution timeMemory
1102202akzytrDetecting Molecules (IOI16_molecules)C++17
100 / 100
132 ms27468 KiB
// #include "molecules.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { ll p = 0; vector<int> result; int n = w.size(); pair<int, int> w2[n]; for(int i = 0; i < n; i++) { w2[i].first = w[i]; w2[i].second = i; } sort(w2, w2 + n); set<ll> pss; map<ll, int> psjn; psjn[0] = -1; pss.insert(0); for(int i = 0; i < w.size(); i++) { p += w2[i].first; auto lb = pss.lower_bound(p - u); if(lb == pss.end()) { lb--; } if(lb != pss.end() && p - *lb >= l && p - *lb <= u) { for(int j = psjn[*lb] + 1; j <= i; j++) { result.push_back(w2[j].second); } break; } pss.insert(p); psjn[p] = i; } return result; }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:22:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for(int 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...