제출 #872698

#제출 시각아이디문제언어결과실행 시간메모리
872698LucaLucaMDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms428 KiB
#include "molecules.h" #ifdef LOCAL #include "grader.cpp" #endif #include <vector> #include <cassert> #include <algorithm> typedef long long ll; std::vector<int> find_subset(int l, int u, std::vector<int> w) { int n = (int) w.size(); std::vector<std::pair<int, int>> a(n); for (int i = 0; i < n; i++) { a[i] = {w[i], i}; } std::sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { std::vector<int> ret; ll s = 0; for (int j = i; j < n; j++) { ret.push_back(j); s += a[j].first; if (l <= s && s <= u) { return ret; } } } return {}; } /** 4 15 17 6 8 8 7 **/
#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...