제출 #204204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204204		awlintqaa	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1085 ms	760 KiB

molecules

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "molecules.h"
int n ,L,R;
vi v;
int a[100009];
bool dp[10009][10009];
bool done[10009][10009];
bool bt(int id,int sum){
        if ( id == n ){
                return (L<=sum && sum<=R);
        }
        bool &ret=dp[id][sum];
        if(done[id][sum])return ret;
        ret = 0;
        ret = max ( bt(id+1,sum) , bt(id+1,sum+a[id]) );
        return ret;
}
void path(int id,int sum){
        if ( id == n)return ;
        bool ans = bt(id,sum);
        bool ret1=bt(id+1,sum);
        if ( ret1 == ans){
                path(id+1,sum);
                return ;
        }
        v.pb(id);
        path(id+1,sum+a[id]);
}
vi find_subset(int l, int u, vi w) {
        n=w.size();
        for(int i =0 ;i < n;i ++ ){
                a[i]=w[i];
        }
        L =l ,R = u;
        if ( bt(0,0) ){
                path(0,0);
                return v;
        }
        return std::vector<int>(0);
}

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