Submission #1159717

#TimeUsernameProblemLanguageResultExecution timeMemory
1159717gohchingjaykJanjetina (COCI21_janjetina)C++20
0 / 110
0 ms324 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define int ll constexpr int INF = 1ull << 60; int w[100000 + 5]; int N, K; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> N >> K; for (int i = 0; i < N - 1; ++i) cin >> w[i] >> w[i] >> w[i]; int cnt = 0; for (int i = 0; i < N - 1; ++i) { int len = -1; int maxw = -1; for (int j = i; j < N - 1; ++j) { len++; maxw = max(maxw, w[j]); if (maxw - len >= K) cnt++; // cout << i << ' ' << j << ' ' << len << ' ' << maxw << endl; } } cout << cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...