Submission

Score: 45

User: pxsit

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

Language: cpp

Time: 1.085 second

Submitted On: 2026-06-04 01:15:15

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

int minimum_bag_rearrangement_time(vector<int> arr) {
    int n = arr.size();
    int mx = 0;
    for(int i=0;i<n;i++){
        mx = max(mx,arr[i]);
    }
    vector<bool> used(mx+1, false);
    int cnt = 0;
    for(int i=0;i<n;i++){
        int idx = arr[i], tmp = idx;
        while (idx > 0 && used[idx]) {
            idx--;
        }
        if (idx == 0) {
            cnt++;
            fill(used.begin(), used.end(), false);
            used[tmp] = true;
        }
        if(idx != 0) used[idx] = true;
    }
    return cnt;
}