제출 #73446

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73446		hamzqq9	고대 책들 (IOI17_books)	C++14	0 / 100	3 ms	604 KiB

books

#include "books.h"
#include<bits/stdc++.h>
#define ii pair<int,int>
#define st first
#define nd second
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long
#define sz(x) ((int)x.size())
using namespace std;

long long minimum_walk(std::vector<int> p, int s) {

	if(s!=0) return 12312;

	ll ans=0;

	int n=sz(p);

	int last=0;

	while(1) {

		int go=-1;

		for(int i=0;i<n;i++) {

			if(p[i]>i) {

				go=i;

				break ;

			}

		}

		if(go==-1) break ;

		ans+=go-last;
		s=go;
		last=go;
		int hand=p[s];
		p[s]=-1;
		int way=0;
		s++;

		while(1) {

			/*for(int i=0;i<n;i++) cerr<<p[i]<<' ';

			cerr<<endl;

			cerr<<"way is-->"<<way<<endl<<"hand is-->"<<hand<<endl<<"s is-->"<<s<<endl;

			getchar();*/

			if(way==0) {

				if(hand==s) {

					swap(hand,p[s]);

					if(hand<s && hand!=-1) way=1;
					else if(hand>s) way=0;
					else break ;

				}

				if(p[s]>hand) swap(hand,p[s]);
				s++;


			}
			else {

				if(hand==s) {

					swap(hand,p[s]);

					if(hand<s && hand!=-1) way=1;
					else if(hand>s) way=0;
					else break ;

				}

				if(p[s]<hand) swap(hand,p[s]);
				s--;
			}

			ans++;

		}

	}

	return ans;

}

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