| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 697647 | finn__ | Coins (BOI06_coins) | C++17 | 75 ms | 8140 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    uint64_t n, k;
    cin >> n >> k;
    vector<uint64_t> c(n);
    vector<bool> has_coin(n);
    for (size_t i = 0; i < n; i++)
    {
        unsigned h;
        cin >> c[i] >> h;
        has_coin[i] = h;
    }
    c.push_back(k);
    uint64_t max_new = 0, curr_sum = 0;
    for (size_t i = 0; i < n; i++)
    {
        if (!has_coin[i] && curr_sum + c[i] < c[i + 1])
            curr_sum += c[i], max_new++;
    }
    assert(max_new <= n);
    assert(curr_sum < k);
    cout << max_new << '\n'
         << (max_new ? k - curr_sum : k - 1) << '\n';
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
