Submission #411312

#TimeUsernameProblemLanguageResultExecution timeMemory
411312hibye1217Detecting Molecules (IOI16_molecules)C++17
9 / 100
2 ms272 KiB
#include "molecules.h" #include <vector> #include <algorithm> #include <iostream> using ll = long long; std::vector<int> find_subset(int l, int u, std::vector<int> w) { sort(w.begin(), w.end()); std::vector<int> emp; int n = w.size(); ll sum = 0, mn = 1e15; for (ll x : w){ sum += x; mn = std::min(mn, x); } if (u < mn || sum < l){ return emp; } int st = 0, ed = 0; sum = w[0]; while (1){ //std::cout << "CHK " << st << ' ' << ed << ' ' << sum << std::endl; if (l <= sum && sum <= u){ std::vector<int> res; for (int i = st; i <= ed; i++){ res.push_back(i); } return res; } if (sum < l){ if (ed+1 == n){ break; } ed += 1; sum += w[ed]; } else{ if (st+1 > ed){ break; } sum -= w[st]; st += 1; } } return emp; }
#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...