oj.uz

답안 #926550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926550 2024-02-13T09:23:09 Z parlimoos Coins (BOI06_coins) C++14
90 / 100
 61 ms 3020 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'

int n , k;
vector<int> a;
bool has[500000];

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

    cin >> n >> k;
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d >> has[i];
        a.pb(d);
    }
    int o = 0 , cnt = 0;
    for(int i = 0 ; i < n ; i++){
        if(has[i]) continue;
        if(i < n - 1){
            if(o + a[i] < a[i + 1]) o += a[i] , cnt++;
        }else{
            if(o + a[i] < k) o += a[i] , cnt++;
        }
    }
    cout << cnt << endl << k - o;
}

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 61 ms 2832 KB Output is correct
8 Incorrect 58 ms 2980 KB Output isn't correct
9 Correct 61 ms 3020 KB Output is correct
10 Correct 60 ms 3016 KB Output is correct