# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328804 | 2020-11-18T06:14:24 Z | ryangohca | Snail (NOI18_snail) | C++17 | 3 ms | 752 KB |
#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, 0ll); 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 - 1 << ' ' << n - 1 << "\n"; return 0; } 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; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 0 ms | 364 KB | Output is correct |
4 | Incorrect | 0 ms | 364 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 496 KB | Output is correct |
4 | Incorrect | 1 ms | 364 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 748 KB | Output is correct |
2 | Incorrect | 0 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 752 KB | Output is correct |
2 | Incorrect | 2 ms | 748 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 0 ms | 364 KB | Output is correct |
4 | Incorrect | 0 ms | 364 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |