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<cstring>
 
using namespace std;
 
const int Height = 5500;
const int Width = 5;
char field[Height][Width];
int top,ans;
int dx[] = {1,0};
int dy[] = {0,-1};
 
 
void print(int h, int w){
 
  for(int i = 0; i < h; i++){
    for(int j = 0; j < w; j++) cout << field[i][j];
    cout << endl;
  }
  cout << endl;
     
}
bool isInside(int h, int w){return 0<=h&&h<Height&&0<=w&&w<Width;}
 
int getH(int d, int len, int pos){
  for(int i = top+1; i>=0; i--){
    int h = i;
    int w = pos;
    for(int j = 0; j < len; j++){
      if(field[h][w] != '?' || !isInside(h,w)) return i+1;
      h += dy[d];
      w += dx[d];
    }
  }
}

void down(int n){

  for(int i = n; i <= top+5; i++)
    for(int j = 0; j < Width; j++) field[i][j] = field[i+1][j];

}

void erase(){

  for(int i = 0; i <= top; i++){
    bool f = true;
    for(int j = 0; j < Width; j++) if(field[i][j] == '?') f = false;
    if(f){
      for(int j = 0; j < Width; j++) field[i][j] = '?';
      ans -= 5;
      down(i--);
    }
  }
}
 
void put(int d, int len, int pos){
 
  int nex = getH(d,len,pos);
  top = max(top,nex);
 
  int h = nex;
  int w = pos;
 
  for(int i = 0; i < len; i++){
    field[h][w] = '.';
    h += dy[d];
    w += dx[d];
  }
}
 
int main(){
 
  int n;
  while(cin >> n && n){
    memset(field,'?',sizeof(field));
    ans = top = 0;
    
    while(n--){
      int d, len, pos;
      cin >> d >> len >> pos;
      ans += len;
      put(d-1,len,pos-1);
      erase();
    }
    cout << ans << endl;
    //  print(10,5);
  }
  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;
Block blocks[N_BLOCK_MAX];
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);
			field.push_back(Row());
			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)
	{
		for(int i=0; i<n; i++)
		{
			cin >> blocks[i].d;
			cin >> blocks[i].p;
			cin >> blocks[i].q;
			blocks[i].q--;
		}

		field = vector<Row>(MAX_H);
		for(int i=0; i<n; i++)
		{
			for(int j=MAX_H-1; j>=0; j--)
			{
				if(!isSetOk(blocks[i], j))
				{
					setBlock(blocks[i], j+1);
					break;
				}

				if(j==0)
				{
					setBlock(blocks[i], 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());
	}
}