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 <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back 
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int grid[5][5010];
int n,d,p,q;
ll int ans = 0;

int GetBottom(int x){
	REP(i,5000){
		if(grid[x][i]==-1) return i;
	}
	return -1;
}

bool isallclear(int x){
	REP(i,5){
		if(grid[i][x]!=-1) return false;
	}
	return true;
}

bool isallblock(int x){
	REP(i,5){
		if(grid[i][x]!=1) return false;
	}
	return true;
}

int main(){
	while(1){
		cin >> n;
		REP(i,5) REP(j,5000) grid[i][j] = -1;
		REP(i,n){
			cin >> d >> p >> q;
			if(d==2){
				int tmp = GetBottom(q-1);
				FOR(j,tmp,tmp+p) grid[q-1][j] = 1;
			}else{
				int tmp = -1;
				FOR(j,q-1,q-1+p){
					tmp = max(tmp,GetBottom(j));
				}
				FOR(j,q-1,q-1+p) {
					grid[j][tmp] = 1;
					REP(k,tmp) if(grid[j][k]==-1) grid[j][k] = 0;
				}
			}
			int nowline = 0;
			while(1){
				if(isallclear(nowline)) break;
				if(isallblock(nowline)){
					REP(j,5) {
						grid[j][nowline] = 0;
						int nline = nowline+1;
						while(1){
							if(grid[j][nline]==-1) break;
							grid[j][nline-1] = grid[j][nline];
							nline++;
						}
					}
				}
				nowline++;

			}
		}
		ans = 0;
		int line = 0;
		while(1){
			if(isallclear(line)) break;
			REP(i,5){
				if(grid[i][line]==1) ans++;
			}
			line++;
		}
		cout << ans << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

const int H = 6000;
const int W = 5;
int G[H][W];

int main() {
  int n;
  while(cin >> n && n) {
    fill(G[0], G[H], 0);
    while(n--) {
      /*
      for(int i = H-8; i < H; ++i) {
        for(int j = 0; j < W; ++j) {
          cout << G[i][j];
        }
        cout << endl;
      }
      cout << endl;
      */
      int d, p, q;
      cin >> d >> p >> q;
      --q;
      vector<int> x;
      if(d == 1) {
        for(int j = 0; j < p; ++j) {
          x.push_back(q+j);
        }
      } else {
        x.push_back(q);
      }
      int y = H-1;
      try {
        for(int i = 0; i < H; ++i) {
          for(int j = 0; j < x.size(); ++j) {
            if(G[i][x[j]]) {
              y = i-1;
             throw 0;
            }
          }
        }
      } catch(...) {}
      if(d == 1) {
        for(int j = 0; j < x.size(); ++j) {
          G[y][x[j]] = 1;
        }
      } else {
        for(int j = 0; j < p; ++j) {
          G[y-j][x[0]] = 1;
        }
      }
      for(int i = H-1, y = H-1; i >= 0; --i, --y) {
        bool allBlock = true;
        for(int j = 0; j < W; ++j) {
          if(!G[i][j]) {
            allBlock = false;
            break;
          }
        }
        if(allBlock) {
          ++y;
        } else {
          for(int j = 0; j < W; ++j) {
            G[y][j] = G[i][j];
            if(y != i) G[i][j] = 0;
          }
        }
      }
    }
    int res = 0;
    for(int i = 0; i < H; ++i) {
      for(int j = 0; j < W; ++j) {
        res += G[i][j];
      }
    }
    cout << res << endl;
  }
  return 0;
}

C++: 
#include <iostream>
#include <vector>
#include <cstring>

using namespace std;

int n;

typedef struct Block
{
	int d;
	int p;
	int q;
} B;

int F[5000][5];
int H[5];

B blocks[1000];

int highest(int r, int l)
{
	int max = 0;
	for(int i=r; i<l; i++)
	{
		if(max < H[i])
		{
			max =H[i];
		}
	}
	return max;
}

void yoko_set(B b)
{
	int hp = highest(b.q, b.p+b.q);
	for(int i=b.q; i<b.p+b.q; i++)
	{
		F[hp][i] =1;
		H[i] = hp+1;
	}
}

void tate_set(B b)
{
	int hp = H[b.q];
	for(int i=hp; i<hp+b.p; i++)
	{
		F[i][b.q] = 1;
	}
	H[b.q] = hp+b.p;
}

void col_clear()
{
	
	int hp = highest(0, 5);
	bool is_ok = false;
	vector<int> cols;
	for(int i=0; i<=hp; i++)
	{
		is_ok =true;
		for(int j=0; j<5; j++)
		{
			if(F[i][j]==1) continue;
			is_ok = false;
			break;
		}
		
		if(is_ok)
		{
			cols.push_back(i);
		}
	}
	
	if(cols.empty()) return;
	
	int c = 0;
	for(int i=0; i<hp; i++)
	{
		if(cols[c]==i)
		{
			c++;
			continue;
		}
		
		for(int j=0; j<5; j++)
		{
			F[i-c][j] = F[i][j];
		}
	}
	
	for(int i=hp-cols.size(); i<hp; i++)
	{
		for(int j=0; j<5; j++)
		{
			F[i][j] = 0;
		}
	}
	
	for(int i=0; i<5; i++)
	{
		H[i] -= cols.size();
	}
}

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--;
		}
		
		memset(&F[0][0], 0, sizeof(int)*25000);
		memset(&H[0], 0, sizeof(int)*5);
		
		for(int i=0; i<n; i++)
		{
			if(blocks[i].d == 2)
			{
				tate_set(blocks[i]);
			}
			else
			{
				yoko_set(blocks[i]);
			}
			
			col_clear();
		}
		
		int hp = highest(0, 5);
		int c = 0;
		for(int i=0; i<hp; i++)
		{
			for(int j=0; j<5; j++)
			{
				if(F[i][j]==1) c++;
			}
		}
		cout << c<< endl;
	}
	
	return 0;
}