Submission #577320

#TimeUsernameProblemLanguageResultExecution timeMemory
577320OttoTheDinoUplifting Excursion (BOI22_vault)C++17
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll m, l; cin >> m >> l;
    ll a[2*m+1] = {};
    rep (i,0,2*m) cin >> a[i];

    ll cur = 0, s = 0; 
    rep (i,1,m) {
        if (cur + i * a[m+i] >= l) {
            ll d =  l - cur;
            s += d/i;
            cur = l;
            break;
        }
        cur += i * a[m+i];
        s += a[m+i];
    }

    cout << (cur==l?to_string(s):"impossible") << "\n";

    return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...