• Projects -
  • Rating -
  • Rating 278

Budget: 1000 UAH Deadline: 2 days

Good day! Essentially, this is a classic union-find: adding a path merges two cells into one component, and the query checks if they are already connected, returning C or NC. I have done such tasks in Python and C++, so I will do it quickly considering the input format from your file. I will look at the attached file with details — and it will be ready in a day or two. Regarding payment, I work through the Safe freelancehunt, as it is more reliable for both of us.

Vasil M.

Vasil M.

Winning proposal
8 0
  • Projects 9
  • Rating -
  • Rating 596

Budget: 1000 UAH Deadline: 1 day

Hello.

I have already implemented a solution for this task.

The program is written in ANSI C / C89 without using C++ and third-party libraries. The implementation conforms to the format from the PDF: it reads the input file from the command line argument, processes L commands to add horizontal or vertical tracks, and Q commands to check the connectivity of two points.

Union-Find / DSU was used for the task, as it is necessary to determine whether two points belong to the same connectivity component rather than searching for a route. I also created an optimized version: an iterative find for DSU and additional skip arrays were used to avoid reprocessing already handled parts of horizontal and vertical tracks. This reduces the number of unnecessary operations on overlapping or long segments.

The code compiles via GCC with the command:

  • Projects 18
  • Rating 4.4
  • Rating 2 208

Budget: 2000 UAH Deadline: 1 day

Hello! I am ready to complete the task strictly according to the ANSI C (C89) standard without any compiler warnings. I have already analyzed the technical specifications and addressed critical pitfalls: I rewrote the DSU to an iterative algorithm (protection against Stack Overflow on $1000 \times 1000$ boards) and implemented a robust state machine parser for commands split across multiple lines, with exact preservation of the format for output. I guarantee 100% passing of automated tests, clean memory without memory leaks, and delivery in the shortest possible time.

  • Projects 10
  • Rating 5.0
  • Rating 1 510

Budget: 1000 UAH Deadline: 3 days

We have experience in designing algorithms for grid structures and optimizing board topology. We implement the task through the shortest path algorithm or the construction of a minimum spanning tree, taking into account the N x M constraints. We are ready to promptly prepare a solution considering all technical requirements.

Proposals concealed

The list does not show proposals concealed by the client or freelancer with a Plus profile, as well as proposals violating rules