Submission

Status:

(PP-SSSSSSSSSS)(PPPPPPPPP)(PPPPPPPPPP)(-SSSSSSSSS)(-SSSSSSSSSSSSS)(-SSSSSSSSSSSSSSSSSS)(-SSSSSSSSSSSSSSSSSSSSS)

Subtask/Task Score:

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

Score: 9

User: Trin1506

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

Language: cpp

Time: 0.116 second

Submitted On: 2026-04-24 17:31:12

#include <vector>
using namespace std;
int minimum_bag_rearrangement_time(vector<int> max_allowed_positions) {
    int rounds = 0;
    int sz = 0;

    for (int x : max_allowed_positions) {
        sz++;
        if (x < sz) {
            rounds++;
            sz = 1;
        }
    }
    return rounds;
}