9. Pokemon Dont Go - C# - Софтуерен университет

bparvanova 7 Точки

9. Pokemon Dont Go - C#

Здравейте,

Бихте ли ми помогнали със задачата по-долу.

В Judge ми дава 70/100, опитвам се да оправя кода и проверките, но не успявам.

Ето го кода ми: https://pastebin.com/0wT0JQsK

Условие на задачата:

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.

Тагове:

17/02/2021 00:49:48 C# Fundamentals

Виж всички отговори

krum_43 756 Точки

Решението ти е добро.Както е коментирал колегата ако замениш

input[0] = input[lastElementInput]; със input[0] = lastElementInput и

input[lastElementInput] = input[0]; със input[input.count-1]= input[0];

може би ще вземеш100/100.

17/02/2021 10:02:07 17/02/2021 10:14:58

bparvanova 7 Точки

Благодаря!

Оправих ги, но пак ми гърми на 7-ми тест. Явно не ми е било писано с тази задача :)

17/02/2021 20:08:33

Axiomatik 2422 Точки

Strange, when I submit your solution at judge I get 100%. Maybe you just had a time-out error, which usually gets resolved by itself when submitting again.

Code:


using System;
using System.Collections.Generic;
using System.Linq;
 
namespace _9_Pokemon_Don_t_Go
{
    class Program
    {
        static void Main(string[] args)
        {
            List<int> input = Console.ReadLine()
                .Split()
                .Select(int.Parse)
                .ToList();
 
            int sumRemovedElements = 0;
 
            while (input.Count > 0)
            {
                int index = int.Parse(Console.ReadLine());
 
                int lastElementInput = input[input.Count - 1];

                int removedElementValue = 0;
 
                if (index < 0)
                {
                    removedElementValue = input[0];
                    sumRemovedElements += removedElementValue;
                    input[0] = input[input.Count - 1];
                    IncreaseDecrease(input, removedElementValue);
                }
 
                else if (index >= input.Count)
                {
                    removedElementValue = input[input.Count - 1];
                    sumRemovedElements += removedElementValue;
                    input[input.Count - 1] = input[0];
                    IncreaseDecrease(input, removedElementValue);
                }
 
                else
                {
                    removedElementValue = input[index];
                    sumRemovedElements += removedElementValue;
                    input.RemoveAt(index);
                    IncreaseDecrease(input, removedElementValue);
                }
            }
 
            Console.WriteLine($"{sumRemovedElements}");
 
        }
 
        private static void IncreaseDecrease(List<int> input, int removedElementValue)
        {
            for (int i = 0; i < input.Count; i++)
            {
                if (input[i] <= removedElementValue)
                {
                    input[i] += removedElementValue;
                }
                else
                {
                    input[i] -= removedElementValue;
                }
            }
        }
    }
}

17/02/2021 20:36:53

krum_43 756 Точки

При мен също дава 100/100.

18/02/2021 07:41:19

bparvanova 7 Точки

Finally I got 100/100 too :).

I just removed the variable int lastElementInput = input[input.Count - 1] and used instead input[input.Count - 1].

Thanks a lot for the help!

18/02/2021 11:29:00

Виж всички отговори