Submission #1289421

#TimeUsernameProblemLanguageResultExecution timeMemory
1289421lopkusFish 3 (JOI24_fish3)C++20
0 / 100
2096 ms5124 KiB
#include <bits/stdc++.h> #define int int64_t signed main() { int n, d; std::cin >> n >> d; std::vector<int> a(n + 1); for(int i = 1; i <= n; i++) { std::cin >> a[i]; } int q; std::cin >> q; while(q--) { int l, r; std::cin >> l >> r; if(is_sorted(a.begin() + l, a.begin() + r + 1)) { std::cout << 0 << "\n"; continue; } std::vector<int> f = a; int can = 1; int ans = 0; for(int i = r - 1; i >= l; i--) { while(f[i] > f[i + 1]) { f[i] -= d; ans += 1; } if(f[i] < 0) { can = 0; break; } } std::cout << (can == 1 ? ans : - 1) << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...