Submission

Score: 79

User: hyyh

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

Language: cpp

Time: 1.092 second

Submitted On: 2026-03-14 20:04:31

#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) {
  int const N = 2e6+10;
  bitset<N> bs;
  int n = vc.size()+1;
  bs.set();
  int ans = 0;
  for(auto k:vc){
    int cur = bs._Find_next(n-k-1);
    //cout << cur << endl;
    if(cur >= n){
      ans++;
      bs.set();
      cur = n-k;
    }
    bs[cur] = 0;
  }
  return ans;
}