Hackerrank - Flatland Space Stations

Hackerrank – Popis problému

Celý popis zadania sa nacháza – Hackerrank.

Riešenie

Najprv som usporiadal stanice, pretože nie sú vždy usporiadané. Potom som zistil, koľko miest sa nachádza medzi každou dvojicou staníc i a i+1:

$((i + 1) - i - 1)$

Následne som vypočítal maximálnu vzdialenosť pre každé mesto medzi párom staníc.

$ceil(towns / 2)$

Nakoniec som porovnal najväčšiu vzdialenosť medzi mestom ktoré nemá prvú stanicu v páre (index 0) a prvú stanicu a posledné mesto (index n - 1) a poslednú stanicu.

Vytvoril som riešenie v týchto programovacích jazykoch:

Scala
Java
JavaScript
Ruby

Všetky riešenia sú dostupné aj na mojom GitHub profile.

Java

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int cities = stdin.nextInt();
        int stationCount = stdin.nextInt();
        int[] stations = new int[stationCount];
        for(int i = 0; i < stationCount; i++) {
            stations[i] = stdin.nextInt();
        }
        Arrays.sort(stations);
        int max = 0;
        for(int i = 0; i < stations.length - 1; i++) {
            int citiesInside = stations[i + 1] - stations[i] - 1;
            int d = (int) Math.ceil(citiesInside / 2.0);
            if(d > max) {
                max = d;
            }
        }
        if(stations[0] - 0 > max) {
            max = stations[0] - 0;
        }
        if(cities - 1 - stations[stationCount - 1] > max) {
            max = cities - 1 - stations[stationCount - 1];
        }
        System.out.println(max);
        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int cities = stdin.nextInt();

int stationCount = stdin.nextInt();

int[] stations = new int[stationCount];

for(int i = 0; i < stationCount; i++) {

stations[i] = stdin.nextInt();

}

Arrays.sort(stations);

int max = 0;

for(int i = 0; i < stations.length - 1; i++) {

int citiesInside = stations[i + 1] - stations[i] - 1;

int d = (int) Math.ceil(citiesInside / 2.0);

if(d > max) {

max = d;

}

if(stations[0] - 0 > max) {

max = stations[0] - 0;

}

if(cities - 1 - stations[stationCount - 1] > max) {

max = cities - 1 - stations[stationCount - 1];

}

System.out.println(max);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const [cities, stationCount] = lines[0].split(' ').map(i => parseInt(i));
    const stations = lines[1].split(' ').map(i => parseInt(i));
    stations.sort((a, b) => a - b);
    let max = 0;
    for(let i = 0; i < stations.length - 1; i++) {
        const citiesInside = stations[i + 1] - stations[i] - 1;
        const d = parseInt(Math.ceil(citiesInside / 2.0));
        if(d > max) {
            max = d;
        }
    }
    if(stations[0] - 0 > max) {
        max = stations[0] - 0;
    }
    if(cities - 1 - stations[stationCount - 1] > max) {
        max = cities - 1 - stations[stationCount - 1];
    }
    console.log(max);
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

let _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const processData = input => {

const lines = input.split('\n');

const [cities, stationCount] = lines[0].split(' ').map(i => parseInt(i));

const stations = lines[1].split(' ').map(i => parseInt(i));

stations.sort((a, b) => a - b);

let max = 0;

for(let i = 0; i < stations.length - 1; i++) {

const citiesInside = stations[i + 1] - stations[i] - 1;

const d = parseInt(Math.ceil(citiesInside / 2.0));

if(d > max) {

max = d;

}

if(stations[0] - 0 > max) {

max = stations[0] - 0;

}

if(cities - 1 - stations[stationCount - 1] > max) {

max = cities - 1 - stations[stationCount - 1];

}

console.log(max);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Scala

import scala.io.Source

object FlatlandSpaceStations extends App {
  val lines = Source.stdin.getLines().toList
  val nk = lines.head.split(" ").map(_.toInt)
  val n = nk(0)
  val spaceStations = lines(1).split(" ").map(_.toInt).sorted.toList
  val citiesInside = if(spaceStations.size > 1) spaceStations.sliding(2, 1)
    .map(item => (item(1) - item(0)).abs - 1) else Nil
  val maxDistance = ((spaceStations(0) - 0)
    :: citiesInside.map(c => (c / 2.0).ceil.toInt).toList
    ::: List((n - 1) - spaceStations.last)).max

  println(maxDistance)
}

import scala.io.Source

object FlatlandSpaceStations extends App {

val lines = Source.stdin.getLines().toList

val nk = lines.head.split(" ").map(_.toInt)

val n = nk(0)

val spaceStations = lines(1).split(" ").map(_.toInt).sorted.toList

val citiesInside = if(spaceStations.size > 1) spaceStations.sliding(2, 1)

.map(item => (item(1) - item(0)).abs - 1) else Nil

val maxDistance = ((spaceStations(0) - 0)

:: citiesInside.map(c => (c / 2.0).ceil.toInt).toList

::: List((n - 1) - spaceStations.last)).max

println(maxDistance)

}

Ruby

(cities, stationCount) = gets.strip.split.map(&:to_i)
stations = gets.strip.split.map(&:to_i).sort

max = 0
for i in (0...(stations.length - 1)) do
  cities_inside = stations[i + 1] - stations[i] - 1;
  d = (cities_inside / 2.0).ceil.to_i;
  max = d if(d > max)
end

max = stations[0] if(stations[0] - 0 > max)
max = cities - 1 - stations[stationCount - 1] if(cities - 1 - stations[stationCount - 1] > max)

puts max;

(cities, stationCount) = gets.strip.split.map(&:to_i)

stations = gets.strip.split.map(&:to_i).sort

max = 0

for i in (0...(stations.length - 1)) do

cities_inside = stations[i + 1] - stations[i] - 1;

d = (cities_inside / 2.0).ceil.to_i;

max = d if(d > max)

end

max = stations[0] if(stations[0] - 0 > max)

max = cities - 1 - stations[stationCount - 1] if(cities - 1 - stations[stationCount - 1] > max)

puts max;

Pavol Pidanič

Dokážem na 10 prstoch napočítať do 1023

Hackerrank – Flatland Space Stations