Submission #348746

#	Time	Username	Problem	Language	Result	Execution time	Memory
348746		ryansee	고대 책들 (IOI17_books)	C++14	12 / 100	1 ms	364 KiB

books

#include "books.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
// inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (1000006)

ll n, ans;
multiset<pi> ms;

long long minimum_walk(std::vector<int> p, int s) {
	n = siz(p), ans = 0;
	FOR(i,0,n-1) if(p[i] > i) ms.ins(pi(i, p[i]));
	ll os = s;
	while(ms.size()) {
		auto itr = ms.lower_bound(pi(s, 0));
		if(itr == ms.end()) -- itr;
		if(itr->f < s) ans += s - itr->f, s = itr->f;
		assert(itr->s >= s);
		ans += itr->s - s, s = itr->s;
		ms.erase(itr);
	}
	ans += abs(os - s);
	return ans;
}

/*

6 0
3 2 0 1 5 4

*/

ll co[MAXN], cur, l;

long long minimum_walk2(std::vector<int> p, int s) {
	n = siz(p), ans = 0, mmst(co, 0), cur = 0, l = 0;
	FOR(i,0,n-1) if(p[i] ^ i) l = i;
	FOR(i,0,n-1) {
		if(p[i] > i) ++ co[i], -- co[p[i]];
		cur += co[i];
		ans += max(cur, ll(i < l)) * 2;
	}
	
	return ans;
}

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