Submission #102055

#	Time	Username	Problem	Language	Result	Execution time	Memory
102055		daniel920712	Detecting Molecules (IOI16_molecules)	C++14	31 / 100	4 ms	896 KiB

molecules

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include "molecules.h"

using namespace std;
bool have[105][1005]={0};
bool can[105][1005][5]={0};
bool F(int N,int l,int r,vector < int > &w)
{
    if(r<0) return 0;
    if(l<=0&&0<=r) return 1;
    if(l<=w[N]&&w[N]<=r) return 1;
    if(N==0) return 0;
    if(have[N][r]) return can[N][r][0]||can[N][r][1];

    can[N][r][0]=F(N-1,l,r,w);
    can[N][r][1]=F(N-1,l-w[N],r-w[N],w);
    have[N][r]=1;
    return can[N][r][0]||can[N][r][1];

}
void solve(int N,int l,int r,vector < int > &ans,vector < int > &w)
{
    //printf("%d %d %d\n",N,l,r);
    if(r<0) return;
    if(l<=0&&0<=r) return;
    if(l<=w[N]&&w[N]<=r)
    {
        ans.push_back(N);
        return;
    }
    if(N==0) return;
    if(can[N][r][0]) solve(N-1,l,r,ans,w);
    else
    {
        ans.push_back(N);
        solve(N-1,l-w[N],r-w[N],ans,w);
    }
}
vector < int > find_subset(int l, int u, vector < int > w)
{
    int N=w.size();
    vector < int > ans;
    if(F(N-1,l,u,w)) solve(N-1,l,u,ans,w);
    return ans;
}

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