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<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<list>

using namespace std;

#define int long long

list<bool*> fld;

list<bool*>::iterator GetHeight(int l, int r)
{
	list<bool*>::iterator itr = fld.begin();
	fld.push_front((bool*)new bool[5]{});
	for (; itr != fld.end(); itr++)
	{
		for (int j = l; j < r; j++)
		{
			if ((*itr)[j] == true) return --itr;
		}
	}
	return --itr;
}

bool IsFull(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == false) return false;
	}
	return true;
}

bool IsEmpty(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == true) return false;
	}
	return true;
}

void Drop(int d, int p, int q)
{
	if (!IsEmpty(fld.begin())) fld.push_front((bool*)new bool[5]{});
	int l = q - 1, r = (d == 1) ? l + p : l + 1;
	list<bool*>::iterator itr = GetHeight(l, r);

	int h = (d == 1) ? 1 : p;
	for (int i = 0; i < h; i++)
	{
		if (itr == fld.begin()) fld.push_front((bool*)new bool[5]{});
		for (int j = l; j < r; j++)
		{
			(*itr)[j] = true;
		}
		if (IsFull(itr))
		{
			delete *itr;
			itr = fld.erase(itr);
		}
		itr--;
	}
}

signed main()
{
	int N;
	while (cin >> N, N)
	{
		fld.clear();
		fld.push_back((bool*)new bool[5]{});
		for (int i = 0; i < N; i++)
		{
			int d, p, q;
			cin >> d >> p >> q;
			Drop(d, p, q);
		}
		int ans = 0;
		for (list<bool*>::iterator itr = fld.begin(); itr != fld.end(); itr++)
		{
			for (int i = 0; i < 5; i++)
			{
				ans += ((*itr)[i] == true);
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<list>

using namespace std;

#define int long long

list<bool*> fld;

list<bool*>::iterator GetHeight(int l, int r)
{
	list<bool*>::iterator itr = fld.begin();
	for (; itr != fld.end(); itr++)
	{
		bool isAble = true;
		for (int j = l; j < r; j++)
		{
			if ((*itr)[j] == true) isAble = false;
		}
		if (!isAble) return --itr;
	}
	return --itr;
}

bool IsFull(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == false) return false;
	}
	return true;
}

bool IsEmpty(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == true) return false;
	}
	return true;
}

void Drop(int d, int p, int q)
{
	if (!IsEmpty(fld.begin())) fld.push_front((bool*)new bool[5]{});
	int l = q - 1, r = (d == 1) ? l + p : l + 1;
	list<bool*>::iterator itr = GetHeight(l, r);

	int h = (d == 1) ? 1 : p;
	for (int i = 0; i < h; i++)
	{
		if (itr == fld.begin()) fld.push_front((bool*)new bool[5]{});
		for (int j = l; j < r; j++)
		{
			(*itr)[j] = true;
		}
		if (IsFull(itr))
		{
			delete *itr;
			itr = fld.erase(itr);
		}
		itr--;
	}
}

signed main()
{
	int N;
	while (cin >> N, N)
	{
		fld.clear();
		fld.push_back((bool*)new bool[5]{});
		for (int i = 0; i < N; i++)
		{
			int d, p, q;
			cin >> d >> p >> q;
			Drop(d, p, q);
		}
		int ans = 0;
		for (list<bool*>::iterator itr = fld.begin(); itr != fld.end(); itr++)
		{
			for (int i = 0; i < 5; i++)
			{
				ans += ((*itr)[i] == true);
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}

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

const int HORIZONTAL = 1;
const int VERTICAL   = 2;
const int MAX_H = 5000;
const int WIDTH = 5;
const int N_BLOCK_MAX = 1000;

class Block
{
public:
	int d, p, q;
	Block() {}
};

class Row
{
public:
	int i[5];
	Row()
	{
		for(int m=0; m<5; m++) i[m] = 0;
	}
};

int n;
vector<Row> field;

bool isSetOk(Block b, int y)
{
	if(b.d == HORIZONTAL)
	{
		for(int dx=0; dx<b.p; dx++)
		{
			int xx = b.q + dx;
			if(field[y].i[xx]) return false;
		}
		return true;
	}
	else if(b.d == VERTICAL)
	{
		for(int dy=0; dy<b.p; dy++)
		{
			int yy = y + dy;
			if(field[yy].i[b.q]) return false;
		}
		return true;
	}

	return false;
}

void setBlock(Block b, int y)
{
	if(b.d == HORIZONTAL)
	{
		for(int dx=0; dx<b.p; dx++)
		{
			int xx = b.q + dx;
			field[y].i[xx] = 1;
		}
	}
	else if(b.d == VERTICAL)
	{
		for(int dy=0; dy<b.p; dy++)
		{
			int yy = y + dy;
			field[yy].i[b.q] = 1;
		}
	}
}

void checkErase()
{
	vector<Row>::iterator iter = field.begin();
	while(iter != field.end())
	{
		bool is_empty = true;
		bool is_fill = true;
		for(int x=0; x<WIDTH; x++)
		{
			if((*iter).i[x] != 0) is_empty = false;
			if((*iter).i[x] == 0) is_fill = false;
		}

		if(is_fill)
		{
			field.erase(iter);
			continue;
		}
			
		if(is_empty) return;

		++iter;
	}
}

int countBlock()
{
	int retVal = 0;
	for(int y=0; y<MAX_H; y++)
	{
		bool is_empty = true;
		for(int x=0; x<WIDTH; x++)
		{
			if(field[y].i[x] != 0)
			{
				is_empty = false;
				retVal++;
			}
		}
		
		if(is_empty) break;
	}

	return retVal;
}

int main()
{
	while(cin >> n, n)
	{
		field = vector<Row>(MAX_H);
		for(int i=0; i<n; i++)
		{
			Block block;
			cin >> block.d;
			cin >> block.p;
			cin >> block.q;
			block.q--;

			for(int j=field.size()-1; j>=0; j--)
			{
				if(!isSetOk(block, j))
				{
					setBlock(block, j+1);
					break;
				}

				if(j==0)
				{
					setBlock(block, 0);
				}
			}

			checkErase();
			
/*
			for(int y=9; y>=0; y--)
			{
				for(int x=0; x<WIDTH; x++)
				{
					printf("%d ", field[y].i[x]);
				}
				printf("\n");
			}
			printf("\n");
*/
		}	
		printf("%d\n", countBlock());
	}
}