제출 #1287060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287060		cowkim	Uplifting Excursion (BOI22_vault)	C++20	0 / 100	5094 ms	572 KiB

vault

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <string>
#include <math.h>
#include <cctype>
#include <cstdint>
#include <climits>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <string>
#include <math.h>
#include <cctype>
#include <cstdint>
#include <climits>
#include <iomanip>
#define ll long long
#define endl "\n"
using namespace std;
map<pair<int,int>,int> dp;
int solve(int index,ll pos,vector<pair<int,int>>& nums,int target){
    if(dp.find({index,pos}) != dp.end()) return dp[{index,pos}];
    if(index == nums.size()) return pos == target? 0:-1;
    int ret = -1;
    for(int i = 0; i<= nums[index].second; i++){
        int cur = solve(index +1,pos + nums[index].first * i,nums,target);
        if(cur == -1) continue;
        cur += i;
        ret = max(cur,ret);
    }
    dp[{index,pos}] = ret;
    return ret;
}
int main(){
    ll m,l;
    cin >> m >> l;
    vector<pair<int,int>> pars;
    for(int i = -m; i<= m; i++){
        int a;
        cin >> a;
        pars.push_back({i,a});
    }
    int ans = solve(0,0,pars,l);
    cout << ans << endl;
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10