oj.uz

Submission #241286

# Submission time Handle Problem Language Result Execution time Memory
241286 2020-06-23T16:57:09 Z Berted Vision Program (IOI19_vision) C++14
100 / 100
 15 ms 1408 KB 
#include "vision.h"
#include <vector>
#include <iostream>

using namespace std;

vector<int> temp;
int hp[501], vp[501];
int w;

/* Idea : We check based on diagonals, since there are two diagonals, the one
that is valid is the pair that are the furthest apart. Therefore, we should check
if there is a pair of diags such that distance = K and the opposite diag must have distance <= K.*/

void construct_network(int H, int W, int K)
{
	//Diagonal 1 [HW, HW + H + W - 1)
    for (int i = 0; i < H + W - 1; i++) 
    {
    	int y = 0, x = i;
    	if (x > W - 1) {x = W - 1; y = i - W + 1;}
    	while (x >= 0 && y >= 0 && y < H && x < W)
    	{
    		temp.push_back(y * W + x);
    		y++; x--;
    	}
    	w = add_or(temp);
    	temp.clear();
    }

    //Diagonal 2 [HW + H + W - 1, HW + 2H + 2W - 2)
    for (int i = 0; i < H + W - 1; i++) 
    {
    	int y = 0, x = W - 1 - i;
    	if (x < 0) {x = 0; y = i - W + 1;}
    	while (x >= 0 && y >= 0 && y < H && x < W)
    	{
    		temp.push_back(y * W + x);
    		y++; x++;
    	}
    	w = add_or(temp);
    	temp.clear();
    }

    // Prefix Diag 1 [HW + 2H + 2W - 2, HW + 3H + 3W - 3)
    temp.push_back(H * W);
    w = add_or(temp);
    temp.clear();
    for (int i = H * W + 1; i < H * W + W + H - 1; i++)
    {
    	temp.push_back(w); temp.push_back(i);
    	w = add_or(temp);
    	temp.clear();
    }

    // Prefix Diag 2 [HW + 3H + 3W - 3, HW + 4H + 4W - 4)
    temp.push_back(H * W + W + H - 1);
    w = add_or(temp);
    temp.clear();
    for (int i = H * W + W + H; i < H * W + 2 * (W + H - 1); i++)
    {
    	temp.push_back(w); temp.push_back(i);
    	w = add_or(temp);
    	temp.clear();
    }

    // Check Diag 1 [HW + 4H + 4W - 4, HW + 5H + 5W - 5 - K)
    for (int i = K; i < H + W - 1; i++)
    {
    	temp.push_back(H * W + i);
    	temp.push_back(H * W + i - K);
    	w = add_and(temp);
    	temp.clear();
    }

    // Check Diag 2 [HW + 5H + 5W - 5 - K, HW + 6H + 6W - 6 - 2K)
    for (int i = K; i < H + W - 1; i++)
    {
    	temp.push_back(H * W + H + W - 1 + i);
    	temp.push_back(H * W + H + W - 1 + i - K);
    	w = add_and(temp);
    	temp.clear();
    }

    if (K < H + W - 2)
    {
    	// Check SDiag 1 [HW + 6H + 6W - 6 - 2K, HW + 7H + 7W - 8 - 3K)
	    for (int i = K + 1; i < H + W - 1; i++)
	    {
	    	temp.push_back(H * W + i);
	    	temp.push_back(H * W + 2 * (H + W - 1) + i - K - 1);
	    	w = add_and(temp);
	    	temp.clear();
	    }

	    // Check SDiag 2 [HW + 7H + 7W - 8 - 3K, HW + 8H + 8W - 10 - 4K)
	    for (int i = K + 1; i < H + W - 1; i++)
	    {
	    	temp.push_back(H * W + H + W - 1 + i);
	    	temp.push_back(H * W + 3 * (H + W - 1) + i - K - 1);
	    	w = add_and(temp);
	    	temp.clear();
	    }
    }
    
    // OR CD1 [HW + 8H + 8W - 10 - 4K]
    for (int i = H * W + 4 * (H + W - 1); i < H * W + 5 * (H + W - 1) - K; i++) temp.push_back(i);
    w = add_or(temp);
    temp.clear();

    // OR CD2 [HW + 8H + 8W - 9 - 4K]
    for (int i = H * W + 5 * (H + W - 1) - K; i < H * W + 6 * (H + W - 1) - 2 * K; i++) temp.push_back(i);
    w = add_or(temp);
    temp.clear();

    if (K < H + W - 2)
    {
    	// OR SCD1 [HW + 8H + 8W - 8 - 4K]
	    for (int i = H * W + 6 * (H + W - 1) - 2 * K; i < H * W + 7 * (H + W - 1) - 3 * K - 1; i++) temp.push_back(i);
	    w = add_or(temp);
	    temp.clear();

	    // OR SCD2 [HW + 8H + 8W - 7 - 4K]
	    for (int i = H * W + 7 * (H + W - 1) - 3 * K - 1; i < H * W + 8 * (H + W - 1) - 4 * K - 2; i++) temp.push_back(i);
	    w = add_or(temp);
	    temp.clear();

	    // NOR SCD1 [HW + 8H + 8W - 6 - 4K]
	    w = add_not(w - 1);
	    // NOR SCD2 [HW + 8H + 8W - 5 - 4K]
	    w = add_not(w - 1);

	    // AND OCD1, NOSCD2
	    temp.push_back(w);
	    temp.push_back(w - 5);
	    w = add_and(temp);
	    temp.clear();

	    // AND OCD2, NOSCD1
	    temp.push_back(w - 2);
	    temp.push_back(w - 5);
	    w = add_and(temp);
	    temp.clear();
    }

    // Answer
    temp.push_back(w);
    temp.push_back(w - 1);
    w = add_or(temp);
}

/*
void construct_network(int H, int W, int K) // K(H + W) + 2K + 1.. (somthlikethat)
{
	for (int i = 0; i < H; i++)
	{
		for (int j = W * i; j < W * (i + 1); j++) temp.push_back(j);
		w = add_or(temp);
		temp.clear();
	}
	for (int i = 0; i < W; i++)
	{
		for (int j = i; j < H * W; j += W) temp.push_back(j);
		w = add_or(temp);
		temp.clear();
	}
	for (int j = H * W; j < H * W + H; j++) temp.push_back(j);
	w = hp[0] = add_xor(temp);
	temp.clear();
	for (int j = H * W + H; j < H * W + H + W; j++) temp.push_back(j);
	w = vp[0] = add_xor(temp);
	temp.clear();
	for (int i = 1; i <= K; i++)
	{
		int bef = w;
		for (int j = H * W + i; j < H * W + H; j++)
		{
			temp.push_back(j); temp.push_back(j - i);
			w = add_and(temp);
			temp.clear();
		}
		if (w != bef)
		{
			for (int i = bef + 1; i <= w; i++) {temp.push_back(i);}
			w = add_or(temp);
			temp.clear();
			hp[i] = w;
		}
	}
	//cout << "HERE\n";
	for (int i = 1; i <= K; i++)
	{
		int bef = w;
		for (int j = H * W + H + i; j < H * W + H + W; j++)
		{
			temp.push_back(j); temp.push_back(j - i);
			w = add_and(temp);
			temp.clear();
		}
		if (w != bef)
		{
			for (int i = bef + 1; i <= w; i++) {temp.push_back(i);}
			w = add_or(temp);
			temp.clear();
			vp[i] = w;
		}
	}
	int bef = w;
	for (int i = 0; i <= K; i++)
	{
		if (vp[i] && hp[K - i])
		{
			temp.push_back(vp[i]);
			temp.push_back(hp[K - i]);
			w = add_and(temp);
			temp.clear();
		}
	}
	for (int i = bef + 1; i <= w; i++) temp.push_back(i);
	w = add_or(temp);

}
*/

/*
void construct_network(int H, int W, int K) // Sub-6
{
   for (int i = 0; i <= K; i++)
   {
   	  if (i < H && K - i < W)
   	  {
   	  	 temp.push_back(i * W + K - i);
   	  }
   }
   w = add_or(temp);
}
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 8 ms 640 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 6 ms 512 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 7 ms 640 KB Output is correct
44 Correct 9 ms 640 KB Output is correct
45 Correct 7 ms 640 KB Output is correct
46 Correct 8 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 416 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 14 ms 896 KB Output is correct
21 Correct 10 ms 896 KB Output is correct
22 Correct 9 ms 768 KB Output is correct
23 Correct 9 ms 768 KB Output is correct
24 Correct 10 ms 896 KB Output is correct
25 Correct 10 ms 768 KB Output is correct
26 Correct 9 ms 768 KB Output is correct
27 Correct 15 ms 1408 KB Output is correct
28 Correct 14 ms 1408 KB Output is correct
29 Correct 14 ms 1408 KB Output is correct
30 Correct 14 ms 1280 KB Output is correct
31 Correct 13 ms 1280 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 5 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1408 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 14 ms 1408 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 8 ms 640 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 384 KB Output is correct
41 Correct 6 ms 512 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 7 ms 640 KB Output is correct
44 Correct 9 ms 640 KB Output is correct
45 Correct 7 ms 640 KB Output is correct
46 Correct 8 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 6 ms 512 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 6 ms 512 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 6 ms 512 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 7 ms 384 KB Output is correct
65 Correct 6 ms 512 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 4 ms 256 KB Output is correct
69 Correct 5 ms 256 KB Output is correct
70 Correct 4 ms 384 KB Output is correct
71 Correct 4 ms 256 KB Output is correct
72 Correct 6 ms 512 KB Output is correct
73 Correct 6 ms 384 KB Output is correct
74 Correct 6 ms 512 KB Output is correct
75 Correct 6 ms 384 KB Output is correct
76 Correct 5 ms 384 KB Output is correct
77 Correct 6 ms 512 KB Output is correct
78 Correct 7 ms 512 KB Output is correct
79 Correct 6 ms 512 KB Output is correct
80 Correct 6 ms 512 KB Output is correct
81 Correct 7 ms 512 KB Output is correct
82 Correct 6 ms 512 KB Output is correct
83 Correct 5 ms 384 KB Output is correct
84 Correct 6 ms 416 KB Output is correct
85 Correct 5 ms 384 KB Output is correct
86 Correct 6 ms 512 KB Output is correct
87 Correct 6 ms 384 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 14 ms 896 KB Output is correct
90 Correct 10 ms 896 KB Output is correct
91 Correct 9 ms 768 KB Output is correct
92 Correct 9 ms 768 KB Output is correct
93 Correct 10 ms 896 KB Output is correct
94 Correct 10 ms 768 KB Output is correct
95 Correct 9 ms 768 KB Output is correct
96 Correct 15 ms 1408 KB Output is correct
97 Correct 14 ms 1408 KB Output is correct
98 Correct 14 ms 1408 KB Output is correct
99 Correct 14 ms 1280 KB Output is correct
100 Correct 13 ms 1280 KB Output is correct
101 Correct 5 ms 256 KB Output is correct
102 Correct 5 ms 256 KB Output is correct
103 Correct 14 ms 1408 KB Output is correct
104 Correct 5 ms 384 KB Output is correct
105 Correct 7 ms 512 KB Output is correct
106 Correct 7 ms 512 KB Output is correct
107 Correct 5 ms 512 KB Output is correct
108 Correct 6 ms 512 KB Output is correct
109 Correct 10 ms 896 KB Output is correct
110 Correct 10 ms 896 KB Output is correct
111 Correct 14 ms 1408 KB Output is correct
112 Correct 5 ms 256 KB Output is correct
113 Correct 5 ms 256 KB Output is correct
114 Correct 15 ms 1408 KB Output is correct
115 Correct 5 ms 384 KB Output is correct
116 Correct 5 ms 512 KB Output is correct
117 Correct 10 ms 768 KB Output is correct
118 Correct 10 ms 896 KB Output is correct
119 Correct 14 ms 1280 KB Output is correct
120 Correct 14 ms 1280 KB Output is correct
121 Correct 14 ms 1408 KB Output is correct
122 Correct 14 ms 1280 KB Output is correct
123 Correct 15 ms 1408 KB Output is correct
124 Correct 14 ms 1408 KB Output is correct
125 Correct 14 ms 1280 KB Output is correct
126 Correct 14 ms 1280 KB Output is correct
127 Correct 13 ms 1280 KB Output is correct
128 Correct 13 ms 1280 KB Output is correct