| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1209990 | anfi | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4132 KiB | 
#include"molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
vector<int> find_subset(int l, int u, vector<int> a){
    int n = a.size();
    vector<pair<int,int>> wawi;
    for(int i = 0; i < n; i++) wawi.push_back({a[i], i});
    sort(wawi.begin(), wawi.end());
    long long ll = 0, rr = 0,sum = 0;
    while(ll < n){
        while(rr < n && sum < l) sum += wawi[rr++].fi;
        if(l <= sum && sum <= u){
            vector<int> ans;
            for(int i = ll; i < rr; i++) ans.push_back(wawi[i].se);
            return ans;
        }
        sum -= wawi[ll++].fi;
        if(l <= sum && sum <= u){
            vector<int> ans;
            for(int i = ll; i < rr; i++) ans.push_back(wawi[i].se);
            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... | ||||
