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 = 5010;
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+2; i++)
    for(int j = 0; j < Width; j++) field[i][j] = field[i+1][j];
  top--;
}

void erase(){
  while(1){
    bool update = false;
    for(int i = 0; i <= top+2; i++){
      bool f = true;
      for(int j = 0; j < Width; j++) if(field[i][j] == '?') f = false;
      if(f){
	ans -= 5;
	down(i--);
	update = true;
      }
    }
    if(!update) break;
  }
}
 
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(5,5);
  }
  return 0;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"

int fall(vector<vector<int>>&field, vector<vector<int>>&pino,int l) {
	{

	}
	int y = 0;
	for ( y = 0; y < field.size() - pino.size(); ++y) {
		bool ok = true;
		for (int i = 0; i < pino.size(); ++i) {
			for (int j = 0; j < pino[i].size(); ++j) {
				if (pino[i][j]) {
					if (field[y + i+1][l + j])ok = false;
				}
			}
		}
		if (!ok||y+pino.size()-1==field.size()) {
			break;
		}
	}
	for (int i = 0; i < pino.size(); ++i) {
		for (int j = 0; j < pino[i].size(); ++j) {
			if (pino[i][j]) {
				assert(!field[y + i][l + j]);
				field[y + i][l + j] = true;
			}
		}
	}
	int delline = 0;
	for (int i = y + pino.size() - 1; i >= y; --i) {
		if (all_of(field[i].begin(), field[i].end(), [](const int a) {return a == 1; })) {
			transform(field[i].begin(), field[i].end(), field[i].begin(), [](const int a) {return false; });
			for (int j = i- 1; j >= 0; --j) {
				swap(field[j], field[j + 1]);
			}
			delline += 1;
		}
	}
	return delline;
}

int main() {
	while (1) {
		int N; cin >> N;
		int sum = 0;
		vector<vector<int>>field(5*N+10, vector<int>(5));
		for (int i = 0; i < N; ++i) {
			int d, p, q; cin >> d >> p >> q; q--;
			int w = d == 2 ? 1 : p;
			int h = d == 1 ? 1 : p;
			sum += p;
			vector<vector<int>>pino(h, vector<int>(w, 1));
			sum -= fall(field, pino, q) * 5;
		}
		cout << sum << endl;
	}
	
	return 0;
}

C++: // 2011/08/10 Tazoe

#include <iostream>
using namespace std;

class Tetoris{
	private:
		int stack[5001][5];
		int top;
	public:
		Tetoris();
		void insert(int d, int p, int q);
		bool erase();
		int getResult();
		void printStack();
};

Tetoris::Tetoris()
{
	for(int i=0; i<=5000; i++)
		for(int j=0; j<5; j++)
			if(i==0)
				stack[i][j] = 1;
			else
				stack[i][j] = 0;

	top = 0;
}

void Tetoris::insert(int d, int p, int q)
{
	if(d==1){
		int target;
		bool flg = false;
		for(int i=top; i>=0; i--){
			for(int j=0; j<p; j++){
				if(stack[i][q-1+j]!=0){
					target = i+1;
					flg = true;
					break;
				}
			}
			if(flg)
				break;
		}
		for(int j=0; j<p; j++)
			stack[target][q-1+j] = 1;
		if(top<target)
			top = target;
	}
	else{
		int target;
		for(int i=top; i>=0; i--)
			if(stack[i][q-1]!=0){
				target = i+1;
				break;
			}
		for(int i=0; i<p; i++)
			stack[target+i][q-1] = 1;
		if(top<target+p-1)
			top = target+p-1;
	}

	while(erase())
		;
}

bool Tetoris::erase()
{
	for(int i=1; i<=top; i++)
		if(stack[i][0]==1&&stack[i][1]==1&&stack[i][2]==1&&stack[i][3]==1&&stack[i][4]==1){
			for(int ii=i+1; ii<=top; ii++){
				stack[ii-1][0] = stack[ii][0];
				stack[ii-1][1] = stack[ii][1];
				stack[ii-1][2] = stack[ii][2];
				stack[ii-1][3] = stack[ii][3];
				stack[ii-1][4] = stack[ii][4];
			}
			top--;
			return true;
		}

	return false;
}

int Tetoris::getResult()
{
	int sum = 0;
	for(int i=top; i>=1; i--)
		for(int j=0; j<5; j++)
			if(stack[i][j]==1)
				sum++;

	return sum;
}

void Tetoris::printStack()
{
	for(int i=top; i>=1; i--){
		for(int j=0; j<5; j++)
			cout << stack[i][j];
		cout << endl;
	}
}

int main()
{
	while(true){
		int n;
		cin >> n;
		if(n==0)
			break;

		Tetoris tetoris;
		for(int i=0; i<n; i++){
			int d, p, q;
			cin >> d >> p >> q;
			tetoris.insert(d, p, q);
		}

//		tetoris.printStack();
		cout << tetoris.getResult() << endl;
	}

	return 0;
}