Submission

Score: 79

User: qweqwe

Problemset: ร้านปลอดภาษี (Duty Free)

Language: cpp

Time: 1.084 second

Submitted On: 2026-03-26 19:15:36

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
using db = long double;

// you can write more function here

int minimum_bag_rearrangement_time(vector<int> arr) {
	bitset<2000067> u;
	u.set();
	int n=arr.size()+1;
	int cnt=0;
	for(int i:arr){
		int cur = u._Find_next(n-i-1);
		if (cur >= n){
			cnt++;u.set();cur=n-i;
		}
		u[cur]=0;
	}return cnt;
    //return ceil((db)(max_allowed_positions.size())/(max_allowed_positions[0]));
}