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 i = l; i < r; i++)
		{
			if ((*itr)[i] == true) return --itr;
		}
	}
	return --itr;
}

void PushFront()
{
	fld.push_front((bool*)new bool[5]);
	for (int i = 0; i < 5; i++)
	{
		(*fld.begin())[i] = false;
	}
}

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())) PushFront();
	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()) PushFront();
		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();
		PushFront();
		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 <algorithm>
using namespace std;

const int LIMIT = 5001;

int main()
{
	int n;

	while( cin >> n && n )
	{
		bool map[ LIMIT ][ 5 ] = {0};
		int h[ 5 ] = {0};
		for( int i = 0; i < n; ++i ){
			int d, p, q;
			cin >> d >> p >> q;
			q -= 1;

			int w = ( d == 1 ? p : 1 );
			int hh = 0;
			for( int i = 0; i < w; ++i ){
				hh = max( hh, h[ q + i ] );
			}
			if( d == 1 ){
				for( int i = 0; i < w; ++i ){
					map[ hh ][ q + i ] = true;
					h[ q + i ] = hh + 1;
				}
			}else{
				for( int i = 0; i < p; ++i ){
					map[ hh + i ][ q ] = true;
				}
				h[ q ] = hh + p;
			}

			for( int i = 0; i < 5; ++i ){
				hh = max( hh, h[ i ] );
			}
			for( int i = 0; i < hh; ++i ){
				bool full = true;
				for( int j = 0; j < 5; ++j ){
					if( !map[ i ][ j ] ){
						full = false;
						break;
					}
				}
				if( full ){
					for( int j = i; j < hh; ++j ){
						for( int k = 0; k < 5; ++k ){
							map[ j ][ k ] = map[ j + 1 ][ k ];
						}
					}
					for( int j = 0; j < 5; ++j ){
						--h[ j ];
					}
					--hh;
					--i;
				}
			}
		}
		int hh = 0;
		for( int i = 0; i < 5; ++i ){
			hh = max( hh, h[ i ] );
		}
		int ans = 0;
		for( int i = 0; i < hh; ++i ){
			for( int j = 0; j < 5; ++j ){
				if( map[ i ][ j ] ) ++ans;
			}
		}
		cout << ans << endl;
	}

	return 0;
}

C++: #include<stdio.h>
#include<string.h>
#define max(a,b) (a>b?a:b)
char B[6005][5];
int N,d,p,q,res;


int cnt(int y,int x,int c)
{
	int t=0;
	for(int i=0;i<c;i++)
		t+=B[y][x+i];
	return t;
}

void dbg()
{
	for(int i=0;;i++,puts(""))
	{
		int f=cnt(i,0,5);
		if(!f)break;
		for(int j=0;j<5;j++)
			putchar(B[i][j]?'x':' ');
	}
	puts("");
}


int sch(int h,int w,int p,int y)
{
	int i;
	for(i=y;i>=0;)
	{
		int l=cnt(i,p,w);
		if(!l)
		{
			if(i&&cnt(i-1,p,w)==0)
				i--;
			else
				return i;
		}
		else
		{
			if(cnt(i+1,p,w)==0)
				i++;
			else
				return i;
		}
	}
	return i;
}

void Tset(int y,int x,int h,int w)
{
	for(int i=0;i<h;i++)
		for(int j=0;j<w;j++)
			B[y+i][x+j]=1;
}

void flsh()
{
	for(int i=0;;)
	{
		int j,f=cnt(i,0,5);
		if(!f)break;
		if(f==5)
		{
			int tmp=sizeof(char)*(6000*5-i*(5+1));
			memmove(B,B+1,sizeof(char)*100);
			res-=5;
		}
		else
			i++;
	}
}

int r()
{
	int res=0;
	for(int i=0;;i++)
	{
		int t=cnt(i,0,5);
		if(t==0)break;
		else if(t==5)continue;
		else res+=t;
	}
	return res;
}

int main()
{
	for(;scanf("%d",&N),N;)
	{
		int h=0,t;
		res=0;
		memset(B,0,sizeof(B));
		for(int i=0;i<N;i++)
		{
			scanf("%d%d%d",&d,&p,&q);
			res+=p;
			q--;
			t=sch(d==1?1:p,d==1?p:1,q,h);
			Tset(t,q,d==1?1:p,d==1?p:1);
			if(d==2)t+=p;
			else t++;
			h=max(t,h);
		}
		//dbg();
		printf("%d\n",r());
	}
}