# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213216 | dolphingarlic | Coins (BOI06_coins) | C++14 | 113 ms | 10104 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>
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |