oj.uz

답안 #778421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778421 2023-07-10T10:05:48 Z Elias Vision Program (IOI19_vision) C++17
100 / 100
 21 ms 2548 KB 
#ifdef _DEBUG
#include <vector>
#include <string>

void construct_network(int H, int W, int K);

int add_and(std::vector<int> Ns);

int add_or(std::vector<int> Ns);

int add_xor(std::vector<int> Ns);

int add_not(int N);
#endif

#ifndef _DEBUG
#include "vision.h"
#endif

#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K)
{
	int nott = add_not(0);
	int def_zero = add_and({0, nott});

	vector<int> xor_single;
	for (int i = 0; i < H; i++)
	{
		vector<int> indices;
		for (int j = 0; j < W; j++)
		{
			indices.push_back(i * W + j);
		}
		xor_single.push_back(add_xor(indices));
	}

	for (int j = 0; j < W; j++)
	{
		vector<int> indices;
		for (int i = 0; i < H; i++)
		{
			indices.push_back(i * W + j);
		}
		xor_single.push_back(add_xor(indices));
	}

	assert(xor_single.size() == W + H);

	vector<int> xor_prefix;
	vector<int> indices;
	for (int i = 0; i < W + H; i++)
	{
		indices.push_back(xor_single[i]);
		xor_prefix.push_back(add_xor(indices));
	}

	assert(xor_prefix.size() == W + H);

	vector<int> bits;
	for (int k = 0; k <= 8; k++)
	{
		int carry = def_zero;

		if (K & (1 << k))
			bits.push_back(add_xor(xor_prefix));
		else
			bits.push_back(add_not(add_xor(xor_prefix)));

		vector<int> new_xor_prefix;
		for (int i = 0; i < W + H; i++)
		{
			new_xor_prefix.push_back(add_and({carry, xor_prefix[i]}));
			carry = add_xor({carry, xor_prefix[i]});
		}
		xor_prefix = new_xor_prefix;
	}
	// cout << "bits: ";
	// for (int i = 0; i < bits.size(); i++)
	// 	cout << bits[i] << " ";
	// cout << "\n";

	add_and(bits);
}

#ifdef _DEBUG

static const int MAX_INSTRUCTIONS = 10000;
static const int MAX_INPUTS = 1000000;

static const int _AND = 0;
static const int _OR = 1;
static const int _XOR = 2;
static const int _NOT = 3;

static inline bool increasing(int a, int b, int c)
{
	return a <= b && b <= c;
}

[[noreturn]] static inline void error(string message)
{
	printf("%s\n", message.c_str());
	exit(0);
}

class InstructionNetwork
{

	struct Instruction
	{
		int type;
		vector<int> input_indexes;

		inline Instruction(int _type, const vector<int> &_input_indexes) : type(_type), input_indexes(_input_indexes)
		{
		}

		inline int apply(int a, int b) const
		{
			switch (type)
			{
			case _AND:
				return a & b;
			case _OR:
				return a | b;
			case _XOR:
				return a ^ b;
			default:
				return 0;
			}
		}

		inline int compute(const vector<int> &memory_cells) const
		{
			int r = memory_cells[input_indexes[0]];
			if (type == _NOT)
				return 1 - r;
			for (int j = 1; j < (int)input_indexes.size(); j++)
				r = apply(r, memory_cells[input_indexes[j]]);
			return r;
		}
	};

	int input_size;
	int total_inputs;
	vector<Instruction> instructions;

public:
	inline void init(int _input_size)
	{
		this->input_size = _input_size;
		this->total_inputs = 0;
		this->instructions.clear();
	}

	inline int add_instruction(int type, const vector<int> &input_indexes)
	{
		if (input_indexes.size() == 0)
			error("Instruction with no inputs");

		if (instructions.size() + 1 > MAX_INSTRUCTIONS)
			error("Too many instructions");

		if (total_inputs + input_indexes.size() > MAX_INPUTS)
			error("Too many inputs");

		instructions.emplace_back(type, input_indexes);
		total_inputs += input_indexes.size();
		int new_index = input_size + (int)instructions.size() - 1;

		for (int input_index : input_indexes)
			if (!increasing(0, input_index, new_index - 1))
				error("Invalid index");

		return new_index;
	}

	inline int compute(vector<int> &memory_cells) const
	{
		for (auto &instruction : instructions)
			memory_cells.push_back(instruction.compute(memory_cells));
		return memory_cells.back();
	}
};

static InstructionNetwork instructionNetwork;

int main()
{
	int H, W, K;
	assert(3 == scanf("%d%d%d", &H, &W, &K));

	FILE *log_file = fopen("log.txt", "w");

	instructionNetwork.init(H * W);
	construct_network(H, W, K);

	// while (true)
	// {
	int rowA, colA, rowB, colB;
	for (rowA = 0; rowA < H; rowA++)
		for (colA = 0; colA < W; colA++)
			for (rowB = 0; rowB < H; rowB++)
				for (colB = 0; colB < W; colB++)
				{
					if (rowA == rowB && colA == colB)
						continue;

					// assert(1 == scanf("%d", &rowA));
					// if (rowA == -1)
					// 	break;
					// assert(3 == scanf("%d%d%d", &colA, &rowB, &colB));

					if ((!increasing(0, rowA, H - 1)) ||
						(!increasing(0, colA, W - 1)) ||
						(!increasing(0, rowB, H - 1)) ||
						(!increasing(0, colB, W - 1)) ||
						(rowA == rowB && colA == colB))
					{
						printf("-1\n");
						fprintf(log_file, "-1\n");
						fflush(stdout);
						fflush(log_file);
						continue;
					}

					vector<int> memory_cells;
					for (int row = 0; row < H; row++)
						for (int col = 0; col < W; col++)
						{
							bool active = (row == rowA && col == colA) || (row == rowB && col == colB);
							memory_cells.push_back(active ? 1 : 0);
						}
					int computation_result = instructionNetwork.compute(memory_cells);

					cout << rowA << " " << colA << " " << rowB << " " << colB << "\n";

					bool should_be = bool((abs(rowA - rowB) + abs(colA - colB)) == K);
					cout << computation_result << " " << should_be << "\n";

					assert(bool(computation_result) == should_be);

					fflush(stdout);

					for (int i = 0; i < (int)memory_cells.size(); i++)
						fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
					fprintf(log_file, "\n");
					fflush(log_file);
				}
	fclose(stdin);
}

int add_and(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_AND, Ns);
}

int add_or(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_OR, Ns);
}

int add_xor(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_XOR, Ns);
}

int add_not(int N)
{
	vector<int> Ns = {N};
	return instructionNetwork.add_instruction(_NOT, Ns);
}

#endif

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from vision.cpp:20:
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:49:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |  assert(xor_single.size() == W + H);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~
vision.cpp:59:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |  assert(xor_prefix.size() == W + H);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 424 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 424 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct
38 Correct 5 ms 1000 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 4 ms 684 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 940 KB Output is correct
45 Correct 5 ms 980 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 6 ms 936 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 688 KB Output is correct
3 Correct 4 ms 680 KB Output is correct
4 Correct 4 ms 684 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 752 KB Output is correct
8 Correct 4 ms 680 KB Output is correct
9 Correct 4 ms 688 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 4 ms 816 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 4 ms 724 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 4 ms 724 KB Output is correct
18 Correct 4 ms 724 KB Output is correct
19 Correct 4 ms 724 KB Output is correct
20 Correct 10 ms 1620 KB Output is correct
21 Correct 10 ms 1620 KB Output is correct
22 Correct 10 ms 1620 KB Output is correct
23 Correct 10 ms 1620 KB Output is correct
24 Correct 11 ms 1624 KB Output is correct
25 Correct 10 ms 1620 KB Output is correct
26 Correct 10 ms 1676 KB Output is correct
27 Correct 17 ms 2512 KB Output is correct
28 Correct 17 ms 2512 KB Output is correct
29 Correct 17 ms 2512 KB Output is correct
30 Correct 17 ms 2548 KB Output is correct
31 Correct 16 ms 2480 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 2480 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 10 ms 1656 KB Output is correct
8 Correct 10 ms 1668 KB Output is correct
9 Correct 18 ms 2520 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 300 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 424 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct
38 Correct 5 ms 1000 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 4 ms 684 KB Output is correct
43 Correct 5 ms 980 KB Output is correct
44 Correct 5 ms 940 KB Output is correct
45 Correct 5 ms 980 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 6 ms 936 KB Output is correct
48 Correct 4 ms 724 KB Output is correct
49 Correct 4 ms 688 KB Output is correct
50 Correct 4 ms 680 KB Output is correct
51 Correct 4 ms 684 KB Output is correct
52 Correct 4 ms 724 KB Output is correct
53 Correct 4 ms 724 KB Output is correct
54 Correct 4 ms 752 KB Output is correct
55 Correct 4 ms 680 KB Output is correct
56 Correct 4 ms 688 KB Output is correct
57 Correct 4 ms 724 KB Output is correct
58 Correct 4 ms 724 KB Output is correct
59 Correct 4 ms 724 KB Output is correct
60 Correct 4 ms 724 KB Output is correct
61 Correct 4 ms 724 KB Output is correct
62 Correct 4 ms 724 KB Output is correct
63 Correct 4 ms 724 KB Output is correct
64 Correct 4 ms 724 KB Output is correct
65 Correct 4 ms 724 KB Output is correct
66 Correct 4 ms 724 KB Output is correct
67 Correct 4 ms 724 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 3 ms 596 KB Output is correct
73 Correct 3 ms 596 KB Output is correct
74 Correct 3 ms 596 KB Output is correct
75 Correct 3 ms 596 KB Output is correct
76 Correct 3 ms 596 KB Output is correct
77 Correct 4 ms 816 KB Output is correct
78 Correct 4 ms 852 KB Output is correct
79 Correct 4 ms 852 KB Output is correct
80 Correct 4 ms 852 KB Output is correct
81 Correct 4 ms 852 KB Output is correct
82 Correct 4 ms 724 KB Output is correct
83 Correct 4 ms 724 KB Output is correct
84 Correct 4 ms 724 KB Output is correct
85 Correct 4 ms 724 KB Output is correct
86 Correct 4 ms 724 KB Output is correct
87 Correct 4 ms 724 KB Output is correct
88 Correct 4 ms 724 KB Output is correct
89 Correct 10 ms 1620 KB Output is correct
90 Correct 10 ms 1620 KB Output is correct
91 Correct 10 ms 1620 KB Output is correct
92 Correct 10 ms 1620 KB Output is correct
93 Correct 11 ms 1624 KB Output is correct
94 Correct 10 ms 1620 KB Output is correct
95 Correct 10 ms 1676 KB Output is correct
96 Correct 17 ms 2512 KB Output is correct
97 Correct 17 ms 2512 KB Output is correct
98 Correct 17 ms 2512 KB Output is correct
99 Correct 17 ms 2548 KB Output is correct
100 Correct 16 ms 2480 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 17 ms 2480 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 3 ms 596 KB Output is correct
106 Correct 4 ms 852 KB Output is correct
107 Correct 4 ms 724 KB Output is correct
108 Correct 4 ms 724 KB Output is correct
109 Correct 10 ms 1656 KB Output is correct
110 Correct 10 ms 1668 KB Output is correct
111 Correct 18 ms 2520 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 340 KB Output is correct
114 Correct 17 ms 2524 KB Output is correct
115 Correct 4 ms 724 KB Output is correct
116 Correct 4 ms 676 KB Output is correct
117 Correct 11 ms 1620 KB Output is correct
118 Correct 10 ms 1748 KB Output is correct
119 Correct 16 ms 2544 KB Output is correct
120 Correct 16 ms 2488 KB Output is correct
121 Correct 17 ms 2512 KB Output is correct
122 Correct 16 ms 2456 KB Output is correct
123 Correct 17 ms 2436 KB Output is correct
124 Correct 17 ms 2532 KB Output is correct
125 Correct 17 ms 2480 KB Output is correct
126 Correct 21 ms 2444 KB Output is correct
127 Correct 17 ms 2468 KB Output is correct
128 Correct 17 ms 2512 KB Output is correct