Submission

Score: 45

User: qweqwe

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

Language: cpp

Time: 1.098 second

Submitted On: 2026-03-26 18:22: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) {
	unordered_set<int> u;
	int n=arr.size();
	int cnt=0;
	for(int i=0;i<n;i++){
		int idx=arr[i];
		while (u.count(idx)){
			idx--;
		}
		//cout << idx << " ";
		if (idx<=0){
			u.clear();
			cnt++;
		}
		if (idx==0)u.insert(arr[i]);
		else u.insert(idx);
	}return cnt;
    //return ceil((db)(max_allowed_positions.size())/(max_allowed_positions[0]));
}