# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1148862 | kvintsekstakord | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 6828 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int64_t, int>> a;
for(int i = 0; i < w.size(); i++){
a.push_back({w[i], i});
}
sort(a.begin(), a.end());
vector<int64_t> pref(w.size()+1);
pref[0]=0;
for(int i = 0; i < w.size(); i++) pref[i+1]=pref[i]+a[i].first;
for(int k = 1; k <= w.size(); k++){
if(pref[k]>u || pref[w.size()]-pref[w.size()-k]<l) continue;
vector<int> ans;
int start = -1;
for(int i = k; i <= w.size(); i++){
if(pref[i]-pref[i-k]<=u && pref[i]-pref[i-k]>=l ){
start = i;
}
}
if(start==-1) continue;
for(int i = start; i > start-k; i--){
ans.push_back(a[i-1].second);
}
return ans;
}
return std::vector<int>(0);
}
컴파일 시 표준 에러 (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... |