# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1225976 | edga1 | Detecting Molecules (IOI16_molecules) | C++20 | 29 ms | 14408 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace::std;
vector<int> dp[10005];
int s[10005];
vector<int> find_subset(int l, int u, vector<int> w){
int n=w.size();
int ma=0;
for(int i=0; i<n; i++){
if(w[i]>=l && w[i]<=u) return vector<int> (1,i);
if(w[i]<l) ma=1;
}
if(ma==0) return vector<int> (0);
for(int i=0; i<l; i++){
dp[i]=vector<int>(0);
}
set<int> sums,ne;
sums.insert(0);
for(int i=0; i<n; i++){
for(auto a:ne) sums.insert(a);
ne.clear();
for(auto a:sums){
//cout<<i<<' '<<a<<'\n';
int sum=a+w[i];
if(sum>=l && sum<=u){
vector<int> r=dp[a];
r.push_back(i);
return r;
}
if(sum<l && !s[sum]){
s[sum]=1;
vector<int> r=dp[a];
r.push_back(i);
dp[sum]=r;
ne.insert(sum);
}
}
}
return 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... |