oj.uz

답안 #1053550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053550 2024-08-11T13:06:54 Z Unforgettablepl 고대 책들 (IOI17_books) C++17
0 / 100
 2000 ms 436 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

const int THRESHOLD = 13;

long long minimum_walk(vector<int> p, int s) {
	int n = p.size();
	vector<int> res(n,-1);
	for(int i=0;i<n;i++)res[p[i]]=i;
	long long ans = 1e10;
	vector<int> curr(n);iota(curr.begin(), curr.end(),0);
	int currhand = 0;
	curr[0]=-1;
	function<void(int,long long,int)> calc = [&](int x,long long t,int moves) {
		if(moves>THRESHOLD)return;
		swap(currhand,curr[x]);
		if(curr==res) {
			ans = min(ans,t+x);
			return;
		}
		for(int i=0;i<n;i++)if(i!=x) {
			calc(i,t+abs(x-i),moves+1);
		}
		swap(currhand,curr[x]);
	};
	calc(0,0,0);
	return ans;
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2033 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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