제출 #949815

#제출 시각아이디문제언어결과실행 시간메모리
949815Rainmaker2627Detecting Molecules (IOI16_molecules)C++17
100 / 100
40 ms5320 KiB
#include "molecules.h" #include<bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { long long s=0, lo=0, hi=0, n=w.size(); vector<pair<int, int>> t; vector<int> ans(0); for (int i = 0; i < n; ++i) t.emplace_back(w[i], i); sort(t.begin(), t.end()); while (lo<n) { if (s<l) { if (hi<n) s+=t[hi++].first; else break; } else if (s>u && lo<n) s-=t[lo++].first; if (l<=s && s<=u) { for (int i = lo; i < hi; ++i) ans.push_back(t[i].second); break; } } return ans; }
#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...