| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1293065 | trandaihao5555 | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 348 KiB |
#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<long long,int>> a;
int n = w.size();
a.resize(n);
for (int i=0;i<n;i++) a[i] = make_pair(w[i],i);
sort(a.begin(),a.end());
for (int i=1;i<n;i++) a[i].first += a[i-1].first;
vector<int> res;
if (l <= a[n-1].first && a[n-1].first <= u) {
for (int i=0;i<n;i++) res.push_back(i);
return res;
}
for (int i=1,j=-1;i<n;i++) {
while (j < i - 1 && a[n-1].first - a[i-1].first + a[j+1].first <= u) j++;
int tmp = 0;
if (j >= 0) tmp += a[j].first;
tmp += a[n-1].first - a[i-1].first;
if (l <= tmp && tmp <= u) {
for (int k=0;k<n;k++) if (k <= j || i <= k) res.push_back(a[k].second);
sort(res.begin(),res.end());
return res;
}
}
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... | ||||
