Submission

Score: 0

User: qweqwe

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

Language: cpp

Time: 0.106 second

Submitted On: 2026-03-26 18:09:50

#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> max_allowed_positions) {
  return ceil((db)(max_allowed_positions.size())/(max_allowed_positions[0]));
}