| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1322249 | jump | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
//std::vector<int> dp[20010];
int use[20010];
int from[20010];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
for(int i=0;i<=20000;i++){
use[i]=-1;
from[i]=-1;
}
use[0]=-1;
from[0]=0;
for(int c=0;c<w.size();c++){
for(int i=u;i>=0;i--){
if(use[i]!=-1||i==0){
use[i+w[c]]=c;
from[i+w[c]]=i;
}
}
}
std::vector<int> ans;
for(int i=l;i<=u;i++){
if(use[i]!=-1){
int curr=i;
while(curr!=0){
ans.push_back(use[curr]);
curr=from[curr];
}
break;
}
}
return ans;
}
Compilation message (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... | ||||
