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 <list>
#include <cstring>

using namespace std;

int main(int argc, char *argv[]) {
  list<char *>::iterator itr, bef;
  list<char *> space;
  int n, b, p, q;
  while (true) {
    space.push_back(new char[5]);
    itr = space.begin();
    memset(*itr, 0, sizeof(char)*5);
    cin >> n;
    if (n == 0)
      break;
    for (int i = 0; i < n; i++) {
      cin >> b >> p >> q;
      itr = space.begin();
      q--;
      if (b == 1) {//yoko                                                                                                                                                                                                                                                                                                                           
        while (true) {
          bool avail = true;
          for (int j = 0; j < p; j++)
            if((*itr)[q+j])
              avail = false;
          if (avail) {
            bef = itr;
            itr++;
            if (itr == space.end()) {
              for (int j = 0; j < p; j++)
                (*bef)[q+j] = 1;
              break;
            }
          } else if (!avail && itr == space.begin()) {
            space.push_front(new char[5]);
            bef = space.begin();
            memset(*bef, 0, sizeof(char)*5);
          } else {
            for (int j = 0; j < p; j++)
              (*bef)[q+j] = 1;
            break;
          }
        }
      } else {//tate                                                                                                                                                                                                                                                                                                                                
        bef = itr;
        while (!(*itr)[q] && itr != space.end())
          itr++;
        list<char *>::iterator tmp = itr;
        while (p > 0) {
          if (itr == space.begin())
            break;
          itr--;
          p--;
          (*itr)[q] = 1;
        }
        for (int j = 0; j < p; j++) {
          space.push_front(new char[5]);
          bef = space.begin();
          memset(*bef, 0, sizeof(char)*5);
          (*bef)[q] = 1;
        }
        itr = tmp;
      }
      while (bef != itr) {
        if ((*bef)[0] && (*bef)[1] && (*bef)[2] &&
            (*bef)[3] && (*bef)[4]) {
          list<char *>::iterator tmp = bef;
          tmp++;
          space.erase(bef);
          bef = tmp;
        } else {
          bef++;
        }
      }
    }
    int result = 0;
    for (list<char *>::iterator prt = space.begin();
         prt != space.end(); prt++) {
      for (int j = 0; j < 5; j++) {
        //cout << (int)(*prt)[j];                                                                                                                                                                                                                                                                                                                   
        if ((*prt)[j])
          result++;
      }
      /*if (prt == bef)                                                                                                                                                                                                                                                                                                                             
        cout << "<-bef";                                                                                                                                                                                                                                                                                                                            
      else if (prt == itr)                                                                                                                                                                                                                                                                                                                          
        cout << "<-itr";                                                                                                                                                                                                                                                                                                                            
        cout << endl;*/
    }
    cout << result << endl;
    space.clear();
  }
  return 0;
}

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

const int LIMIT = 5001;

int main()
{
	int n;

	while( cin >> n && n )
	{
		bool map[ LIMIT ][ 5 ] = {0};
		int h[ 5 ] = {0};
		for( int i = 0; i < n; ++i ){
			int d, p, q;
			cin >> d >> p >> q;
			q -= 1;

			int w = ( d == 1 ? p : 1 );
			int hh = 0;
			for( int i = 0; i < w; ++i ){
				hh = max( hh, h[ q + i ] );
			}
			if( d == 1 ){
				for( int i = 0; i < w; ++i ){
					map[ hh ][ q + i ] = true;
					h[ q + i ] = hh + 1;
				}
			}else{
				for( int i = 0; i < p; ++i ){
					map[ hh + i ][ q ] = true;
				}
				h[ q ] = hh + p;
			}

			for( int i = 0; i < 5; ++i ){
				hh = max( hh, h[ i ] );
			}
			for( int i = 0; i < hh; ++i ){
				bool full = true;
				for( int j = 0; j < 5; ++j ){
					if( !map[ i ][ j ] ){
						full = false;
						break;
					}
				}
				if( full ){
					for( int j = i; j < hh; ++j ){
						for( int k = 0; k < 5; ++k ){
							map[ j ][ k ] = map[ j + 1 ][ k ];
						}
					}
					for( int j = 0; j < 5; ++j ){
						int p = hh;
						while( p >= 0 && !map[ p ][ j ] ){
							--p;
						}
						h[ j ] = p + 1;
					}
					--hh;
					--i;
				}
			}
		}
		int hh = 0;
		for( int i = 0; i < 5; ++i ){
			hh = max( hh, h[ i ] );
		}
		int ans = 0;
		for( int i = 0; i < hh; ++i ){
			for( int j = 0; j < 5; ++j ){
				if( map[ i ][ j ] ) ++ans;
			}
		}
		cout << ans << endl;
	}

	return 0;
}