-
Notifications
You must be signed in to change notification settings - Fork 0
/
Oasis.cpp
115 lines (90 loc) · 3.04 KB
/
Oasis.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
//
// Created by Maher San on 09/05/2018.
//
#include "Oasis.h"
#include <stdlib.h>
#include "math.h"
StatusType Oasis::Init(int n, int* clanIDs)
{
if(n<2) return FAILURE;
// this->HashOfClans = Hash();
// this->HeapOfClans = Heap<Clan>(n);
// this->Players = AVL<int>();
Clan** clans = new Clan*[n];
if (!HashOfClans.MakeHeap(n, clanIDs, clans)) return FAILURE;
HeapOfClans.make(clans,clanIDs,n); // makeheap
// for(int i=0; i<n; i++)
// {
// HeapOfClans.Insert(HashOfClans.member(clanIDs[i]),clanIDs[i]);
// }
delete[](clans);
return SUCCESS;
}
StatusType Oasis::addClan(int clanID){
if(clanID<0) return INVALID_INPUT;
if(HashOfClans.isExistH(clanID)) return FAILURE;
HashOfClans.insert(clanID);
HeapOfClans.Insert(HashOfClans.member(clanID),clanID);
return SUCCESS;
}
StatusType Oasis::addPlayer( int playerID, int score, int clan) {
if (playerID < 0 || score < 0 || clan < 0) {
return INVALID_INPUT;
}
if(Players.isExist(playerID) || !HashOfClans.isExistH(clan)) return FAILURE;
Players.insertData(playerID,playerID);
Player player(playerID,score);
HashOfClans.member(clan)->addPlayer(player);
return SUCCESS;
}
StatusType Oasis::clanFight(int clan1, int clan2, int k1, int k2)
{
if(clan1<0 || clan2<0 || k1<=0 || k2<=0) return INVALID_INPUT;
if(!HashOfClans.isExistH(clan1)
|| !HashOfClans.isExistH(clan2)
|| HashOfClans.member(clan1)->getWinner()==0
|| HashOfClans.member(clan2)->getWinner()==0 ||
HashOfClans.member(clan1)->getNumOfPlayers()<k1
|| HashOfClans.member(clan2)->getNumOfPlayers()<k2
|| clan1==clan2) return FAILURE;
if(HashOfClans.member(clan1)->getPlayers().SelectKTotal(k1) < HashOfClans.member(clan2)->getPlayers().SelectKTotal(k2) )
{
HashOfClans.member(clan1)->updateWinner();
HeapOfClans.delElementByData(HashOfClans.member(clan1));
}
else if(HashOfClans.member(clan1)->getPlayers().SelectKTotal(k1) > HashOfClans.member(clan2)->getPlayers().SelectKTotal(k2) )
{
HashOfClans.member(clan2)->updateWinner();
HeapOfClans.delElementByData(HashOfClans.member(clan2));
}
else if (HashOfClans.member(clan1)->getPlayers().SelectKTotal(k1) == HashOfClans.member(clan2)->getPlayers().SelectKTotal(k2))
{
if(clan1<clan2)
{
HashOfClans.member(clan2)->updateWinner();
HeapOfClans.delElementByData(HashOfClans.member(clan2));
}
else
{
HashOfClans.member(clan1)->updateWinner();
HeapOfClans.delElementByData(HashOfClans.member(clan1));
}
}
// HeapOfClans.printHeap();
return SUCCESS;
}
StatusType Oasis::getMinClan (int* clan)
{ if(!clan)
return INVALID_INPUT;
if (HeapOfClans.getSize()==0)
return FAILURE;
*clan = HeapOfClans.getMin().Key;
return SUCCESS;
}
void Oasis::Quit()
{
// HeapOfClans.destroy();
// HashOfClans.destroyHash();
HeapOfClans.destroyHeap();
return;
}