제출 #787966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787966		YassirSalama	Detecting Molecules (IOI16_molecules)	C++14	31 / 100	1071 ms	27348 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
const int MAXM=10000;
bool dp[MAXM];
vector<int> v;
int L,U,N;
unordered_map<int,vector<int>> mp;
void find(int x){
    memset(dp,false,sizeof(dp));
    dp[0]=true;
    for(int i=0;i<N;i++){
        for(int j=x;j>=v[i];j--){
            if(dp[j-v[i]]){
                mp[j]=mp[j-v[i]];
                mp[j].push_back(i);
                dp[j]=dp[j-v[i]];
            }
        }
    }
}


vector<int> find_subset(int l, int u, vector<int> w) {
    L=l;
    U=u;
    v=w;
    N=w.size();
    find(u+1);
    for(int i=u;i>=l;i--){
        if(dp[i]) return mp[i];
    }
    return vector<int>(0);
}


// int main() {
//     int n, l, u;
//     assert(3 == scanf("%d %d %d", &n, &l, &u));
//     std::vector<int> w(n);
//     for (int i = 0; i < n; i++)
//         assert(1 == scanf("%d", &w[i]));
//     std::vector<int> result = find_subset(l, u, w);
    
    
//     printf("%d\n", (int)result.size());
//     for (int i = 0; i < (int)result.size(); i++)
//         printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
// }

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31