제출 #1263076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263076		silentloop	Detecting Molecules (IOI16_molecules)	C++20	46 / 100	1096 ms	4680 KiB

molecules

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define fr first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
using namespace std;

vector<int>arm(vector<pair<int,int>>&dp,int j)
{
    ll sig=j;
    vector<int>ans;
    while(sig>=0)
    {
        if(dp[sig].se>=0)
            ans.pb(dp[sig].se);
        sig=dp[sig].fr;
    }

    return ans;
}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    vector<int>ans;
    if(l>u)
        return ans;

    vector<pair<int,int>>dp(u+1);
    vector<bool>pos(u+1);
    vector<pair<ll,ll>>v;
    ll i, j, mi=LLONG_MAX, sum=0;
    for(i=0; i<sz(w); i++)
    {
        if(w[i]>u)
            continue;
        mi=min(mi,1ll*w[i]);
        v.pb({w[i],i});
        sum=sum+w[i];
        if(l<=w[i]&&w[i]<=u)
        {
            ans.pb(i);
            return ans;
        }
    }
    if(mi>u||sum<1ll*l)
        return ans;
    
    sort(all(v));
    pos[0]=1;
    dp[0].fr=-1;
    dp[0].se=-1;
    for(i=0; i<sz(v); i++)
    {
        ll x=v[i].fr;
        int nod=v[i].se;
        for(j=u; j>=x; j--)
        {
            if(pos[j])
                continue;
            if(pos[j-x])
            {
                pos[j]=1;
                dp[j].fr=j-x;
                dp[j].se=nod;
                if(j>=l)
                    return arm(dp,j);
            }
        }
    }

    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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