UVA_10172_Loansome_Cargo_Distributor

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;


int main() {
    int n, s, q, TC;

    cin >> TC;

    for (; TC > 0; TC--) {
        stack<int> carrier;
        queue<int> stationQueue[100];

        cin >> n >> s >> q;

        for (int i = 0; i < n; i++) {
            int nc;
            cin >> nc;
            for (int j = 0; j < nc; j++) {
                int target;
                cin >> target;
                stationQueue[i].push(target - 1);
            }
        }

        int currPos = 0, time = 0;
        while (true) {
            //unload cargo until fail or stack empty @ 1min
            while (!carrier.empty()
                    && (carrier.top() == currPos
                            || stationQueue[currPos].size() < q)) {
                if (carrier.top() != currPos) {
                    stationQueue[currPos].push(carrier.top());
                }
                carrier.pop();
                time++;
            }

            //load cargo until stack full or q empty @ 1min
            while ((carrier.size() < s) && !stationQueue[currPos].empty()) {
                carrier.push(stationQueue[currPos].front());
                stationQueue[currPos].pop();
                time++;
            }

            bool clear = carrier.empty();
            for (int i = 0; i < n; i++) {
                clear &= stationQueue[i].empty();
            }
            if (clear)
                break;

            //move @ 2 min
            currPos = (currPos + 1) % n;
            time += 2;
        }

        cout << time << endl;
    }

    return 0;
}