# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381933 | Slavita | Janjetina (COCI21_janjetina) | C++14 | 0 ms | 0 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 ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 228;
const int big = 1e9;
int n, a[N], k, pr[N];
int main(){
iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
cin >> n, k;
for (int i = 1; i <= n - 1; i++){
int l, r, x;
cin >> l >> r >> x;
a[l] = x;
}
int ans = 0;
for (int i = 1; i <= n i++) pr[i] = pr[i - 1] + a[i];
for (int i = 1; i <= n - 1; i++) if (pr[i + 1] - i >= k) ans++;
cout << ans;
return 0;
}