| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1264285 | liangjeremy | Detecting Molecules (IOI16_molecules) | C++20 | 1093 ms | 6212 KiB | 
#include<bits/stdc++.h>
#define fi first
#define se second
//#define int long long
using namespace std;
using db=double;
using ll=int64_t;
using sll=__int128;
using lb=long double;
vector<int>find_subset(int l, int r, vector<int>w){
	vector<int>dp(r+1,-1); vector<int>pre(r+1,-1); vector<int>v(r+1); dp[0]=1; pre[0]=0; 
	for(int i=0; i<w.size(); i++){
		for(int j=r; j>=w[i]; j--){
			if(dp[j]==1)continue;
			if(dp[j]==-1 && dp[j-w[i]]==1){
				dp[j]=1; v[j]=i; pre[j]=j-w[i]; 
			}
		}
	}
	vector<int>ans; int idx=-1;
	for(int i=l; i<=r; i++){
		if(dp[i]==1){
			idx=i; break; 
		}
	}
	if(idx==-1)return ans;
	while(pre[idx]!=idx){
		ans.push_back(v[idx]); idx=pre[idx];
	}
	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... | ||||
