Data Structures (need help)

[ShatteredPsycho]

Hello everyone,

 

I am currently doing an exercise to learn how to use data structures and so on.

This one consists of a public partition managing program. Where in every partition there is a set of citizens and services.

The partitions are set like:

<City>,<partition number>,<Postal code>,<service  A>,…,<service N>

The citizens like:

<Name>,<Taxpayer number>,<email>,<posta lcode>,<partition number>

There are tickets to the services for a given day, they are set like:

<Taxpayer number>,<Service N>,<order number>

 

Now I have most  functions done but I don't know how to go about this one:

-Know the use of the services of a repartition knowing that a citizen gets one or more tickets and is destributedc by the "lists" of respective services

-Average time for solve a ticket is 10m, from 9:00h to 15:30h, should be able to know which citizens have been attended on a given ohur

(now the part that gets me confused)

-If a citizen is being attended in two services at the same time (confliting tickets) the order of the attendence should be given by the order number. In this case the citizen is attended in the second service righjt after he is done with the first, moving ahead on the waiting line of the second service and so on to the rest of the confliting tickets.

-Know what are the services who are most sought after

-Allow citizen to leave the line

 

I don't know how to go about this, what is the best structure to use for each? I have a Map of <Repartition,Set<Citizen>> and a doublylinkedlist of Repartitions. As well as TreeSets of CItizens and Tickets.

[reniat]

Is there a bit more context for the problem? It's not 100% clear (at least to me) what the end game goal is for this. Are you attempting to simulate the ticket queue given a set of tickets, or make a system to which tickets can be added dynamically? Or both, with some kind of standardized "ticket script" that adds and removes tickets so you make the system and run it as well.

[bcguru9384]

add building number to cities line ,,, add rule buildings=#to# of citizens

citizens=ticketconflict return home(buildingnumber has open space)

citizens=in buildings unless ticketorder

citizens not need partition as thats resolved thru either building or ticketorder=service

[ShatteredPsycho]

On 17/10/2017 at 1:17 AM, reniat said:

Is there a bit more context for the problem? It's not 100% clear (at least to me) what the end game goal is for this. Are you attempting to simulate the ticket queue given a set of tickets, or make a system to which tickets can be added dynamically? Or both, with some kind of standardized "ticket script" that adds and removes tickets so you make the system and run it as well.

 

On 17/10/2017 at 2:19 AM, bcguru9384 said:

add building number to cities line ,,, add rule buildings=#to# of citizens

citizens=ticketconflict return home(buildingnumber has open space)

citizens=in buildings unless ticketorder

citizens not need partition as thats resolved thru either building or ticketorder=service

 

Sorry for late reply, I managed to solve it

Thank you for your time