Skip to content

Hash Code 2019 Online Qualification Round solution (score: 800521, rank: 582 of 6671)

Notifications You must be signed in to change notification settings

prague-pandas/hashcode2019qualification

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Hash Code 2019 Online Qualification Round Solution

Problem: Photo slideshow

Team: Prague Pandas

Links

Description

The solver solves the problem in two phases:

  1. Pair the vertical photos to form slides.
  2. Order the slides.

When pairing the vertical photos, the solver repeatedly takes an arbitrary photo and searches for another photo to maximize the size of the union of their tag sets. When searching for the match, we only consider a constant-sized sample of the photo population.

When ordering the slides, the solver greedily extends the slideshow. It starts by taking an arbitrary slide and then repeatedly searches for the next slide that maximizes the transition score. When searching for the next slide, we only consider a constant-sized sample of the slide population.

Final score

  • A: 2
  • B: 109626
  • C: 1517
  • D: 375409
  • E: 313967
  • Total: 800521

Rank: 582 of 6671

About

Hash Code 2019 Online Qualification Round solution (score: 800521, rank: 582 of 6671)

Topics

Resources

Stars

Watchers

Forks

Languages