# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525117 | ali22413836 | Coins (BOI06_coins) | C++14 | 39 ms | 6524 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 endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
if(y == 0) return 1 ;
if(y == 1) return x ;
ll ret = mypower(x , y / 2);
ret = (ret * ret) % mod;
if(y % 2) ret = ( ret * x ) % mod ;
return ret ;
}
ll n , k , a[200009] ;
bool vis[200009] ;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> k ;
for(int i = 0 ; i < n ;i++){
cin >> a[i] >> vis[i] ;
}
a[n] = k + 1 ;
ll sum = 0 , ans = 0 ;
for(int i = 0 ; i < n ; i++){
if(vis[i] == 0 && sum + a[i] < a[i + 1]){
ans++ , sum += a[i] ;
}
}
if(!sum)
sum = 1 ;
cout << ans << endl;
cout << k - sum << endl ;
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |