제출 #1196452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1196452		al95ireyiz	Detecting Molecules (IOI16_molecules)	C++20	31 / 100	1020 ms	27724 KiB

molecules

//*** Bismillah ***//
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 1e4+5;
ll n,m,k=0;
#include "molecules.h"
vll v;
ll l, r;
map<ll, vector<int>> dp;
vector<int> find_subset(int _l, int _r, vector<int> _w){
    l = _l, r = _r; v.clear(); for(auto x : _w) v.pb(x); n = len(v);
    dp.clear();
    for(ll i = 0; i < n; i ++){
        for(ll j = r; j >= 1; j --){
            if(!dp[j].empty()){
                dp[j + v[i]] = dp[j];
                dp[j + v[i]].pb(i);
                if(l <= j + v[i] and j + v[i] <= r) return dp[j + v[i]];
            }
        }
        dp[v[i]] = {(int)i};
    }
    for(ll i = l; i <= r; i++){
        if(!dp[i].empty()){
            return dp[i];
        }
    }
    return {};
}
// void _(ll tt){
// }
// signed main(){
//     ll tm=clock();
//     cin.tie(0)->sync_with_stdio(0);
//     ll t=1;
//     // cin>>t;
//     for(ll tt=1;tt<=t;tt++){
//             _(tt);
//     }
//     cerr<<"\n\033[1;31mTime: \033[1;30m" \
//         <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n";
// }

컴파일 시 표준 에러 (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: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31