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<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<list>

using namespace std;

#define int long long

list<bool*> fld;

list<bool*>::iterator GetHeight(int l, int r)
{
	list<bool*>::iterator itr = fld.begin();
	//fld.push_front((bool*)new bool[5]{});
	for (; itr != fld.end(); itr++)
	{
		for (int j = l; j < r; j++)
		{
			if ((*itr)[j] == true) return --itr;
		}
	}
	return --itr;
}

bool IsFull(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == false) return false;
	}
	return true;
}

bool IsEmpty(list<bool*>::iterator itr)
{
	for (int i = 0; i < 5; i++)
	{
		if ((*itr)[i] == true) return false;
	}
	return true;
}

void Drop(int d, int p, int q)
{
	if (!IsEmpty(fld.begin())) fld.push_front((bool*)new bool[5]{});
	int l = q - 1, r = (d == 1) ? l + p : l + 1;
	list<bool*>::iterator itr = GetHeight(l, r);

	int h = (d == 1) ? 1 : p;
	for (int i = 0; i < h; i++)
	{
		if (itr == fld.begin()) fld.push_front((bool*)new bool[5]{});
		for (int j = l; j < r; j++)
		{
			(*itr)[j] = true;
		}
		if (IsFull(itr))
		{
			delete *itr;
			itr = fld.erase(itr);
		}
		itr--;
	}
}

signed main()
{
	int N;
	while (cin >> N, N)
	{
		fld.clear();
		fld.push_back((bool*)new bool[5]{});
		for (int i = 0; i < N; i++)
		{
			int d, p, q;
			cin >> d >> p >> q;
			Drop(d, p, q);
		}
		int ans = 0;
		for (list<bool*>::iterator itr = fld.begin(); itr != fld.end(); itr++)
		{
			for (int i = 0; i < 5; i++)
			{
				ans += ((*itr)[i] == true);
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}

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

#define	pb	push_back

using namespace std;

typedef	vector<int>	vi;

char field[5050];

bool vanish(int u,int l){
	vi rem;
	for(int i=l;i>=u;i--){
		if((field[i]&=31)!=31)	rem.pb(i);
	}
//printf("rem=%d\n",rem.size());
	int rnum=rem.size(),h=l-u+1;
	if(rnum!=l){
		for(int i=0;i<rnum;i++)	field[l-i]=field[rem[i]];
		for(int i=u-1;i>=0;i--)	field[h-rnum+i]=field[i];
		for(int i=0;i<rnum;i++)	field[i]=0;
	}
}

int main(){
	for(int n;scanf("%d",&n),n;){
		for(int i=0;i<5050;i++)	field[i]=0;
		for(int t=0;t<n;t++){
			int type,len,p;	scanf("%d%d%d",&type,&len,&p);
			p--;

			char blk;
			if(type==1)	blk=((1<<len)-1)<<(5-p-len);
			else		blk=1<<(4-p);

			for(int i=0;i<=5050;i++){
				if(i==5050 || (field[i]&blk)!=0){
					if(type==1){
						field[i-1]|=blk;
						vanish(i-1,i-1);
					}
					else{
						for(int j=1;j<=len;j++)	field[i-j]|=blk;
						vanish(i-len,i-1);
					}
					break;
				}
			}
//for(int i=4992;i<5000;i++){for(int j=0;j<5;j++)putchar(field[i]&(1<<4-j)?'@':'.');puts("");}puts("");
		}

		int cnt=0;
		for(int i=0;i<5050;i++){
			for(int j=0;j<5;j++)	if(field[i]&(1<<j))	cnt++;
		}
		printf("%d\n",cnt);
	}

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <list>

using namespace std;

#define inf 1e9 + 7

/* 
typedef struct Node {
  int id;
  int score;
  Node *right;
  Node *left;
};
*/

vector<vector<int>> grid(5010, vector<int>(5, 0));
vector<int> ma(5, 0);

void check(int start , int end){
  // endは含まれない

  for(int i = end - 1; i >= start; i--){
    bool vanish = true;
    for(int j = 0; j < 5; j++){
      if(grid[i][j] != 1){
        vanish = false;
        break;
      }
    }
    if(vanish){
      //cout << "消す " << i << "行目" << endl;
      // 消す
      for(int j = 0; j < 5; j++){
        grid[i][j] = inf;
        // 最大値更新

        if(ma[j] == i + 1){

          // 下の1まで下がる
          for(int k = i - 1; k >= 0; k--){
            if(grid[k][j] == 1){
              ma[j] = k + 1;
              break;
            }
            if(k == 0) ma[j] = 0; 
          }

        }

      }

    }
  }
}

int main(){

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

    // 初期化
    for(int i = 0; i < 5010; i++){
      for(int j = 0; j < 5; j++){
        grid[i][j] = 0;
      }
    }
    for(int j = 0; j < 5; j++) ma[j] = 0;

    vector<int> d(n), p(n), q(n);
    for(int i = 0; i < n; i++) cin >> d[i] >> p[i] >> q[i];

    for(int i = 0; i < n; i++){
      if(d[i] == 1){ // 横
        int ster = 0;
        for(int j = q[i] - 1; j < q[i] - 1 + p[i]; j++){
          ster = max(ster,ma[j]);
        }
        // sterのとこにおく
        while(grid[ster][q[i] - 1] == inf){
          ster++;
        }
        for(int j = q[i] - 1; j < q[i] - 1 + p[i]; j++){
          grid[ster][j] = 1;
          ma[j] = ster + 1;
        }
        check(ster, ster + 1);
      }
      else{ // 縦
        int ster = ma[q[i] - 1];
        while(grid[ster][q[i] - 1] == inf) ster++;
        int cnt = 0;
        for(int j = 0; j < p[i]; j++){
          if(grid[ster+j+cnt][q[i] - 1] == inf){
            cnt++;
            j--;
            continue;
          }
          grid[ster + cnt + j][q[i] - 1] = 1;
        }
        ma[q[i] - 1] = ster + p[i] + cnt;
        check(ma[q[i] - 1] - p[i] - ster - cnt, ma[q[i] - 1] + cnt);
      }
    }

    int ans = 0;
    for(int i = 5010 - 1; i >= 0; i--){
      for(int j = 0; j < 5; j++){
        //cout << grid[i][j] << " ";
        if(grid[i][j] == 1) ans++;
      }
      //cout << endl;
    }

    cout << ans << endl;
  }

  return 0;
}