Submission

Score: 45

User: hyyh

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

Language: cpp

Time: 1.096 second

Submitted On: 2026-03-14 19:45:35

#include <vector>
#include <queue>
#include <iostream>
#include <bitset>

using namespace std;

// you can write more function here

int minimum_bag_rearrangement_time(std::vector<int> vc) {
  bitset<200010> bs;
  int ans = 0;
  for(auto k:vc){
    int cur = k-1;
    while(cur >= 0 && bs[cur]) cur--;
    if(cur < 0){
      ans++;
      bs.reset();
      cur = k-1;
    }
    bs[cur] = 1;
  }
  return ans;
}