Submission

Score: 45

User: qweqwe

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

Language: cpp

Time: 1.096 second

Submitted On: 2026-03-26 18:37:24

#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<2000001> u;
	u.reset();
	int n=arr.size();
	int cnt=0;
	for(int i=0;i<n;i++){
		int idx=arr[i],temp=idx;
		//cout << idx << " ";
		while (u[idx]){
			idx--;
		}
		if (idx==0){
			u.reset();
			cnt++;
		}
		if (idx==0) u.set(temp,1);
		else u.set(idx,1);
	}return cnt;
    //return ceil((db)(max_allowed_positions.size())/(max_allowed_positions[0]));
}