Помощ за задача 09. Pokemon Don't Go, C# Fundamentals май 2019

PetarNeshkov5360 23 Точки

Помощ за задача 09. Pokemon Don't Go, C# Fundamentals май 2019

Здравейте! Решението на задачата ми дава в Judge 80/100. Ще се радвам някой, ако ми помогне. Благодаря предварително!

Pastebin решение: https://pastebin.com/j3y8EnjK

9.*Pokemon Don’t Go

Ely likes to play Pokemon Go a lot. But Pokemon Go bankrupted … So the developers made Pokemon Don’t Go out of depression. And so Ely now plays Pokemon Don’t Go. In Pokemon Don’t Go, when you walk to a certain pokemon, those closer to you, naturally get further, and those further from you, get closer.

You will receive a sequence of integers, separated by spaces – the distances to the pokemons. Then you will begin receiving integers, which will correspond to indexes in that sequence.

When you receive an index, you must remove the element at that index from the sequence (as if you’ve captured the pokemon).

You must increase the value of all elements in the sequence, which are less or equal to the removed element, with the value of the removed element.
You must decrease the value of all elements in the sequence, which are greater than the removed element, with the value of the removed element.

If the given index is less than 0, remove the first element of the sequence, and copy the last element to its place.

If the given index is greater than the last index of the sequence, remove the last element from the sequence, and copy the first element to its place.

The increasing and decreasing of elements should be done in these cases, also. The element, whose value you should use is the removed element.

The program ends when the sequence has no elements (there are no pokemons left for Ely to catch).

Input

On the first line of input you will receive a sequence of integers, separated by spaces.
On the next several lines you will receive integers – the indexes.

Output

When the program ends, you must print the summed value of all removed elements.

Constrains

The input data will consist only of valid integers in the range [-2.147.483.648, 2.147.483.647].

Examples

Input

Output

Comments

4 5 3

The array is {4, 5, 3}. The index is 1.

We remove 5, and we increase all the lower ones and decrease all higher ones.

In this case there are no higher than 5.

The result is {9, 8}.

The index is 1. So we remove 8, and decrease all the higher ones.

The result is {1}.

The index is 0. So we remove 1.

There are no elements left, so we print the sum of all removed elements.

5 + 8 + 1 = 14.

5 10 6 3 5

Step 1: {11, 4, 9, 11}

Step 2: {22, 15, 20, 22}

Step 3: {7, 5, 7}

Step 4: {2, 2}

Step 5: {4, 4}

Step 6: {8}

Step 7: {} (empty).

Result = 6 + 11 + 15 + 5 + 2 + 4 + 8 = 51.

Тагове:

16/08/2020 19:33:19 C# Fundamentals

Axiomatik 2422 Точки

Best Answer

The problem came from your index validation between lines 51-67, otherwise code was OK.

Refactored code (100%) :

using System;
using System.Linq;
using System.Collections.Generic;

namespace ConsoleApp9
{
class Program
{
static void Main(string[] args)
{

List<int> list = Console.ReadLine().Split().Select(int.Parse).ToList();

List<int> DeletedNumbers = new List<int>();

double totalSum = 0;

while (list.Count != 0)
{
//bool check = true;
bool checkInsideIndex = true;
int index = int.Parse(Console.ReadLine());
int numberIndex = 0;

if (index < 0)
{
//DeletedNumbers.Add(list[0]);
numberIndex = list[0];
totalSum += list[0];
list.RemoveAt(0);
list.Insert(0, list[list.Count - 1]);
checkInsideIndex = false;
}
else if (index > list.Count - 1)
{
//DeletedNumbers.Add(list[list.Count - 1]);
numberIndex = list[list.Count - 1];
totalSum += list[list.Count - 1];
list.RemoveAt(list.Count - 1);
list.Add(list[0]);
checkInsideIndex = false;
}

if (checkInsideIndex)
{
numberIndex = list[index];
totalSum += numberIndex;
list.RemoveAt(index);
}

//if (index > list.Count - 1)
//{
// NumberIndex = list[list.Count - 1];
// index = list.Count - 1;
// check = false;
//}
//else if (index < 0)
//{
// NumberIndex = list[0];
// index = 0;
// check = false;
//}
//else
//{

// NumberIndex = list[index];
//}

for (int i = 0; i < list.Count; i++)
{
if (list[i] <= numberIndex)
{
list[i] += numberIndex;
}
else if (list[i] > numberIndex)
{
list[i] -= numberIndex;
}
}
//DeletedNumbers.Add(NumberIndex);
//if (check == true)
//{
// list.RemoveAt(index);
//}
}
//double sum = DeletedNumbers.Sum();
Console.WriteLine(totalSum);

}
}
}

16/08/2020 20:43:00

PetarNeshkov5360 23 Точки

Благодаря много :)

16/08/2020 21:44:22

Във форума е въведено ограничение, което позволява на потребителите единствено да разглеждат публикуваните въпроси.

Помощ за задача 09. Pokemon Don't Go, C# Fundamentals май 2019

9.*Pokemon Don’t Go

Input

Output

Constrains

Examples