| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1163402 | Aza | Detecting Molecules (IOI16_molecules) | C++20 | 132 ms | 131072 KiB |
//AzaLE (Azamat Alisherov)
#include <bits/stdc++.h>
//#include "molecules.h"
#define F first
#define S second
#define size(x) (int)x.size()
#define all(x) x.begin(),x.end()
using namespace std;
vector <int> find_subset(int l, int r, vector<int> v){
int mx = r;
bool dp1[r + 1];
int dp2[r + 1];
int dp3[r + 1];
for(int i = 0; i <= r; i++){
dp1[i] = false;
dp2[i] = -1;
dp3[i] = 0;
}
dp1[0] = true;
dp2[0] = -1;
for(int i = 0; i < size(v); i++){
int cur = v[i];
for(int x = mx; x >= 0; x--){
if(dp1[x] != 1e18){
if(x + cur <= mx){
dp1[x + cur] = true;
dp2[x + cur] = i;
dp3[x + cur] = cur;
if(x + cur >= l and x + cur <= r){
vector <int> ans;
int curdx = x + cur;
while(curdx > 0){
ans.push_back(dp2[curdx]);
curdx -= dp3[curdx];
}
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... | ||||
