oj.uz

Submission #697638

# Submission time Handle Problem Language Result Execution time Memory
697638 2023-02-10T15:34:56 Z finn__ Coins (BOI06_coins) C++17
90 / 100
 77 ms 4264 KB 
#include <bits/stdc++.h>
using namespace std;

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

    size_t n, k;
    cin >> n >> k;

    vector<unsigned> 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++;
    }

    cout << max_new << '\n'
         << k - curr_sum << '\n';
}

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 60 ms 4264 KB Output is correct
8 Incorrect 60 ms 4248 KB Output isn't correct
9 Correct 77 ms 4252 KB Output is correct
10 Correct 67 ms 4256 KB Output is correct