제출 #867491

#제출 시각아이디문제언어결과실행 시간메모리
867491lolismekDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms348 KiB
#include "molecules.h" #include <algorithm> #include <iostream> #include <queue> #include <cassert> using namespace std; vector<int> find_subset(int l, int u, vector<int> w){ queue <int> dq; long long sum = 0; sort(w.begin(), w.end()); for(int i = 0; i < (int)w.size(); i++){ sum += w[i]; dq.push(i); while(!dq.empty() && sum > u){ sum -= w[dq.front()]; dq.pop(); } if(l <= sum && sum <= u){ vector <int> ans; int tmp = 0; while(!dq.empty()){ ans.push_back(dq.front()); tmp += w[dq.front()]; dq.pop(); } assert(tmp == sum); return ans; } } 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...