Submission #354920

#	Time	Username	Problem	Language	Result	Execution time	Memory
354920		beksultan04	고대 책들 (IOI17_books)	C++14	0 / 100	1 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;

lol minimum_walk(vector<int> p, int s) {
    n = p.size();
    int i;
    for (i=0;i<n;++i){
        if (p[i] != i)break;
    }
    int ans = i;
    for (i=ans;i < n;++i){
        ans += abs(p[i]-i);
    }

    ret ans;
}






/*
4 0
0 2 3 1
*/

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