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 "books.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 1000005;
int n;
long long sum[maxn];
long long minimum_walk(vector<int> pos, int s) {
int i;
long long ans = 0;
n = pos.size();
for(i=0;i<n;i++) sum[min(i,pos[i])]++, sum[max(i,pos[i])]--;
for(i=0;i<n-1;i++) {
sum[i] += sum[i-1];
ans += sum[i];
}
return ans;
}
| # | 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... |