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 N 501
using namespace std;
typedef long long ll;
int n, s, ans[1000050];
ll minimum_walk(vector<int> v, int s_)
{
ll sum = 0, last = 0;
n = v.size(), s = s_;
int pos = 0;
while(true)
{
int nop = 0;
for(int i = 0; i < n; i++)
{
if(v[i] != i) nop ++;
}
if(!nop) break;
if(v[pos] == pos)
{
pos ++;
sum ++;
continue;
}
int sv = pos;
cout<<"FROM "<<pos<<" TO "<<v[pos]<<"\n";
sum += abs(v[pos] - pos);
pos = v[pos];
last = pos;
v[sv] = sv;
}
return sum + last;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |