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+5; 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){
      ans -= 5;
      down(i);
      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++: /*
  Sample1:
  9
  1 1 1
  1 2 1
  1 3 1
  1 4 1
  1 3 1
  1 2 1
  1 1 1
  2 5 5
  2 5 4
  0
  Output:
  11

  Sample2:
  10
  1 4 1
  1 1 1
  1 4 1
  1 1 2
  1 4 1
  1 1 3
  1 4 1
  1 1 4
  2 5 5
  2 5 5
  0
  Output:
  10

  memorandum:
  ブロックが消えた後に横に５つそろった場合それも消す（定番）　　　　 
  横の列が消えた場合、消えた行の上のブロックはそのままの形で１行下にしずむ
  ^^^^^
  つっかかるまでひたすら落とさないように注意
  入力が与えられるたびにこれらの処理をする
  Sample Inputの３つめが６になるのはすべて落ちた後に消す処理をしたからではなくブロックが沈むは１行のみだったため
*/

#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<28)
 
using namespace std;
typedef pair<int,int> ii;
int field[5010][5];
int top[5];
int n,d,p,q;
vector<ii> input;
 
bool checkX(int y)
{
  rep(x,5)if(!field[y][x])return false;
  return true;
}
 
void updateD(int x,int y)
{
  ii info = input[field[y][x]];
  if(info.first == 1)
    {//yoko
      //while(true)//ここのwhileをもどせばつっかかるまで落ちる
      //{
      bool check = true;
      rep(i,5)
        {
          if(field[y][x] != field[y][i])continue;
          if(y-1 >= 0 && field[y-1][i] != 0)
	    {
	      check = false;
	      break;
	    }
        }
      if(!check)return;
      int v = field[y][x];
      rep(i,5)
        {
          if(v != field[y][i])continue;
          assert(field[y-1][i] == 0);
          field[y-1][i] = field[y][i];
          field[y][i] = 0;
        }
      y = y-1;
      if(y <= 0)return;
      //}
    }
  else
    {
      int v = field[y][x];
     
      int bot = 0;
      int py = y;
      while(py-1 >= 0 && field[py-1][x] == 0)py--;
      bot = y-py;
 
      if(bot == 0)return;
      bot = 1;//ここをbotのままにすればつっかかるまでおちる
      while(v == field[y][x])
	{
	  assert(y-bot >= 0);
	  assert(field[y-bot][x] == 0);
	  field[y-bot][x] = field[y][x];
	  field[y][x] = 0;
	  y++;
	}
     
    }
}
 
int main()
{
  while(cin >> n,n)
    {
      input.clear();
      input.resize(1010,ii(-1,-1));
      rep(i,5010)rep(j,5)field[i][j] = 0;
      rep(i,5)top[i] = 0;
      REP(i,1,n+1)
	{
	  cin >> d >> p >> q;
	  if(d == 1 && p == 5)continue;
	  q--;
	  input[i] = ii(d,p);
	  int cyb,cyt;
	  if(d == 2)
	    {
	      cyb = top[q],cyt = top[q]+p;
	      REP(j,top[q],top[q]+p)field[j][q] = i;
	      top[q] += p;
	    }
	  else
	    {
	      int mexico = -inf;
	      REP(j,q,q+p)mexico = max(mexico,top[j]);
	      REP(j,q,q+p)field[mexico][j] = i;
	      cyb = cyt = mexico;
	      REP(j,q,q+p)top[j] = mexico+1;
	    }
 
      bool update = true;
      while(update)
	{
	  update = false;
	  vector<int> erasedY;
	  REP(y,cyb,cyt+1)
	    {
	      if(checkX(y))
		{
		  update = true;
		  erasedY.push_back(y);
		  rep(x,5)field[y][x] = 0;
		}
	    }
 
	  //down
	  if(!erasedY.empty())
	    {
 
 
	      int yt = 0;
	      rep(j,5)yt = max(yt,top[j]);
	      rep(j,erasedY.size())
		{
		  REP(y,erasedY[j],yt)
		    {
		      int pre = -1;
		      rep(x,5)
			{
			  if(field[y][x] == pre)continue;
			  if(field[y][x] == 0 || y-1 < 0)continue;
 
			  pre = field[y][x];
			  updateD(x,y);
			}
		    }
		}
 
 
	    }
      
	  //update top
	  rep(j,5)
	    {
	      int y = top[j];
	      while(y >= 0 && field[y][j] == 0)y--;
	      top[j] = y+1;
	    }
      
	}
    }

      int yt = 0;
      rep(i,5)yt = max(yt,top[i]);
      int ans = 0;
      rep(y,yt)
	rep(x,5)
	if(field[y][x] != 0)ans++;    
      cout << ans << endl;
    }
  return 0;
}