oj.uz

답안 #1053535

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

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> moves(n);iota(moves.begin(),moves.end(),0);
	moves.emplace_back(0);
	if(moves==p)return 0ll;
	do {
		long long t = 0;
		vector<int> curr(n);iota(curr.begin(), curr.end(),0);
		int currhand = -1;
		int currpos = 0;
		for(int i=0;i<=n;i++) {
			t+=abs(moves[i]-currpos);
			currpos=moves[i];
			swap(currhand,curr[currpos]);
			if(curr==res) {
				ans = min(ans,t);
				break;
			}
		}
	} while (next_permutation(moves.begin(), moves.end()-1));
	return ans;
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 30.0

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