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>
#define N 10020
using namespace std;
int main(){
  while(true){
    int n;
    int ans=0;
    scanf("%d",&n);

    if(n==0)break;
    int row[N]={0,};
    int h[5]={0,};
    for(int i = 0; i < n; ++i){
      int mh = 0;
      int d,p,q;
      scanf("%d%d%d", &d, &p, &q);
      --q;
      
      if(d==1){
	int maxh = 0;
	for(int j = q; j < q + p; ++j){
	  maxh = max( maxh, h[j] );
	}
	for(int j = q; j < q + p; ++j){
	  h[j] = maxh + 1;
	}
	row[maxh]+=p;
      }else{
	for(int j = h[q]; j < p + h[q]; ++j){
	  ++row[ j ];
	}
	h[q]+=p;
      }

      // cout << " DROPPED : " << i << endl;
      for(int j = 0; j < 5; ++j){
	mh = max( mh , h[j] );
      }

      for(int j = 0; j < mh; ++j){
	// cout << " row["<<j<<"] = " << row[j] << endl;
	if( row[j] == 5 ){
	  for(int k = 0; k < 5; ++k){
	    --h[k];
	    if(h[k]<0)h[k]=0;
	  }
	  for(int k = j; k < mh+2; ++k){
	    row[k] = row[k + 1];
	  }
	  j = -1;
	  continue;
	}
      }
    }
    for(int i = 0; i < N; ++i){
      ans += row[i];
    }
    printf("%d\n",ans);
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#define H_MAX 1001
using namespace std;

void breakLine(int data[H_MAX][5], int y) {
  for(int i = y; i+1 < H_MAX; i++) {
    for(int j = 0; j < 5; j++) {
      data[i][j] = data[i+1][j];
    }
  }
}

void search(int data[H_MAX][5], int sy, int ey) {
  for(int i = sy; i <= ey; i++) {
    bool flag = true;
    for(int j = 0; j < 5; j++) {
      if(data[i][j] != 1) {
	flag = false;
	break;
      }
    }
    if(flag) {
      breakLine(data, i);
      i--;
    }
  }
}

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

    int data[H_MAX][5];
    //fill(&data[0][0], &data[H_MAX-1][4] + 1, 0);
    for(int i = 0; i < H_MAX; i++) {
      for(int j = 0; j < 5; j++) {
	data[i][j] = 0;
      }
    }
    for(int i = 0; i < 5; i++) {
      data[0][i] = 1;
    }

    for(int i = 0; i < n; i++) {
      int d, p, q, qy;
      cin >> d >> p >> q;
      q--;
      for(int y = H_MAX-1; y >= 0; y--) {
	bool put = false;
	switch(d) {
	case 1:
	  for(int j = 0; j < p; j++) {
	    if(data[y][q+j] == 1) {
	      put = true;
	      y++;
	      qy = y;
	      for(int k = 0; k < p; k++) {
		data[y][q+k] = 1;
	      }
	      break;
	    }
	  }
	  break;
	case 2:
	  if(data[y][q] == 1) {
	    put = true;
	    y++;
	    qy = y;
	    for(int j = 0; j < p; j++) {
	      data[y+j][q] = 1;
	    }
	  }
	  break;
	}
	if(put) {
	  break;
	}
      }

      switch(d) {
      case 1: search(data, qy, qy); break;
      case 2: search(data, qy, qy+p-1); break;
      }
    }

    int count = 0;
    for(int i = 1; i < H_MAX; i++) {
      for(int j = 0; j < 5; j++) {
	count += data[i][j];
      }
    }
    cout << count << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

char stage[2][5001][5];

void place(int *height, int col, int d, int len, int pos, int turn)
{
    if (len == 0) return;
    if (d == 1){
        int mh = *max_element(height + pos, height + pos + len);
        for (int j = pos; j < pos + len; j++){
            stage[turn][mh][j] = col;
            height[j] = mh + 1;
        }
    }
    else {
        for (int j = 0; j < len; j++){
            stage[turn][height[pos]++][pos] = col;
        }
    }
    return;
}

int main()
{
    int n;
    
    while (scanf("%d", &n) && n){
        int height[5] = {0};
        int d[1001] = {0}, len[1001] = {0}, pos[1001] = {0};
        
        memset(stage, 0, sizeof(stage));
        
        for (int i = 1; i <= n; i++){
            scanf("%d %d %d", d + i, len + i, pos + i); --pos[i];
            place(height, i, d[i], len[i], pos[i], 0);
        }
        
        int turn = 0;
        for (int i = 0; i < n; i++){
            int ht = *max_element(height, height + 5);
            
            for (int j = 0; j < ht; j++){
                bool ok = true;
                for (int k = 0; k < 5; k++){
                    stage[1 - turn][j][k] = 0;
                    if (!stage[turn][j][k]) ok = false;
                }
                if (ok){
                    for (int k = 0; k < 5; k++){
                        len[stage[turn][j][k]]--;
                    }
                }
            }
            
            memset(height, 0, sizeof(height));
            for (int j = 1; j <= n; j++){
                place(height, j, d[j], len[j], pos[j], 1 - turn);
            }
            turn = 1 - turn;
        }
        
        int ret = 0;
        int h = *max_element(height, height + 5);
        for (int i = 0; i < h; i++){
            for (int j = 0; j < 5; j++){
                ret += !!stage[turn][i][j];
            }
        }
        
        printf("%d\n", ret);
    }
    
    return (0);
}