Submission #3,532

2023-02-28 18:29:49

csharp

Partially correct 38/50

37ms

26032 KiB

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace táblajáék
{
    class Program
    {
        static void Main(string[] args)
        {
            int K = int.Parse(Console.ReadLine());
            int[] lepesek = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int viz = 0;
            long szel = 0;

            foreach (var item in lepesek)
            {
                if (item == 0)
                {
                    viz++;
                    szel = szel * 2;
                }
                if (item == 1)
                {
                    viz++;
                    szel = szel * 2 + 1;
                }
                if (item == 2)
                {
                    viz--;
                    szel = szel / 2;            //páros indexről tudunk jobbra lépni
                }
                if (item == 3)
                {
                    szel--;
                }
                if (item == 4)
                {
                    szel++;
                }
            }
            Console.WriteLine(viz);
            Console.WriteLine(Convert.ToString(szel, 2));
            Console.ReadKey();

        }

    }
}

	Sum	Test	Verdict		Time	Memory
base	38/50
		1	Accepted	0/0	30ms	22396 KiB
		2	Accepted	0/0	34ms	22552 KiB
		3	Accepted	3/3	32ms	23180 KiB
		4	Accepted	3/3	32ms	23412 KiB
		5	Accepted	3/3	32ms	23792 KiB
		6	Partially correct	1/3	32ms	24192 KiB
		7	Accepted	3/3	30ms	24352 KiB
		8	Accepted	3/3	32ms	24964 KiB
		9	Accepted	3/3	32ms	25112 KiB
		10	Partially correct	1/3	35ms	26020 KiB
		11	Accepted	3/3	32ms	25272 KiB
		12	Partially correct	1/3	37ms	25784 KiB
		13	Accepted	4/4	32ms	25436 KiB
		14	Partially correct	1/4	35ms	26032 KiB
		15	Accepted	4/4	32ms	25444 KiB
		16	Partially correct	1/4	35ms	25960 KiB
		17	Accepted	4/4	32ms	25472 KiB