| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1284695 | Rares | Detecting Molecules (IOI16_molecules) | C++20 | 46 ms | 4132 KiB | 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <int> rez;
ll s,n;
vector <pair <int,int>> p;
vector <int> a;
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 ());
    int j=0;
    for (int i=0;i<n;++i){
        s+=v[i];
        while (j<=i and s>r){
            s-=v[j];
            j++;
        }
        if (s>=l){
            for (int k=j;k<=i;++k){
                a.push_back (p[k].second);
            }
            return a;
        }
    }
    return a;
}
컴파일 시 표준 에러 (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... | ||||
