Practice Round: More Pizza
The goal is to
order as many pizza slices as possible, but not more than the maximum number.
-
1st attempt: We order pizzas from smallest to largest until no pizza is small enough to not exceed the goal.
-
2nd attempt: We order pizzas from largest to smallest until the next pizza exceeds the goal and then order pizzas from smallest to largest until no pizza is small enough to not exceed the goal.
-
3rd attempt: We order pizzas at random until no pizza is small enough to not exceed the goal.
Online Qualification Round / Extended Round: Book Scanning
The goal is to
Given a description of libraries and books available, plan which books to scan from which library to maximize the total score of all scanned books, taking into account that each library needs to be signed up before it can ship books.
| Attempt | What Libraries? | How? | What Books? | How? |
|---|---|---|---|---|
| 1st | first n so that the sum of their signup cost was no greater than the total number of days available | in the order of the input file | all books | in the order of the input file |
| 2nd | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by increasing signup time | all books | sorted by decreasing book score |
| 3rd | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by increasing signup time | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 4th | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by increasing (mistake!) rank (all books score, signup time) (badly implemented!) | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 5th | first n so that the sum of their signup cost was no greater than the total number of days available | at random | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 6th | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by increasing (mistake!) number of books | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 7th | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by increasing (mistake!) all books score | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| Attempt | What Libraries? | How? | What Books? | How? |
|---|---|---|---|---|
| 1st | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by decreasing rank (all books score, signup time) (badly implemented!) | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 2nd | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by decreasing number of books | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 3rd | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by decreasing all books score | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 4th | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by decreasing rank (all books score, signup time, scanning rate) | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| 5th | first n so that the sum of their signup cost was no greater than the total number of days available | sorted by decreasing rank (all books score, signup time) | only the books which would actually be scanned and wouldn't be scanned by previous libraries | sorted by decreasing book score |
| Round | Score | #Hub | #Country | #Worldwide |
|---|---|---|---|---|
| Online Qualification Round | 22,251,419 points | 5th | 34th | 3,472th |
| Extended Round | 22,859,495 points | 3rd | 17th | 1,995th |
#HashCodeSolved
| Name | Github | Role |
|---|---|---|
| Cristiano Clemente | @cristianocclemente | Team Leader & Programmer |
| Hugo Pitorro | @xtwigs | Programmer |
| Catarina Carreiro | @cmcarreiro | Algorithm Designer (& Bug-Finder Person) |
| Mónica Jin | @mokita-j | Algorithm Designer |
hub: GCE - IST from Instituto Superior Técnico (Lisbon, Portugal)