oj.uz

답안 #615921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615921 2022-07-31T15:05:00 Z MohamedAhmed04 고대 책들 (IOI17_books) C++14
0 / 100
 1 ms 340 KB 
#include "books.h"
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1e6 + 10 ;

int mark[MAX] ;

int n ;

long long minimum_walk(std::vector<int> p, int s) 
{
	n = p.size() ; 
	long long ans = 0 , last = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		if(mark[i])
			continue ;
		ans += i - last ;
		last = i ;
		int x = i ;
		while(!mark[x])
		{
			mark[x] = 1 ;
			ans += abs(p[x] - x) ;
			x = p[x] ;
		}
	}
	ans += last ;
	return ans ;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 312 KB 3rd lines differ - on the 1st token, expected: '3304', found: '4736'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 0 ms 212 KB 3rd lines differ - on the 1st token, expected: '6', found: '8'
3 Halted 0 ms 0 KB -