Poistot

#include <bits/stdc++.h>

using namespace std;

#define int long
typedef vector<int> vi;
typedef pair<int, int> pi;

#define fi first
#define se second
#define pb push_back

#define MOD 1000000007
#define INF INT32_MAX/2-1

void solve() {
    int N;
    cin >> N;
    int arr[N];
    bool taken[N] = {};

    for (int i = 0; i<N; i++) {
        cin >> arr[i];
    }

    stringstream ss;
    ss.tie(0);
    int ans = 0;
    int next_r=0;
    int prev_val;
    bool done = false;

    while (!done) {
        ans++;
        prev_val=0;
        ss << "\n";
        done = true;
        for (int i=next_r; i<N; i++) {
            if (taken[i]) continue;
            if (arr[i] > prev_val) {
                ss << arr[i] << " ";
                prev_val=arr[i];
                taken[i] = true;
            } else if (done) {
                next_r=i;
                done = false;
            }
        }

    }
    cout << ans;
    cout << ss.str() << endl;


}

signed main() {
    cin.tie(0) -> ios::sync_with_stdio(0);
    solve();
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED