#include <iostream>
#include <sstream>
#include <iterator>
+#include <queue>
+#include <vector>
+#include <utility>
#include "bot.h"
using namespace std;
using namespace __gnu_cxx;
-Bot::Bot(string name, string type){
+
+Bot::Bot(const string& name, PlayerType type){
_name = name;
_type = type;
+
+ _playerTypeNames[robber] = "robber";
+ _playerTypeNames[cop_foot] = "cop-foot";
+ _playerTypeNames[cop_car] = "cop-car";
+
+ _playerTypes["robber"] = robber;
+ _playerTypes["cop-foot"] = cop_foot;
+ _playerTypes["cop-car"] = cop_car;
+
}
void Bot::play(){
- cout << "reg: " << _name << " " << _type << endl;
+ cout << "reg: " << _name << " " << _playerTypeNames[_type] << endl;
string input;
getline(cin, input);
if (input != "wsk\\")
return;
getline(cin, input);
- _name = tokenizeString(input)[1];
+ _name = value<string>(input);
cerr << "Got name: " << _name << endl;
+
+ getPlayers();
+
+ cerr << "Got players, building graph." << endl;
+ getline(cin, input);
buildGraph();
- updateWorld();
- turn();
+
+ while (true){
+ getline(cin, input);
+ if (input == "game-over")
+ return;
+ updateWorld();
+ _type = _players[_name].type;
+ _location = _players[_name].location;
+ cerr << "New turn" << endl;
+ move(turn());
+ cerr << "Done with turn." << endl;
+ }
}
+void Bot::getPlayers(){
+ string input;
+ //robber and 5 cops
+ getline(cin, input);
+ _players[value<string>(input)].type = robber;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+ getline(cin, input);
+ _players[value<string>(input)].type = cop_foot;
+}
+
+/**
+ nod\ eol
+ ( nod: loc node-tag coordinate coordinate eol )*
+ nod/ eol
+ edg\ eol
+ ( edg: loc loc edge-type eol )*
+ edg/ eol
+*/
void Bot::buildGraph(){
+ string input;
+ getline(cin, input);
+ if (input != "nod\\")
+ return;
+
+ cerr << "Getting intersections" << endl;
+ while (true){
+ getline(cin, input);
+ if (input == "nod/")
+ break;
+ istringstream node(input);
+ node >> input;
+ node >> input;
+ Intersection& inter = _intersections[input];
+ node >> input;
+ if (input == "bank")
+ inter.type = bank;
+ else if (input == "hq")
+ inter.type = hq;
+ else if (input == "robber-start")
+ inter.type = robber_start;
+ else
+ inter.type = ordinary;
+ node >> inter.x;
+ node >> inter.y;
+ }
+
+ cerr << "Number of intersections: " << _intersections.size() << endl;
+
+ getline(cin, input);
+ if (input != "edg\\")
+ return;
+
+ cerr << "Getting streets" << endl;
+ int streets = 0;
+ while (true){
+ getline(cin, input);
+ if (input == "edg/")
+ break;
+ ++streets;
+ istringstream street(input);
+ string from;
+ street >> from;
+ street >> from;
+ string to;
+ street >> to;
+ string type;
+ street >> type;
+ //cerr << "Street between: " << from << " and " << to << " of type: " << type << endl;
+ if (type == "foot"){
+ _intersections[from].connections[to] = both;
+ Intersection& inter = _intersections[to];
+ if (inter.connections.find(from) == inter.connections.end())
+ inter.connections[from] = foot;
+ }else
+ _intersections[from].connections[to] = car;
+ }
+ cerr << "Number of streets: " << streets << endl;
+ getline(cin, input);
+}
+void Bot::updateWorld(){
+ string input;
+ getline(cin,input);
+ _world = value<int>(input);
+ //cerr << "World: " << _world << endl;
+
+ getline(cin,input);
+ _robbed = value<int>(input);
+ //cerr << "Robbed: " << _robbed << endl;
+
+ getline(cin,input);
+ while (true){
+ getline(cin, input);
+ if (input == "bv/")
+ break;
+ istringstream bank(input);
+ bank >> input;
+ bank >> input;
+ bank >> _banks[input];
+ }
+ //cerr << "Number of banks: " << _banks.size() << endl;
+
+ getline(cin,input);
+ while (true){
+ getline(cin, input);
+ if (input == "ev/")
+ break;
+ istringstream evidence(input);
+ int world;
+ evidence >> input;
+ evidence >> input;
+ evidence >> world;
+ _evidence[world] = input;
+ }
+
+ getline(cin,input);
+ _smell = value<int>(input);
+
+ getline(cin,input);
+ while (true){
+ getline(cin, input);
+ if (input == "pl/")
+ break;
+ istringstream player(input);
+ player >> input;
+ player >> input;
+ //cerr << "Player: " << input << endl;
+ Player& pl = _players[input];
+ player >> pl.location;
+ player >> input;
+ pl.type = _playerTypes[input];
+ }
+ //cerr << "Number of players: " << _players.size() << endl;
+ getline(cin, input);
+}
+
+void Bot::move(std::string location){
+ cerr << "Moving to: " << location << endl;
+ cout << "mov: " << location << " " << _playerTypeNames[_type] << endl;
}
-std::vector<std::string> tokenizeString(std::string input){
+template<class T>
+T value(std::string input){
istringstream istr(input);
- vector<string> strings;
- copy(istream_iterator<string>(istr), istream_iterator<string>(), back_inserter(strings));
- return strings;
+ istr >> input;
+ T s;
+ istr >> s;
+ return s;
+}
+
+std::string Bot::turn(){
+ cerr << "Using stupid stand still Bot::turn" << endl;
+ return _location;
+}
+
+struct SPInfoComp{
+ bool operator()(const SPInfo* v1, const SPInfo* v2){
+ return v1->cost > v2->cost;
+ }
+};
+
+std::list<std::string> Bot::shortestPath(const std::string& from, PlayerType type, const SPGoal& goal, bool reverse){
+
+ //cerr << "New shortest path from: " << from << endl;
+
+ priority_queue<SPInfo*, vector<SPInfo* >, SPInfoComp > pq;
+ hash_map<string,SPInfo> nodes;
+
+ SPInfo* node = &nodes[from];
+ node->name = from;
+ node->settled = false;
+ node->parent = 0;
+ node->cost = 0;
+ pq.push(node);
+
+ int g = 0;
+ bool hascar = type == cop_car;
+ while(!pq.empty()){
+ node = pq.top();
+ pq.pop();
+ //cerr << "Vector with size: " << w.size() << endl;
+ //cerr << "Looking at: " << node->name << endl;
+ //copy(w.begin(), w.end(), ostream_iterator<string>(cerr, " : "));
+
+ g = goal(node);
+ if (g < 0)
+ break;
+ else if (g){
+ list<string> l;
+ front_insert_iterator<list<string> > ii(l);
+ do{
+ *ii++ = node->name;
+ node = node->parent;
+ }while (node != 0);
+ return l;
+ }
+ node->settled = true;
+
+ Intersection& inter = _intersections[node->name];
+ for (hash_map<string,StreetType>::const_iterator street = inter.connections.begin();
+ street != inter.connections.end(); ++street){
+ hash_map<string,SPInfo>::iterator newNode = nodes.find(street->first);
+ bool travelStreet = false;
+ if (hascar){
+ if (reverse){
+ if (street->second != foot){
+ hash_map<string,StreetType>::const_iterator st = _intersections[street->first].connections.find(node->name);
+ if (st != _intersections[street->first].connections.end())
+ travelStreet = st->second != foot;
+ else
+ travelStreet = false;
+ }else
+ travelStreet = true;
+ }else
+ travelStreet = street->second != foot;
+ }else{
+ travelStreet = street->second != car;
+ }
+ if (travelStreet){
+ //cerr << "Adding street: " << street->first << endl;
+ SPInfo* n = 0;
+ if (newNode == nodes.end()){
+ n = &nodes[street->first];
+ n->name = street->first;
+ n->settled = false;
+ n->parent = 0;
+ n->cost = 10000;
+ }else if (newNode->second.settled)
+ continue;
+ else
+ n = &newNode->second;
+
+ if (n->cost > node->cost + 1){
+ n->cost = node->cost + 1;
+ n->parent = node;
+ pq.push(n);
+ }
+ }
+
+ }
+
+ }
+
+ return list<string>();
+}
+
+SimpleSPGoal::SimpleSPGoal(std::string to):_to(to){
+}
+
+int SimpleSPGoal::operator()(const SPInfo* node) const{
+ if (node->name == _to)
+ return 1;
+ return 0;
+}
+
+FindPlayer::FindPlayer(const hash_map<string, Player>& players, PlayerType type, int limit) : _players(players), _type(type), _limit(limit){
+}
+
+int FindPlayer::operator()(const SPInfo* node) const{
+ if (_limit > 0 && node->cost >= _limit)
+ return -1;
+ for(hash_map<string, Player>::const_iterator player = _players.begin();
+ player != _players.end(); ++player){
+ if (player->second.type == _type && player->second.location == node->name){
+ return 1;
+ }
+ }
+ return 0;
}
projects / icfp05.git / blobdiff