| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 328802 | ryangohca | Snail (NOI18_snail) | 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>
#define int long long
using namespace std;
vector<int> changes;
main() {
int h, n; cin >> h >> n;
for (int i = 0; i < n*2; i++){
if (i >= n){
changes.push_back(changes[i-n]);
} else {
int g; cin >> g;
changes.push_back(g);
}
}
int s = 0;
for (int i = 0; i < n*2; i++){
s += changes[i];
s = max(s, 0);
if (s >= h){
cout << i/n << ' ' << i%n << '\n';
return 0;
}
}
s = accumulate(changes.begin(), changes.end(), 0ll);
if (s <= 0) {
cout << "-1 -1\n";
return 0;
} else {
int d = h/s * 2;
int climbed = d*s;
if (climbed >= h){
cout << d << ' ' << n - 1 << "\n";
return 0;
}
d++;
for (int i = 0; i < n*2; i++){
if (i == n) d++;
climbed += changes[i];
if (climbed >= h){
cout << d << ' ' << i % n << '\n';
return 0;
}
}
}
}