| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1318617 | muramasa | Detecting Molecules (IOI16_molecules) | C++20 | 81 ms | 17592 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pll> a;
for(int i = 0;i < n;i++)a.push_back({w[i],i});
sort(a.begin(),a.end());
ll sum = 0;
int lp = 0;
multiset<pll> ms;
for(int i = 0;i < n;i++){
sum += a[i].first;
ms.insert(a[i]);
while(lp < i && sum > (ll)u){
ms.erase(a[lp]);
sum -= a[lp].first;
lp++;
}
if(sum >= (ll)l && sum <= (ll)u){
vector<int> ans;
for(auto it = ms.begin();it != ms.end();it++)ans.push_back(it->second);
return ans;
}
}
return vector<int>();
}
컴파일 시 표준 에러 (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... | ||||
