제출 #714182

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714182		vjudge1	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	5054 ms	212 KiB

vault

#include <bits/stdc++.h>

using namespace std;
vector<long long>v;
int m;
long long l, mx = -1;
void rec(long long uplift, int indx, long long cnt){
    if(indx > m && uplift > l)return;
    if(uplift == l && indx == 2 * m + 1){
        mx = max(mx, cnt);
        return;
    }
    else if(indx == 2 * m + 1)return;
    for(int i = 0;i <= v[indx];++i){
        rec(uplift + i * (indx - m), indx + 1, cnt + i);
    }
}
int main()
{
    cin >> m >> l;
    v.resize(2 * m + 1);
    for(int i = 0;i < 2 * m + 1;++i)cin >> v[i];
    rec(0, 0, 0);
    if(mx == -1)cout << "impossible";
    else cout << mx;
}

• 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