oj.uz

Submission #213216

# Submission time Handle Problem Language Result Execution time Memory
213216 2020-03-25T09:57:06 Z dolphingarlic Coins (BOI06_coins) C++14
100 / 100
 113 ms 10104 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;

int a[500001], b[500001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k, sm = 0, cnt = 0;
    cin >> n >> k;
    FOR(i, 0, n) cin >> a[i] >> b[i];
    a[n] = k;
    FOR(i, 0, n) {
        if (b[i]) continue;
        if (sm + a[i] < a[i + 1]) sm += a[i], cnt++;
    }
    cout << cnt << '\n' << k - max(1, sm);
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 106 ms 9988 KB Output is correct
8 Correct 108 ms 9980 KB Output is correct
9 Correct 113 ms 10104 KB Output is correct
10 Correct 111 ms 9720 KB Output is correct