| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1284684 | Rares | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB | 
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("date.in");
ofstream fout ("date.out");
#define cin fin
#define cout fout
vector <int> rez,a;
int s,n;
vector <pair <int,int>> p;
vector <int> find_subset (int l, int r, vector <int> v){
    n=v.size ();
    for (int i=0;i<n;++i){
        p.push_back ({v[i],i});
    }
    sort (p.begin (),p.end ());
    sort (v.begin (),v.end ());
    for (int i=n-1;i>=0;--i){
        if (s+v[i]>=l and s+v[i]<=r){
            a.push_back (p[i].second);
            s+=v[i];
            break;
        }
        if (s+v[i]+v[0]>r) continue;
        a.push_back (p[i].second);
        s+=v[i];
    }
    if (s>=l and s<=r) return a;
    a.clear ();
    return rez;
}
컴파일 시 표준 에러 (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... | ||||
