제출 #611074

#제출 시각아이디문제언어결과실행 시간메모리
611074TemmieDetecting Molecules (IOI16_molecules)C++17
100 / 100
43 ms5584 KiB
#include <bits/stdc++.h> std::vector <int> find_subset(int f, int u, std::vector <int> w) { int n = 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()); long long sum = 0; for (int l = 0, r = 0; r < n; r++) { sum += a[r].first; while (l <= r && sum > u) { sum -= a[l++].first; } if (l > r) { break; } if (sum >= f && sum <= u) { std::vector <int> ans; for (int j = l; j <= r; j++) { ans.push_back(a[j].second); } return ans; } } return { }; }
#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...