int traceV(int i, int j) {
int a, b, c, d, Vij;
if (j-i < TURN) return INFINITY_;
a = canHairpin(i,j)?eH(i, j):INFINITY_;
b = canStack(i,j)?eS(i, j) + V(i + 1, j - 1):INFINITY_;
c = canStack(i,j)?VBI(i,j):INFINITY_;
d = canStack(i,j)?VM(i,j):INFINITY_;
Vij = V(i,j);
structure[i] = j;
structure[j] = i;
if (Vij == a ) {
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d Hairpin %12.2f\n", i, j, eH(i, j)/100.00);
total_en += eH(i,j);
return Vij;
} else if (Vij == b) {
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d Stack %12.2f\n", i, j, eS(i, j)/100.00);
total_en += eS(i,j);
traceV(i + 1, j - 1);
return Vij;
} else if (Vij == c) {
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d IntLoop ", i, j);
traceVBI(i, j);
return Vij;
} else if (Vij == d) {
int eVM = traceVM(i, j);
if (print_energy_decompose ==1) fprintf(energy_decompose_outfile, "i %5d j %5d MultiLoop %12.2f\n", i, j, (Vij-eVM)/100.0);
total_en += (Vij-eVM);
return Vij;
}
return 0;
}
void traceW(int j) {
int done = 0, i;
int wim1, flag = 1 ;
if (j == 0 || j == 1)
return;
for (i = 1; i < j && !done; i++) {
if (j-i < TURN) continue;
wim1 = MIN(0, W[i-1]);
flag = 1;
if ( wim1 != W[i-1] && canSSregion(0,i)) flag = 0;
if (g_unamode||g_mismatch) {
if ((W[j] == V(i,j) + auPenalty(i, j) + wim1 && canStack(i,j)) || forcePair(i,j)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i, j, auPenalty(i, j)/100.00);
total_ex += auPenalty(i, j);
traceV(i, j);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i,j-1) + auPenalty(i,j-1) + Ed5(j-1,i,j) + wim1 && canSS(j) && canStack(i,j-1)) || forcePair(i, j-1)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i, j-1, (auPenalty(i,j-1) + Ed5(j-1,i,j))/100.00);
total_ex += (auPenalty(i,j-1) + Ed5(j-1,i,j));
traceV(i, j - 1);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i+1,j) + auPenalty(i+1,j) + Ed3(j,i+1,i) + wim1 && canSS(i) && canStack(i+1,j)) || forcePair(i+1,j)){
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i+1, j, (auPenalty(i+1,j) + Ed3(j,i+1,i))/100.00);
total_ex += (auPenalty(i+1,j) + Ed3(j,i+1,i));
traceV(i + 1, j);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i+1,j-1) + auPenalty(i+1, j-1) + Estacke(j-1,i+1) + wim1 && canSS(i) && canSS(j) && canStack(i+1,j-1)) || forcePair(i+1,j-1)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i+1, j-1, (auPenalty(i+1, j-1) + Estacke(j-1,i+1))/100.00);
total_ex += (auPenalty(i+1, j-1) + Estacke(j-1,i+1));
traceV(i + 1, j - 1);
if (flag ) traceW(i - 1);
break;
}
} else if (g_dangles == 2) {
int e_dangles = 0;
if (i>1) e_dangles += Ed3(j,i,i-1);
if (j<length) e_dangles += Ed5(j,i,j+1);
if ((W[j] == V(i,j) + auPenalty(i, j) + e_dangles + wim1 && canSS(i) && canSS(j) && canStack(i+1,j-1)) || forcePair(i+1,j-1)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i+1, j-1, (auPenalty(i, j) + e_dangles)/100.00);
total_ex += (auPenalty(i, j) + e_dangles);
traceV(i, j);
if (flag ) traceW(i - 1);
break;
}
} else if (g_dangles == 0) {
if ((W[j] == V(i,j) + auPenalty(i, j) + wim1 && canStack(i,j)) || forcePair(i,j)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i, j, auPenalty(i, j)/100.00);
total_ex += auPenalty(i, j);
traceV(i, j);
if (flag ) traceW(i - 1);
break;
}
} else { // default
if ((W[j] == V(i,j) + auPenalty(i, j) + wim1 && canStack(i,j)) || forcePair(i,j)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i, j, auPenalty(i, j)/100.00);
total_ex += auPenalty(i, j);
traceV(i, j);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i,j-1) + auPenalty(i,j-1) + Ed5(j-1,i,j) + wim1 && canSS(j) && canStack(i,j-1)) || forcePair(i, j-1)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i, j-1, (auPenalty(i,j-1) + Ed5(j-1,i,j))/100.00);
total_ex += (auPenalty(i,j-1) + Ed5(j-1,i,j));
traceV(i, j - 1);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i+1,j) + auPenalty(i+1,j) + Ed3(j,i+1,i) + wim1 && canSS(i) && canStack(i+1,j)) || forcePair(i+1,j)){
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i+1, j, (auPenalty(i+1,j) + Ed3(j,i+1,i))/100.00);
total_ex += (auPenalty(i+1,j) + Ed3(j,i+1,i));
traceV(i + 1, j);
if (flag ) traceW(i - 1);
break;
} else if ((W[j] == V(i+1,j-1) + auPenalty(i+1, j-1) + Ed3(j-1,i+1,i) + Ed5(j-1,i+1,j) + wim1 && canSS(i) && canSS(j) && canStack(i+1,j-1)) || forcePair(i+1,j-1)) {
done = 1;
if (print_energy_decompose == 1) fprintf(energy_decompose_outfile, "i %5d j %5d ExtLoop %12.2f\n", i+1, j-1, (auPenalty(i+1, j-1) + Ed3(j-1,i+1,i) + Ed5(j-1,i+1,j))/100.00);
total_ex += (auPenalty(i+1, j-1) + Ed3(j-1,i+1,i) + Ed5(j-1,i+1,j));
traceV(i + 1, j - 1);
if (flag ) traceW(i - 1);
break;
}
}
}
if (W[j] == W[j - 1] && !done) traceW(j-1);
//if (!done) {
// fprintf(stderr, "ERROR: W(%d) could not be traced\n", j);
//}
return;
}
int traceWM(int i, int j) {
assert(i < j);
int done=0, eWM=0;
if (!done && WM(i,j) == WMPrime[i][j]) {
eWM += traceWMPrime(i,j);
done = 1;
}
if (!done){
if (g_unamode||g_mismatch) {
if (WM(i,j) == V(i,j) + auPenalty(i, j) + Eb && canStack(i,j)) {
eWM += traceV(i, j);
done = 1;
} else if (WM(i,j) == V(i+1, j) + Ed3(j,i + 1,i) + auPenalty(i+1, j) + Eb + Ec && canSS(i) && canStack(i+1,j)) {
eWM += traceV(i + 1, j);
done = 1;
} else if (WM(i,j) == V(i,j-1) + Ed5(j-1,i,j) + auPenalty(i,j-1) + Eb + Ec && canSS(j) && canStack(i,j-1)) {
done = 1;
eWM += traceV(i, j - 1);
} else if (WM(i,j) == V(i+1,j-1) + Estackm(j-1,i+1) + auPenalty(i+1, j-1) + Eb + 2*Ec && canSS(i) && canSS(j) && canStack(i+1,j-1)) {
done = 1;
eWM += traceV(i + 1, j - 1);
}
} else if (g_dangles == 2) {
int energy = V(i,j) + auPenalty(i, j) + Eb;
energy += (i==1)?Ed3(j,i,length):Ed3(j,i,i-1);
/*if (j<len)*/ energy += Ed5(j,i,j+1);
if (WM(i,j) == energy && canSS(i) && canSS(j) && canStack(i+1,j-1)) {
eWM += traceV(i, j);
done = 1;
}
} else if (g_dangles == 0) {
if (WM(i,j) == V(i,j) + auPenalty(i, j) + Eb && canStack(i,j)) {
eWM += traceV(i, j);
done = 1;
}
} else {
if (WM(i,j) == V(i,j) + auPenalty(i, j) + Eb && canStack(i,j)) {
eWM += traceV(i, j);
done = 1;
} else if (WM(i,j) == V(i+1, j) + Ed3(j,i + 1,i) + auPenalty(i+1, j) + Eb + Ec && canSS(i) && canStack(i+1,j)) {
eWM += traceV(i + 1, j);
done = 1;
} else if (WM(i,j) == V(i,j-1) + Ed5(j-1,i,j) + auPenalty(i,j-1) + Eb + Ec && canSS(j) && canStack(i,j-1)) {
eWM += traceV(i, j - 1);
done = 1;
} else if (WM(i,j) == V(i+1,j-1) + Ed3(j-1,i+1,i) + Ed5(j-1,i+1,j) + auPenalty(i+1, j-1) + Eb + 2*Ec && canSS(i) && canSS(j) && canStack(i+1,j-1)) {
eWM += traceV(i + 1, j - 1);
done = 1;
}
}
}
if (!done){
if (WM(i,j) == WM(i + 1,j) + Ec && canSS(i)) {
done = 1;
eWM += traceWM(i + 1, j);
} else if (WM(i,j) == WM(i,j - 1) + Ec && canSS(j)) {
done = 1;
eWM += traceWM(i, j - 1);
}
}
if(!done) {
fprintf(stderr, "ERROR: WM(%d,%d) could not be traced\n", i,j);
}
return eWM;
}
void CGAddMouseToInventoryHandler::execute(CGAddMouseToInventory* pPacket , Player* pPlayer)
throw(ProtocolException, Error)
{
__BEGIN_TRY __BEGIN_DEBUG_EX
#ifdef __GAME_SERVER__
Assert(pPacket != NULL);
Assert(pPlayer != NULL);
try {
GamePlayer* pGamePlayer = dynamic_cast<GamePlayer*>(pPlayer);
Assert(pGamePlayer != NULL);
Creature* pCreature = pGamePlayer->getCreature();
Assert(pCreature != NULL);
Assert(pCreature->isPC());
PlayerCreature* pPC = dynamic_cast<PlayerCreature*>(pCreature);
Assert(pPC != NULL);
Zone* pZone = pPC->getZone();
Assert(pZone != NULL);
Inventory* pInventory = pPC->getInventory();
Assert(pInventory != NULL);
Item* pItem = pPC->getExtraInventorySlot()->getItem();
bool Success = false;
if (pItem == NULL) {
GCCannotAdd _GCCannotAdd;
_GCCannotAdd.setObjectID(pPacket->getObjectID());
pPlayer->sendPacket(&_GCCannotAdd);
return;
}
int invenID = 0;
/* Commenting the SubInventory stuff, since it's not supported by the client we use
SubInventory* pInventoryItem = NULL;
int invenID = 0;
if (pPacket->getInventoryItemObjectID() != 0 )
{
// cout << "서브 인벤토리에 넣기 : " << pPacket->getInventoryItemObjectID() << endl;
CoordInven_t X, Y;
pInventoryItem = dynamic_cast<SubInventory*>(pInventory->findItemOID(pPacket->getInventoryItemObjectID(), X, Y ));
TradeManager* pTradeManager = pZone->getTradeManager();
Assert(pTradeManager != NULL);
if (pInventoryItem == NULL || pItem->getItemClass() == Item::ITEM_CLASS_SUB_INVENTORY || pTradeManager->hasTradeInfo(pPC->getName()) )
{
// cout << "근데 서브 인벤토리가 없다." <<endl;
GCCannotAdd _GCCannotAdd;
_GCCannotAdd.setObjectID(pPacket->getObjectID());
pPlayer->sendPacket(&_GCCannotAdd);
return;
}
pInventory = pInventoryItem->getInventory();
invenID = pInventoryItem->getItemID();
}
*/
//Item::ItemClass itemClass = pItem->getItemClass();
//ItemType_t itemType = pItem->getItemType();
ObjectID_t itemObjectID = pItem->getObjectID();
CoordInven_t InvenX = pPacket->getInvenX();
CoordInven_t InvenY = pPacket->getInvenY();
if (InvenX >= pInventory->getWidth() || InvenY >= pInventory->getHeight() || itemObjectID != pPacket->getObjectID() ||
!pInventory->canAdding(InvenX, InvenY, pItem)) {
GCCannotAdd _GCCannotAdd;
_GCCannotAdd.setObjectID(pPacket->getObjectID());
pPlayer->sendPacket(&_GCCannotAdd);
return;
}
TPOINT pt;
pt.x = 99;
pt.y = 99;
// 넣을려는 Inventory Slot의 Item을 받아온다.
Item* pPrevItem = pInventory->searchItem(InvenX, InvenY , pItem, pt);
// 그 장소에 아이템이 있다면
if (pPrevItem != NULL) {
bool bisSame = true;
// 아이템 클래스가 같을때 숫자를 올려 주고 마우스에 있는 것은 없앤다.
if (canStack(pItem, pPrevItem)) {
int MaxStack = ItemMaxStack[pItem->getItemClass()];
VolumeWidth_t ItemWidth = pItem->getVolumeWidth();
VolumeHeight_t ItemHeight = pItem->getVolumeHeight();
VolumeWidth_t InvenWidth = pInventory->getWidth();
VolumeWidth_t InvenHeight= pInventory->getHeight();
if ((InvenX + ItemWidth <= InvenWidth) && (InvenY + ItemHeight <= InvenHeight)) {
for (int x = InvenX; x < (InvenX + ItemWidth); x++) {
for (int y = InvenY; y < (InvenY + ItemHeight); y++) {
if (pInventory->hasItem(x, y)) {
if(pInventory->getItem(x,y) != pPrevItem ) {
bisSame = false;
break;
}
} else {
bisSame = false;
break;
}
}
}
}
// 들어갈 아이템과 들어있는 아이템의 좌표가 꼭 일치 한다면?
if(bisSame) {
// 숫자가 9개를 넘으면 9개 될때까지만 Add 하고 나머지는 마우스에 달아둔다.
if (pItem->getNum() + pPrevItem->getNum() > MaxStack) {
ItemNum_t CurrentNum = pPrevItem->getNum();
ItemNum_t AddNum = pItem->getNum();
ItemNum_t NewNum = AddNum + CurrentNum - MaxStack;
pPrevItem->setNum(MaxStack);
pItem->setNum(NewNum);
pInventory->increaseNum(MaxStack - CurrentNum);
pInventory->increaseWeight(pItem->getWeight()* (MaxStack - CurrentNum));
//pPrevItem->save(pPC->getName(), STORAGE_INVENTORY, 0, InvenX, InvenY);
// item저장 최적화. by sigi. 2002.5.13
char pField[80];
sprintf(pField, "Num=%d, Storage=%d, StorageID=%d, X=%d, Y=%d", MaxStack, STORAGE_INVENTORY, invenID, InvenX, InvenY);
pPrevItem->tinysave(pField);
//pItem->save(pPC->getName(), STORAGE_EXTRASLOT, 0, 0, 0);
// item저장 최적화. by sigi. 2002.5.13
sprintf(pField, "Num=%d, Storage=%d", NewNum, STORAGE_EXTRASLOT);
pItem->tinysave(pField);
Success = true;
} else {
pPC->deleteItemFromExtraInventorySlot();
pPrevItem->setNum(pPrevItem->getNum() + pItem->getNum());
pInventory->increaseNum(pItem->getNum());
pInventory->increaseWeight(pItem->getWeight()* pItem->getNum());
//pPrevItem->save(pPC->getName(), STORAGE_INVENTORY, 0, InvenX, InvenY);
// item저장 최적화. by sigi. 2002.5.13
char pField[80];
sprintf(pField, "Num=%d, Storage=%d, StorageID=%u, X=%d, Y=%d", pPrevItem->getNum(), STORAGE_INVENTORY, invenID, InvenX, InvenY);
pPrevItem->tinysave(pField);
pItem->destroy();
SAFE_DELETE(pItem);
Success = true;
}
if (g_pVariableManager->getVariable(NETMARBLE_CARD_EVENT) != 0 && pPrevItem->getItemClass() == Item::ITEM_CLASS_MOON_CARD && pPrevItem->getItemType() == 2 && pPrevItem->getNum() == 99) {
GCNoticeEvent gcNE;
gcNE.setCode(NOTICE_EVENT_NETMARBLE_CARD_FULL);
pGamePlayer->sendPacket(&gcNE);
//cout << "gcNE sent" << endl;
}
if (pPrevItem->getItemClass() == Item::ITEM_CLASS_LUCKY_BAG
&& pPrevItem->getItemType() == 3
&& pPrevItem->getNum() == 50 ) {
GCDeleteInventoryItem gcDI;
gcDI.setObjectID(pPrevItem->getObjectID());
pGamePlayer->sendPacket(&gcDI);
pInventory->deleteItem(pPrevItem->getObjectID());
pPrevItem->destroy();
SAFE_DELETE(pPrevItem);
Item* pNewItem = g_pItemFactoryManager->createItem(Item::ITEM_CLASS_EVENT_ITEM, 28, list<OptionType_t>());
pZone->registerObject(pNewItem);
if (!pInventory->addItem(pt.x, pt.y, pNewItem) )
return;
pNewItem->create(pPC->getName(), STORAGE_INVENTORY, 0, pt.x, pt.y);
if (pNewItem != NULL ) {
GCCreateItem gcCI;
makeGCCreateItem(&gcCI, pNewItem, pt.x, pt.y);
pGamePlayer->sendPacket(&gcCI);
}
}
} else {
pInventory->deleteItem(pPrevItem->getObjectID());
pPC->deleteItemFromExtraInventorySlot();
pPC->addItemToExtraInventorySlot(pPrevItem);
pInventory->addItem(InvenX , InvenY , pItem);
//pPrevItem->save(pPC->getName(), STORAGE_EXTRASLOT, 0, 0, 0);
// item저장 최적화. by sigi. 2002.5.13
char pField[80];
sprintf(pField, "Storage=%d", STORAGE_EXTRASLOT);
pPrevItem->tinysave(pField);
//pItem->save(pPC->getName(), STORAGE_INVENTORY, 0, InvenX, InvenY);
// item저장 최적화. by sigi. 2002.5.13
sprintf(pField, "Storage=%d, StorageID=%u, X=%d, Y=%d", STORAGE_INVENTORY, invenID, InvenX, InvenY);
pItem->tinysave(pField);
Success = true;
}
}
else {// 아이템 클래스가 다르거나, 쌓이는 아이템이 아니라면.
pInventory->deleteItem(pPrevItem->getObjectID());
pPC->deleteItemFromExtraInventorySlot();
pPC->addItemToExtraInventorySlot(pPrevItem);
pInventory->addItem(InvenX , InvenY , pItem);
//pPrevItem->save(pPC->getName(), STORAGE_EXTRASLOT, 0, 0, 0);
// item저장 최적화. by sigi. 2002.5.13
char pField[80];
sprintf(pField, "Storage=%d", STORAGE_EXTRASLOT);
pPrevItem->tinysave(pField);
//pItem->save(pPC->getName(), STORAGE_INVENTORY, 0, InvenX, InvenY);
// item저장 최적화. by sigi. 2002.5.13
sprintf(pField, "Storage=%d, StorageID=%u, X=%d, Y=%d", STORAGE_INVENTORY, invenID, InvenX, InvenY);
pItem->tinysave(pField);
Success = true;
}
} else { // 그 장소에 아이템이 없다면.
//cout << "prevItem is NULL" << endl;
// Inventory에 특정 아이템을 넣는다.
pInventory->addItem(InvenX , InvenY , pItem);
// 넣기에 성공하면 마우스에 달려있는 아이템을 없앤다.
pPC->deleteItemFromExtraInventorySlot();
//pItem->save(pPC->getName(), STORAGE_INVENTORY, 0, InvenX, InvenY);
// item저장 최적화. by sigi. 2002.5.13
char pField[80];
sprintf(pField, "Storage=%d, StorageID=%u, X=%d, Y=%d", STORAGE_INVENTORY, invenID, InvenX, InvenY);
pItem->tinysave(pField);
Success = true;
}
if (Success) {
TradeManager* pTradeManager = pZone->getTradeManager();
TradeInfo* pInfo = pTradeManager->getTradeInfo(pCreature->getName());
if (pInfo != NULL && pInfo->getStatus() == TRADE_FINISH) {
GCTradeVerify gcTradeVerify;
gcTradeVerify.setCode(GC_TRADE_VERIFY_CODE_MOUSE_TO_INVENTORY_OK);
pPlayer->sendPacket(&gcTradeVerify);
}
// 트리 조각일 경우
if (pItem != NULL && pItem->getItemClass() == Item::ITEM_CLASS_EVENT_TREE) {
ItemType_t itemtype = pItem->getItemType();
// 크리스마스 트리 조각이면
if (itemtype <= 11) {
// 크리스마스 트리 조각이 맞춰지는지 본다.
TPOINT pt = checkEventPuzzle(pPC, InvenX, InvenY, 0);
if (pt.x != -1 && pt.y != -1 )
{
// 맞춰진 트리 조각을 지운다.
deleteInventoryItem(pInventory, pt.x, pt.y, pt.x + 2, pt.y + 3);
// 트리를 생성한다.
list<OptionType_t> optionType;
Item* pTreeItem = g_pItemFactoryManager->createItem(Item::ITEM_CLASS_EVENT_TREE, 12, optionType);
pZone->getObjectRegistry().registerObject(pTreeItem);
pInventory->addItem(pt.x, pt.y, pTreeItem);
pTreeItem->create(pPC->getName(), STORAGE_INVENTORY, invenID, pt.x, pt.y);
// 클라이언트에 트리가 만들어졌다는 걸 알린다.
GCCreateItem gcCreateItem;
makeGCCreateItem(&gcCreateItem, pTreeItem, pt.x, pt.y);
pGamePlayer->sendPacket(&gcCreateItem);
}
}
// 크리스마스 트리 조각이면
else if (itemtype > 12 && itemtype <= 24) {
// 크리스마스 트리 조각이 맞춰지는지 본다.
TPOINT pt = checkEventPuzzle(pPC, InvenX, InvenY, 13);
if (pt.x != -1 && pt.y != -1) {
// 맞춰진 트리 조각을 지운다.
deleteInventoryItem(pInventory, pt.x, pt.y, pt.x + 2, pt.y + 3);
// 트리를 생성한다.
list<OptionType_t> optionType;
Item* pTreeItem = g_pItemFactoryManager->createItem(Item::ITEM_CLASS_EVENT_TREE, 25, optionType);
pTreeItem->setQuestItem();
pZone->getObjectRegistry().registerObject(pTreeItem);
pInventory->addItem(pt.x, pt.y, pTreeItem);
pTreeItem->create(pPC->getName(), STORAGE_INVENTORY, invenID, pt.x, pt.y);
// 클라이언트에 트리가 만들어졌다는 걸 알린다.
GCCreateItem gcCreateItem;
makeGCCreateItem(&gcCreateItem, pTreeItem, pt.x, pt.y);
pGamePlayer->sendPacket(&gcCreateItem);
}
}
// 크리스마스 트리 조각이면
else if (itemtype > 28 && itemtype <= 40) {
// 크리스마스 트리 조각이 맞춰지는지 본다.
TPOINT pt = checkEventPuzzle(pPC, InvenX, InvenY, 29);
if (pt.x != -1 && pt.y != -1) {
// 맞춰진 트리 조각을 지운다.
deleteInventoryItem(pInventory, pt.x, pt.y, pt.x + 2, pt.y + 3);
// 트리를 생성한다.
list<OptionType_t> optionType;
Item* pTreeItem = g_pItemFactoryManager->createItem(Item::ITEM_CLASS_EVENT_TREE, 41, optionType);
pTreeItem->setQuestItem();
pZone->getObjectRegistry().registerObject(pTreeItem);
pInventory->addItem(pt.x, pt.y, pTreeItem);
pTreeItem->create(pPC->getName(), STORAGE_INVENTORY, invenID, pt.x, pt.y);
// 클라이언트에 트리가 만들어졌다는 걸 알린다.
GCCreateItem gcCreateItem;
makeGCCreateItem(&gcCreateItem, pTreeItem, pt.x, pt.y);
pGamePlayer->sendPacket(&gcCreateItem);
}
}
}
} else {
//cout << "cannot add" << endl;
GCCannotAdd _GCCannotAdd;
_GCCannotAdd.setObjectID(pPacket->getObjectID());
pPlayer->sendPacket(&_GCCannotAdd);
}
} catch (Throwable & t) {}
#endif // __GAME_SERVER__
__END_DEBUG_EX __END_CATCH
}
int calculate(int len, int nThreads) {
int b, i, j;
#ifdef _OPENMP
if (nThreads>0) omp_set_num_threads(nThreads);
#endif
#ifdef _OPENMP
#pragma omp parallel
#pragma omp master
fprintf(stdout,"Thread count: %3d \n",omp_get_num_threads());
#endif
for (b = TURN+1; b <= len-1; b++) {
#ifdef _OPENMP
#pragma omp parallel for private (i,j) schedule(guided)
#endif
for (i = 1; i <= len - b; i++) {
j = i + b;
int flag = 0, newWM = INFINITY_;
if (canPair(RNA[i], RNA[j])) {
flag = 1;
int eh = canHairpin(i,j)?eH(i,j):INFINITY_; //hair pin
int es = canStack(i,j)?eS(i,j)+getShapeEnergy(i)+getShapeEnergy(j)+V(i+1,j-1):INFINITY_; // stack
if (j-i > 6) { // Internal Loop BEGIN
int p=0, q=0;
int VBIij = INFINITY_;
for (p = i+1; p <= MIN(j-2-TURN,i+MAXLOOP+1) ; p++) {
int minq = j-i+p-MAXLOOP-2;
if (minq < p+1+TURN) minq = p+1+TURN;
int maxq = (p==i+1)?(j-2):(j-1);
for (q = minq; q <= maxq; q++) {
if (!canPair(RNA[p], RNA[q])) continue;
if (!canILoop(i,j,p,q)) continue;
VBIij = MIN(eL(i, j, p, q) + V(p,q), VBIij);
}
}
VBI(i,j) = VBIij;
V(i,j) = V(i,j) + getShapeEnergy(i) + getShapeEnergy(j);
} // Internal Loop END
if (j-i > 10) { // Multi Loop BEGIN
int h;
int VMij, VMijd, VMidj, VMidjd;
VMij = VMijd = VMidj = VMidjd = INFINITY_;
for (h = i+TURN+1; h <= j-1-TURN; h++) {
VMij = MIN(VMij, WMU(i+1,h-1) + WML(h,j-1));
VMidj = MIN(VMidj, WMU(i+2,h-1) + WML(h,j-1));
VMijd = MIN(VMijd, WMU(i+1,h-1) + WML(h,j-2));
VMidjd = MIN(VMidjd, WMU(i+2,h-1) + WML(h,j-2));
}
int d3 = canSS(j-1)?Ed3(i,j,j-1):INFINITY_;
int d5 = canSS(i+1)?Ed5(i,j,i+1):INFINITY_;
VMij = MIN(VMij, (VMidj + d5 +Ec)) ;
VMij = MIN(VMij, (VMijd + d3 +Ec));
VMij = MIN(VMij, (VMidjd + d5 + d3+ 2*Ec));
VMij = VMij + Ea + Eb + auPenalty(i,j);
VM(i,j) = canStack(i,j)?VMij:INFINITY_;
} // Multi Loop END
V(i,j) = MIN4(eh,es,VBI(i,j),VM(i,j));
}
else V(i,j) = INFINITY_;
if (j-i > 4) { // WM BEGIN
int h;
for (h = i+TURN+1 ; h <= j-TURN-1; h++) {
//ZS: This sum corresponds to when i,j are NOT paired with each other.
//So we need to make sure only terms where i,j aren't pairing are considered.
newWM = (!forcePair(i,j))?MIN(newWM, WMU(i,h-1) + WML(h,j)):newWM;
}
newWM = MIN(V(i,j) + auPenalty(i,j) + Eb, newWM);
newWM = canSS(i)?MIN(V(i+1,j) + Ed3(j,i+1,i) + auPenalty(i+1,j) + Eb + Ec, newWM):newWM; //i dangle
newWM = canSS(j)?MIN(V(i,j-1) + Ed5(j-1,i,j) + auPenalty(i,j-1) + Eb + Ec, newWM):newWM; //j dangle
newWM = (canSS(i)&&canSS(j))?MIN(V(i+1,j-1) + Ed3(j-1,i+1,i) + Ed5(j-1,i+1,j) + auPenalty(i+1,j-1) + Eb + 2*Ec, newWM):newWM; //i,j dangle
newWM = canSS(i)?MIN(WMU(i+1,j) + Ec, newWM):newWM; //i dangle
newWM = canSS(j)?MIN(WML(i,j-1) + Ec, newWM):newWM; //j dangle
WMU(i,j) = WML(i,j) = newWM;
} // WM END
}
}
for (j = TURN+2; j <= len; j++) {
int i, Wj, Widjd, Wijd, Widj, Wij, Wim1;
Wj = INFINITY_;
for (i = 1; i < j-TURN; i++) {
Wij = Widjd = Wijd = Widj = INFINITY_;
Wim1 = MIN(0, W[i-1]);
Wij = V(i, j) + auPenalty(i, j) + Wim1;
Widjd = (canSS(i)&&canSS(j))?V(i+1,j-1) + auPenalty(i+1,j-1) + Ed3(j-1,i + 1,i) + Ed5(j-1,i+1,j) + Wim1:Widjd;
Wijd = canSS(j)?V(i,j-1) + auPenalty(i,j-1) + Ed5(j-1,i,j) + Wim1:Wijd;
Widj = canSS(i)?V(i+1, j) + auPenalty(i+1,j) + Ed3(j,i + 1,i) + Wim1:Widj;
Wj = MIN(MIN4(Wij, Widjd, Wijd, Widj), Wj);
}
W[j] = canSS(j)?MIN(Wj, W[j-1]):Wj;
}
return W[len];
}
