# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
995932 | Khanhcsp2 | Coins (BOI06_coins) | C++14 | 52 ms | 8124 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 el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=5e5+11;
int n, k, a[N], d[N], ans, cnt;
void sol()
{
cin >> n >> k;
for(int i=1;i<=n;i++) cin >> a[i] >> d[i];
for(int i=1;i<=n;i++)
{
if(d[i]==1) continue;
if(i!=n)
{
if(ans+a[i]<a[i+1]) ans+=a[i], cnt++;
}
else if(ans+a[i]<k) ans+=a[i], cnt++;
}
cout << cnt << el;
if(ans==0) ans=1;
cout << k-ans;
}
signed main()
{
// freopen("divisor.INP", "r", stdin);
// freopen("divisor.OUT", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--)
{
sol();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |