#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define sz(v) ((int)v.size())
ll minimum_walk(vector<int> p, int s) {
/* assumes s = 0 */
ll ans = 0;
int n = sz(p);
for (int i = 0; i < n; ++i)
if (p[i] != i) {
ans += i;
break;
}
for (int i = n-1; i >= 0; --i)
if (p[i] != i) {
ans += i;
break;
}
for (int i = 0; i < n; ++i)
if (p[i] < i)
ans += (ll)(i - p[i]);
return ans;
}
#ifdef ONPC
int main() {
int n, s;
cin >> n >> s;
vector<int> p(n);
for(int i = 0; i < n; ++i)
cin >> p[i];
cout << minimum_walk(p, s);
}
#endif
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
3rd lines differ - on the 1st token, expected: '8', found: '7' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
3rd lines differ - on the 1st token, expected: '8', found: '7' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
3rd lines differ - on the 1st token, expected: '8', found: '7' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
300 KB |
3rd lines differ - on the 1st token, expected: '3304', found: '2371' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
3rd lines differ - on the 1st token, expected: '8', found: '7' |
4 |
Halted |
0 ms |
0 KB |
- |