제출 #354907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
354907		beksultan04	고대 책들 (IOI17_books)	C++14	12 / 100	2093 ms	364 KiB

books

#include "books.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int pos[1000001],q[1000001],ans,n;
map<vector<int>,int> mp;
bool is(){
    int i;
    for (i=0;i<n;++i)
        if (q[i] != i)ret 0;
    ret 1;
}

int rec(int j,int x,int sum,int cnt=0){
    if (is())ret sum+(max(j,0));
    if (cnt > 9)ret 1e9+7;
    int ans = 1e9+7,i;
    for (i=0;i<n;++i){
        if (i != j){
            swap(x,q[i]);
            ans = min(ans,rec(i,x,sum+abs(j-i),cnt+1));
            swap(x,q[i]);
        }
    }
    ret ans;
}

lol minimum_walk(vector<int> p, int s) {
    n = p.size();
    int i;
    for (i=0;i<n;++i)
        q[i] = p[i];
    int ans = rec(-1,-1,0)-1;
    if (ans < 0)ans =0;
    ret ans;
}






/*
4 0
0 2 3 1
*/

• Subtask 1: 12 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30