Solutions and code for the Google # Hash Code 2018 Challenge "Self-driving rides".
The problem statement can be found here.
The input files can be found in input/
- example
Map:(3, 4)Vehicles:2Rides:3Bonus:2Steps:10 - should be easy
Map:(800, 1000)Vehicles:100Rides:300Bonus:25Steps:25000 - no hurry
Map:(3000, 2000)Vehicles:81Rides:10000Bonus:1Steps:200000 - metropolis
Map:(10000, 10000)Vehicles:400Rides:10000Bonus:2Steps:50000 - high bonus
Map:(1500, 2000)Vehicles:350Rides:10000Bonus:1000Steps:150000
Millions of people commute by car every day; for example, to school or to their workplace.
Self-driving vehicles are an exciting development for transportation. They aim to make traveling by car safer and more available while also saving commuters time.
In this competition problem, we’ll be looking at how a fleet of self-driving vehicles can efficiently get commuters to their destinations in a simulated city.
from Problem statement for the Online Qualification Round of Hash Code 2018
Given a list of pre-booked rides in a city and a fleet of self-driving vehicles, assign the rides to vehicles, so that riders get to their destinations on time.
For every ride that finishes on time (or early), you will earn points proportional to the distance of that ride; plus an additional bonus if the ride also started precisely on time.
from Problem statement for the Online Qualification Round of Hash Code 2018
Overall 45,616,108 points.
10 points, processed in 00:01 min.
176,877 points, processed in 00:16 min.
15,790,161 points, processed in 03:57 min.
8,183,115 points, processed in 41:34 min
21,465,945 points, processed in 15:05 min
We saved the visualization from the # Hash Code Judge System and added a responsive layout.
Solutions can now be visualized by dropping their corresponding JSON file via drag & drop.
Sebastian Brodehl / @sbrodehl
Tobias Kremer / @tbkr
Dennis Meyer / @snakebite1457
Moritz Schmidtgen / @mschmi10