# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1191685 | simona1230 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
bool dp[10000][10001];
bool in[10000][10001];
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
dp[0][0]=1;
dp[0][w[0]]=2;
for(int i=1;i<w.size();i++)
{
for(int j=0;j<=u;j++)
{
if(dp[i-1][j])dp[i][j]=1;
else if(j>=w[i]&&dp[i-1][j-w[i]])dp[i][j]=1,in[i][j]=1;
}
}
vector<int> ans;
for(int i=l;i<=u;i++)
{
if(dp[w.size()-1][i]==0)continue;
int s=i;
for(int j=w.size()-1;j>=0;j--)
{
if(in[j][s])
{
s-=w[j];
ans.push_back(j);
}
}
sort(ans.begin(),ans.end());
return ans;
}
return ans;
}
컴파일 시 표준 에러 (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... |