Community Spring Cleaning week is here! Join your fellow Maveryx in digging through your old posts and marking comments on them as solved. Learn more here!

Weekly Challenges

Solve the challenge, share your solution and summit the ranks of our Community!

Also available in | Français | Português | Español | 日本語
IDEAS WANTED

Want to get involved? We're always looking for ideas and content for Weekly Challenges.

SUBMIT YOUR IDEA

Challenge #369: Formula 1 Grand Prix (In)efficiency

AYXAcademy
Alteryx
Alteryx

This challenge was submitted by our Community user @RemcoV .

Image.jpgThank you, Remco Visser!

 

How efficient is the Formula 1 race series?

A Formula One (F1) season consists of a series of races known as Grand Prix. Grand Prix races occur on specialized circuits or closed public roads in multiple countries and continents worldwide. In this challenge, we will analyze how efficient the Grand Prix organizers are when assigning the circuits and the official order (round number) in which the F1 teams will participate.

 

For this challenge, you are provided with two datasets:

 

  1. Circuit Names: This dataset contains the circuit names and the corresponding round number.

  2. Circuit Location: This dataset contains the circuit names, the countries where they are located, and the latitude and longitude of their location.

 

The challenge is to:

 

  1. Determine how many kilometers Formula 1 teams must travel to complete all 23 rounds when F1 teams follow the round numbers determined by the organizers. This means starting at round 1, traveling to round 2, and so on, all the way to round 23.

  2. Determine how many kilometers Formula 1 teams must travel to complete all 23 rounds when the F1 teams travel to the nearest circuit, starting in Bahrain, instead of following the round numbers assigned by the organizers.

Source: http://ergast.com/mrd/

MilindG
12 - Quasar
Spoiler
MilindG_0-1682948620100.png

Cant get the miles to match..

AkimasaKajitani
17 - Castor
17 - Castor

My solution.

 

But my answer for 2 is smaller than the sample output.

Spoiler
AkimasaKajitani_0-1682950909564.png
My Iterative Macro:
AkimasaKajitani_1-1682951019847.png

My answer is 

AkimasaKajitani_2-1682951071856.png

 

AkimasaKajitani_3-1682951109193.png

 

 

 

ggruccio
ACE Emeritus
ACE Emeritus

Maybe even more efficient?

 

Spoiler
I got a different result as well...but macro seems to be working...

ggruccio_1-1682951304087.png

 

mmontgomery
10 - Fireball

Not too bad. Broke up the two questions into two iterative macros to make it easier to debug.

 

 

Spoiler
mmontgomery_0-1682952832392.pngmmontgomery_1-1682952847252.pngmmontgomery_2-1682952861271.png

 

 

 

 

 

ahsanaali
11 - Bolide
Spoiler
ahsanaali_0-1682953123805.pngahsanaali_0-1682953269984.png

 

The optimized distance is different compared to the provided answer.

patrick_digan
17 - Castor
17 - Castor
Spoiler
patrick_digan_0-1682953727129.png
patrick_digan_1-1682953760104.png

 

 

RolandSchubert
16 - Nebula
16 - Nebula
Spoiler
369.jpg
PhilipMannering
16 - Nebula
16 - Nebula

Solution attached,

 

Spoiler
PhilipMannering_0-1682955996455.png

 

DataNath
17 - Castor

My solution to #369.

 

Spoiler
DataNath_0-1682956203573.png

DataNath_0-1682956237933.png