# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1172284 | tamir1 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 324 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> x;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> ans={};
int n=w.size(),m=0,k,p,y=0;
long long sum=0;
for(int i=0;i<n;i++){
sum+=w[i];
x.push_back({w[i],i});
}
if(sum<l) return {};
sort(w.begin(),w.end());
sort(x.begin(),x.end());
sum=0;
for(int i=0;i<n;i++){
if(sum+w[i]>u) break;
sum+=w[i];
m=i;
}
if(m==0) return {};
k=n-1;
p=0;
for(int i = m; i < n; i++) {
if(sum >= l && sum <= u) {
for(int j = i - m; j <= i; j++) {
ans.push_back(x[j].second);
}
return ans;
}
}
return {};
}
컴파일 시 표준 에러 (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... |