# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
746154 | 7as__7 | Rainforest Jumps (APIO21_jumps) | C++17 | 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>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,q;
cin >> n >> q;
vector<int>v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
init(n, v);
while (q--) {
cout << minimum_jumps(1, 1, 1, 1) << endl;
}
}