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>
using namespace std;
#define MAX 5000
class Tetoris{
    public:
    int stack[MAX+1], top;
    Tetoris(){ stack[0] = 31; top = 0; }
    
    void insert( int o, int p, int q ){
	int value = (o == 1 ? (((2 << p-1)-1) << (q-1)) : (1 << (q-1)));
        int target = getTarget( value );
        for ( int i = target;  i < target + ((o == 2) ? p : 1); i++ ){
            if ( i > top ){
                stack[i] = value;
                top = i;
            } else {
		stack[i] += value;
	    }
	}
        while( erase());
    }
    
    bool erase(){
	for ( int i = 1; i <= top; i++ ){
	    if ( stack[i] == 31 ){
		for ( int j = i+1; j <= top; j++ ) stack[j-1] = stack[j];
		top--; return true;
	    }
	}
	return false;
    }
    
    int getResult(){
	int sum = 0;
	for ( int i = top; i >= 1; i-- ){
	    int val = stack[i];
	    while( val ){
		if ( val%2 ) sum++;
		val /= 2;
	    }
	}
	return sum;
    }
    
    int getTarget( int value ){
	int target = top;
	while( (stack[target] & value) == 0 ) target--;
	return target + 1;
    }
};

int main(){
    int n, o, p, q;
    while( cin >> n && n ){
	Tetoris tetoris;
	for ( int i = 0; i < n; i++ ) {
	    cin >> o >> p >> q;
	    tetoris.insert(o, p, q);
	}
	cout << tetoris.getResult() << endl;
    }
    return 0;
}

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

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)

int n, hmax;
bool maps[6000][5];

int serch(int x, int l) {
	for (int i = hmax; i >= 0; i--) {
		REP(j, l) if (maps[i][x + j]) return i + 1;
	}
	return 0;
}

int check(int y, int l) {
	REP(i, l) {
		bool flag = true;
		REP(j, 5) if (!maps[y + i][j]) flag = false;
		if (flag) return y + i;
	}
	return -1;
}

void bset(int d, int p, int q) {
	int hl = d == 2 ? p : 1;
	int xl = d == 1 ? p : 1;
	int hpos = serch(q - 1, xl);
	
	if (d == 1) REP(i, p) maps[hpos][q + i - 1] = true;
	else REP(i, p) maps[hpos + i][q - 1] = true;
	hmax = max(hmax, hpos + hl);
	
	int tmp;
	while ((tmp = check(hpos, hl)) != -1) {
		REP(i, 5) maps[tmp][i] = false;
		FOR(i, tmp, hmax) {
			REP(j, 5) swap(maps[i][j], maps[i + 1][j]);
		}
		hmax--;
	}
}

int main() {
	while (cin >> n, n) {
		memset(maps, 0, sizeof(maps));
		hmax = 0;
		
		while (n--) {
			int d, p, q;
			scanf("%d %d %d", &d, &p, &q);
			bset(d, p, q);
		}
		cout << count(maps[0], maps[6000], true) << endl;
	}
	return 0;
}

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

using namespace std;

int n, d, p, q;

int main()
{
    while(true)
    {
        cin >> n;
        
        if(n == 0) { break; }
        
        vector<vector<bool> > c(5000, vector<bool>(5, false));
        
        for(int i = 0; i < n; i++)
        {
            cin >> d >> p >> q;
            
            if(d == 1)
            {
                int maxh = -1;
                
                for(int j = p - 1; j < p + q - 1; j++)
                {
                    int r = 5000;
                    
                    while(r--)
                    {
                        if(c[r][j] == true)
                        {
                            break;
                        }
                    }
                    
                    maxh = max(maxh, r + 1);
                }
                
                for(int j = p - 1; j < p + q - 1; j++)
                {
                    c[maxh][j] = true;
                }
            }
            else
            {
                int r = 5000;
            
                while(r--)
                {
                    if(c[r][p] == true)
                    {
                        break;
                    }
                }   
                
                for(int j = r + 1; j < r + q + 1; j++)
                {
                    c[j][p] = true;
                }
            }   
            
            for(int j = 0; j < 5000; i++)
            {
                if(c[j][0] == c[j][1] && c[j][1] == c[j][2] && c[j][2] == c[j][3] && c[j][3] == c[j][4])
                {
                    for(int k = j + 1; k < 5000; k++)
                    {
                        for(int l = 0; l < 5; l++)
                        {
                            c[k - 1][l] = c[k][l];
                        }
                    }
                }
            }
        }    
    
        int sum = 0;
    
        for(int i = 0; i < 5000; i++)
        {
            for(int j = 0; j < 5; j++)
            {
                sum += (c[j][p] ? 1 : 0);
            }
        }
        
        cout << sum << endl;
    }
    
    return 0;
}

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,100000) 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;
				}
				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;
	}
}