| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1307397 | mikasa | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 376 KiB |
#include "molecules.h"
#include <map>
#include <algorithm>
#define int32_t int
using namespace std;
std::vector<int32_t> find_subset(int32_t l, int32_t u, std::vector<int32_t> w) {
vector<int> del;
long long sum=0;for (int el:w)sum+=el*1ll;
map<int,vector<int>> mp;
for (int i=0;i<w.size();++i) {
mp[w[i]].push_back(i);
}
sort(begin(w),end(w));
int cur=w.size()-1;
while(sum>u&&cur>=0) {
while(cur>=0&&sum-w[cur]<l) --cur;
if (cur<0) {break;}
del.push_back(mp[w[cur]].back()),mp[w[cur]].pop_back(),sum-=w[cur],--cur;
}
if (sum>u||sum<l) return {};
sort(begin(del),end(del));
cur=0;
vector<int32_t> res;
for (int i=0;i<w.size();++i) {
if (cur<del.size()&&i==del[cur])++cur;
else res.push_back(i);
}
return res;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
