Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)
var (
	dat = [5000][5]int{}
	m = [5]int{}
)

func main() {
	for scanner.Scan() {
		for i := range dat {
			for j := range dat[i] {
				dat[i][j] = 0
			}
		}
		for i := range m {
			m[i] = 0
		}
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		count := 0
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			d, _ := strconv.Atoi(buf[0])
			p, _ := strconv.Atoi(buf[1])
			q, _ := strconv.Atoi(buf[2])
			q--
			count += p
			if d == 2 {
				for j := 0; j < p; j++ {
					dat[m[q]][q] = 1
					ok := true
					for k := 0; k < 5; k++ {
						if dat[m[q]][k] == 0 {
							ok = false
						}
					}
					if ok {
						for k := 0; k < 5; k++ {
							dat[m[q]][k] = 0
							for l := m[q]; l < 4999; l++ {
								dat[l][k] = dat[l+1][k]
							}
							for l := 4999; l >= 0; l-- {
								if dat[l][k] != 0 {
									m[k] = l+1
									break
								}
								if l == 0 {
									m[k] = 0
								}
							}
						}
						count -= 5
					} else {
						m[q]++
					}
				}
			} else {
				h := 0
				for i := 0; i < p; i++ {
					h = max(h, m[i+q])
				}
				for i := 0; i < p; i++ {
					dat[h][i+q] = 1
				}
				for i := 0; i < p; i++ {
					m[i+q] = h+1
				}
				ok := true
				for j := 0; j < 5; j++ {
					if dat[h][j] == 0 {
						ok = false
					}
				}
				if ok {
					for j := 0; j < 5; j++ {
						dat[h][j] = 0
						for k := h; k < 4999; k++ {
							dat[k][j]=dat[k+1][j]
						}
						for k := 4999; k>= 0; k-- {
							if dat[k][j] != 0 {
								m[j]=k+1
								break
							}
							if k == 0 {
								m[j] = 0
							}
						}
					}
					count -= 5
				}
			}
		}
		fmt.Println(count)
	}
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

C++: #include <iostream>
#include <vector>
using namespace std;

vector<int> EMP(5, 0), FULL(5, 1);

class TETORIS {
public:
	int N;
	vector<vector<int> > bd;
	TETORIS() : N(0) {}
	void put(int len, int pos) {
		int k = bd.size()-1;
		for (; k>=0; --k) {
			for (int i=0; i<len; ++i) {
				if (bd[k][pos+i]) goto brk;
			}
		} brk:;
		++k;
		if (bd.size() == k) bd.push_back(EMP);
		for (int i=0; i<len; ++i) {
			bd[k][pos+i] = 1;
		}
		N += len;
	}
	void update() {
		for (int i=bd.size()-1; i>=0; --i) {
			if (bd[i] == FULL) {
				bd.erase(bd.begin()+i);
				N -= 5;
			}
		}
	}
};

int main() {
	int n, d, p, q;
	while (cin >> n, n) {
		TETORIS tet;
		for (int i=0; i<n; ++i) {
			cin >> d >> p >> q;
			if (d == 1) {
				tet.put(p, q-1);
				tet.update();
			} else {
				for (int j=0; j<p; ++j) tet.put(1, q-1);
				tet.update();
			}
		}
		cout << tet.N << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int grid[5][6000];
int n,d,p,q;
ll int ans = 0;

int GetBottom(int x){
	REP(i,6000){
		if(grid[x][i]==-1) return i;
	}
	return 0;
}

bool isallclear(int x){
	REP(i,5){
		if(grid[i][x]!=-1) return false;
	}
	return true;
}

bool isallblock(int x){
	REP(i,5){
		if(grid[i][x]!=1) return false;
	}
	return true;
}

int main(){
	while(cin>>n,n){
		REP(i,5) REP(j,6000) grid[i][j] = -1;
		REP(i,n){
			cin >> d >> p >> q;
			if(d==2){
				int tmp = GetBottom(q-1);
				FOR(j,tmp,tmp+p) grid[q-1][j] = 1;
			}else{
				int tmp = -1;
				FOR(j,q-1,q-1+p){
					tmp = max(tmp,GetBottom(j));
				}
				FOR(j,q-1,q-1+p) {
					grid[j][tmp] = 1;
					REP(k,tmp) if(grid[j][k]==-1) grid[j][k] = 0;
				}
			}
			int nowline = 0;
			while(1){
				if(isallclear(nowline)) break;
				if(isallblock(nowline)){
					REP(j,5) {
						int nline = nowline+1;
						while(1){
							if(grid[j][nline]==-1) {
								grid[j][nline-1] = grid[j][nline];
								break;
							}
							grid[j][nline-1] = grid[j][nline];
							nline++;
						}
					}
					nowline = 0;
				}else{
					nowline++;
				}
			}
		}
		ans = 0;
		int line = 0;
		while(1){
			if(isallclear(line)) break;
			REP(i,5){
				if(grid[i][line]==1) ans++;
			}
			line++;
		}
		cout << ans << endl;

	}
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;

typedef istringstream ISS;
typedef ostringstream OSS;
typedef vector<string> VS;
typedef int INT;
typedef vector<INT> VI;
typedef vector<VI> VVI;
typedef pair <INT, INT> II;
typedef vector <II> VII;

template<class T> ostream& operator << ( ostream& os, vector<T> v ) {
    for ( typename vector<T>::iterator it_i = v.begin(); it_i != v.end(); ++it_i ) {
        os << *it_i << ", ";
    }
    return os;
}


const int SIZE = 1001;
const int HEIGHT = 5001;
int n;
int D[SIZE+10], P[SIZE+10], Q[SIZE+10];
bool B[HEIGHT+10][10];

int solve() {
    fill( (bool*)B, (bool*)B+HEIGHT*5, false );
    
    
    for ( int i = 0; i < n; ++ i ) {
        int d = D[i], p = P[i], q = Q[i];
        if ( d == 1 ) {
            bool flag2 = true;
            for ( int j = HEIGHT - 1; j >= 0; -- j ) {
                bool flag = false;
                for ( int k = 0; k < p; ++ k ) {
                    if ( B[j][q+k] ) flag = true;
                }
                if ( flag ) {
                    for ( int k = 0; k < p; ++ k ) {
                        B[j+1][q+k] = true;
                    }
                    flag2 = false;
                    break;
                }
            }
            if ( flag2 ) {
                for ( int k = 0; k < p; ++ k ) {
                    B[0][q+k] = true;
                }
            }
        } else if ( d == 2 ) {
            bool flag2 = true;
            for ( int j = HEIGHT - 1; j >= 0; -- j ) {
                bool flag = false;
                for ( int k = 0; k < p; ++ k ) {
                    if ( B[j+k][q] ) flag = true;
                }
                if ( flag ) {
                    for ( int k = 0; k < p; ++ k ) {
                        B[j+k+1][q] = true;
                    }
                    flag2 = false;
                    break;
                }
            }
            if ( flag2 ) {
                for ( int k = 0; k < p; ++ k ) {
                    B[k][q] = true;
                }
            }
        }

        
        
        for ( int j = HEIGHT - 1; j >= 0; -- j ) {
            bool flag = true;
            for ( int k = 0; k < 5; ++ k ) {
                if ( ! B[j][k] ) flag = false;
            }
            if ( flag ) {
                for ( int k = j + 1; k < HEIGHT; ++ k ) {
                    for ( int l = 0; l < 5; ++ l ) {
                        B[k-1][l] = B[k][l];
                    }
                    for ( int l = 0; l < 5; ++ l ) {
                        B[k][l] = false;
                    }
                }
            }
        }

        
    }
    int res = 0;
    for ( int i = 0; i < HEIGHT; ++ i ) {
        for ( int j = 0; j < 5; ++ j ) {
            if ( B[i][j] ) res ++;
        }
    }
    return res;
}

int main() {
    while ( cin >> n && n ) {
        for ( int i = 0; i < n; ++ i ) {
            cin >> D[i] >> P[i] >> Q[i];
            Q[i] --;
        }
        cout << solve() << endl;
    }
    return 0;
}