Submission

Status:

(-SSSSSSSSSSSS)(-SSSSSSSS)(-SSSSSSSSS)(-SSSSSSSSS)(-SSSSSSSSSSSSS)(-SSSSSSSSSSSSSSSSSS)(-SSSSSSSSSSSSSSSSSSSSS)

Subtask/Task Score:

{0/4}{0/4}{0/5}{0/7}{0/25}{0/34}{0/21}

Score: 0

User: preum101

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

Language: cpp

Time: 0.113 second

Submitted On: 2026-03-26 21:47:42

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

int minimum_bag_rearrangement_time(vector<int> max_allowed_positions) {
    int n = max_allowed_positions.size();
    if (n%max_allowed_positions[0]==0) {
        return n/max_allowed_positions[0];
    }
    return (n/max_allowed_positions[0])+1;
}