[Solution] Pixelated Solution Circle Round 2 2022 - Code Jam 2022

[Solution] Pixelated Solution Circle Round 2 2022 - Code Jam 2022

Problem

Typical computer images are matrices of pixels, with each pixel being a small square of a specific color. Drawing lines that are not perfectly parallel to the axes of the pixel matrix results in imperfections. Drawing circles is an extreme example where those imperfections arise.

Suppose we have a picture consisting of 2R+1$2\mathbf{R}+1$ by 2R+1$2\mathbf{R}+1$ pixels, and we number the rows and columns of pixels between −R$-\mathbf{R}$ and R$R$, such that the center pixel is at row 0$0$ and column 0$0$. Initially, all pixels are white. Then, a circle of radius R$R$ and centered in the picture can be drawn in black by the following pseudocode, where set_pixel_to_black(x, y) makes the pixel at row x$x$ and column y$y$ be colored black. 

Notice that some pixels may be set to black more than once by the code, but the operation is idempotent (that is, calling set_pixel_to_black on a pixel that is already black changes nothing).

Solution Click Below:-  CLICK HERE

The following is pseudocode for a function to draw a filled circle (starting from an all-white picture).

draw_circle_filled(R):
  for x between -R and R, inclusive {
    for y between -R and R, inclusive {
      if round(sqrt(x * x + y * y)) <= R:
        set_pixel_to_black(x, y)
    }
  }

And finally, the following is pseudocode to incorrectly draw a filled circle:

draw_circle_filled_wrong(R):
  for r between 0 and R, inclusive {
    draw_circle_perimeter(r)
  }

Spiraling Into Control Solution Round 2 2022

Pixelated Solution Circle Round 2 2022 

Saving the Jelly Solution Round 2 2022

I, O Bot Solution Round 2 2022 

Given R$R$, calculate the number of pixels that would have different colors between a picture in which draw_circle_filled(R$R$) is called and another one in which draw_circle_filled_wrong(R$R$) is called.

Input

The first line of the input gives the number of test cases, T$T$. T$T$ test cases follow. Each test case is described in a single line containing a single integer R$R$, the radius of the circle to draw.

Output

For each test case, output one line containing Case #x$x$: y$y$, where x$x$ is the test case number (starting from 1) and y$y$ is the number of pixels that would have different colors between a picture in which draw_circle_filled(R$R$) is called and another one in which draw_circle_filled_wrong(R$R$) is called.

Limits

Memory limit: 1 GB.
1≤T≤100$1\le \mathbf{T}\le 100$.

Test Set 1 (Visible Verdict)

Time limit: 10 seconds.
1≤R≤100$1\le \mathbf{R}\le 100$.

Test Set 2 (Hidden Verdict)

Time limit: 15 seconds.
1≤R≤105$1\le \mathbf{R}\le {10}^5$.