не проходит по времени

[kostan3]

ЭТУ ЗАДАЧУ
вот мой код

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdlib>
#include <utility>
using namespace std;

#define forn(i, n) for(int i = 0; i < n; i++)

struct planet
{
short int from[3], to[3];
bool type;
};
struct q_st
{
vector <char> p;
int mask;
short int c, pass[3];
};

int in_q[2086014], st[22], nm;
short int tc, n;
vector <q_st> q[2];
char h;
planet p[22];

int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
scanf("%hd\n", &n);
st[0] = 1;
forn(i, 2086014) in_q[i] = -1;
forn(i, 21)
st[i + 1] = st[i] * 2;
q[0].resize(1);
q[0][0].mask = 0;
q[0][0].c = 0;
q[0][0].pass[0] = 0;
q[0][0].pass[1] = 0;
forn(i, n)
{
scanf("%c %hd %hd %hd %hd\n", &h, &p[i].to[0], &p[i].to[1], &p[i].from[0], &p[i].from[1]);
q[0][0].pass[0] += p[i].to[0];
q[0][0].pass[1] += p[i].to[1];
p[i].type = (h == 'C');
}
bool now = 0;
do
{
forn(i, q[now].size())
forn(j, n)
if((q[now][i].mask & st[j]) == 0)
{
nm = (q[now][i].mask | st[j]);
tc = q[now][i].c + q[now][i].pass[p[j].type] - p[j].to[p[j].type];
if(in_q[nm] == -1)
{
in_q[nm] = q[!now].size();
q[!now].resize(q[!now].size() + 1);
q[!now][in_q[nm]].c = 30000;
q[!now][in_q[nm]].mask = nm;
}
if(tc < q[!now][in_q[nm]].c)
{
q[!now][in_q[nm]].c = tc;
q[!now][in_q[nm]].pass[0] = q[now][i].pass[0] - p[j].to[0] + p[j].from[0];
q[!now][in_q[nm]].pass[1] = q[now][i].pass[1] - p[j].to[1] + p[j].from[1];
q[!now][in_q[nm]].p = q[now][i].p;
q[!now][in_q[nm]].p.push_back(j);
}
}
q[now].clear();
now = !now;
}
while(q[now].size() != 1);
printf("%hd 0 ", q[now][0].c);
forn(i, q[now][0].p.size())
printf("%hd ", q[now][0].p[i] + 1);
printf("0");
return 0;
}

но к сожалению пишит
21 тест Time limit exceeded 3,577 с память:23 Мб

[kostan3]

что она такая сложная?