oj.uz

Submission #901401

# Submission time Handle Problem Language Result Execution time Memory
901401 2024-01-09T11:40:05 Z nxteru Ancient Books (IOI17_books) C++14
0 / 100
 0 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
int minimum_walk(vector<int>p, int s){
	int n=p.size();
	ll ans=0;
	for(int i=0;i<n;i++){
		ans+=abs(p[i]-i);
	}
	int r=n-1;
	while(r>=0&&p[r]==r)r--;
	int ma=0;
	for(int i=0;i<r;i++){
		ma=max(ma,p[i]);
		if(ma>i)ans+=2;
	}
	return ans;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 504 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 504 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 504 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4742'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 504 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
2 Halted 0 ms 0 KB -