oj.uz

Submission #799062

# Submission time Handle Problem Language Result Execution time Memory
799062 2023-07-31T09:09:50 Z esomer Vision Program (IOI19_vision) C++17
100 / 100
 90 ms 10564 KB 
#include<bits/stdc++.h>
#include "vision.h"

using namespace std;

// #define endl "\n"

typedef long long ll;

int h, w;

void calc(int n, vector<int>& dist, int k, bool type){
	vector<int> val(n); //Whether each row has at least one black.
	for(int i = 0; i < n; i++){
		vector<int> nws;
		if(type == 0){
			for(int j = 0; j < w; j++){
				nws.push_back(i * w + j);
			}
		}else{
			for(int j = 0; j < h; j++){
				nws.push_back(j * w + i);
			}
		}
		val[i] = add_or(nws);
	}
	vector<int> previous((int)dist.size());
	dist[0] = add_xor(val);
	vector<int> all_others = {dist[0]};
	int org = n;
	if(n > 160){
		for(int i = 160; i < n; i++){
			vector<int> possibilities;
			for(int j = 0; j + i < n; j++){
				possibilities.push_back(add_and({val[j], val[j+i]}));
			}
			dist[i] = add_or(possibilities);
			all_others.push_back(dist[i]);
		}
		n = 160;
	}
	int orr1 = add_or(all_others);
	for(int q = 2; q < n; q++){
		bool prime = 1;
		for(int k = 2; k * k <= q; k++){
			if((q % k) == 0){
				prime = 0;
			}
		}
		if(prime){
			vector<int> powers = {q};
			int x = q * q;
			while(x < n){
				powers.push_back(x);
				x *= q;
			}
			int before = orr1;
			vector<vector<int>> all_res((int)powers.size());
			for(int i = 0; i < org; i++){
				vector<bool> done(org, 0);
				int lst = -1;
				for(int l = 0; l < (int)powers.size(); l++){
					if(i + powers[l] >= org || i >= powers[l]) continue;
					vector<int> nws;
					for(int j = 0; j < org; j++){
						if(j % powers[l] != i && done[j] == 0){
							done[j] = 1;
							nws.push_back(val[j]);
						}
					}
					int orr;
					if(lst == -1){
						orr = add_or(nws);
					}else{
						nws.push_back(lst);
						orr = add_or(nws);
					}
					lst = orr;
					all_res[l].push_back(orr);
				}
			}
			for(int l = (int)powers.size() - 1; l >= 0; l--){
				int orr = add_not(add_and(all_res[l]));
				int nott = add_not(before);
				previous[powers[l]] = add_and({orr, nott});
				before = add_or({before, previous[powers[l]]});
			}
		}
	}
	int before = orr1;
	for(int d = n - 1; d > 0; d--){
		if(d == 1){
			//It's only 1 if it is not any of the previous.
			int nott = add_not(before);
			dist[d] = add_and({nott, add_not(dist[0])});
			continue;
		}
		vector<int> all_res;
		int x = d;
		for(int k = 2; k * k <= x; k++){
			ll crr = 1;
			while(x % k == 0){
				crr *= k;
				x /= k;
			}
			if(crr != 1){
				all_res.push_back(previous[crr]);
			}
		}
		if(x > 1){
			all_res.push_back(previous[x]);
		}
		int orr = add_and(all_res);
		//Now, I'm one if and(orr, not(orr_before)) is 1, so I'm one and no one before is one).
		int nott = add_not(before);
		dist[d] = add_and({orr, nott});
		before = add_or({before, dist[d]});
	}
}

void construct_network(int H, int W, int K){
	//Now, I want to get the value of each row.
	h = H;
	w = W;
	vector<int> distr(H, 0);
	vector<int> distc(W, 0);
	calc(H, distr, K, 0);
	calc(W, distc, K, 1);
	vector<int> possibilities;
	for(int i = 0; i < (int)distr.size() && i <= K; i++){
		int j = K - i;
		if(j >= (int)distc.size()) continue;
		possibilities.push_back(add_and({distr[i], distc[j]}));
	}
	add_or(possibilities);
}

// 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){
// 			cout << "type "<< type << endl;
// 			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();
// 	}

// 	int get_total_input(){
// 		return total_inputs;
// 	}
// };


// 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;
// 		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);

// 		printf("%d\n", computation_result);
// 		fflush(stdout);
// 		// printf("Total queries: %d\n", (int)memory_cells.size() - H * W);
// 		for(int i = 0; i < (int)memory_cells.size(); i++){
// 			fprintf(log_file, "i: %d", i);
// 			fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
// 			fprintf(log_file, "\n");
// 		}
// 		// printf("Total input: %d\n", instructionNetwork.get_total_input());
// 		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);
// }

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 300 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 300 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 340 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 392 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 300 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 300 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 340 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 392 KB Output is correct
38 Correct 15 ms 1964 KB Output is correct
39 Correct 7 ms 852 KB Output is correct
40 Correct 6 ms 852 KB Output is correct
41 Correct 8 ms 1236 KB Output is correct
42 Correct 9 ms 1236 KB Output is correct
43 Correct 15 ms 1952 KB Output is correct
44 Correct 14 ms 2004 KB Output is correct
45 Correct 15 ms 1972 KB Output is correct
46 Correct 14 ms 2004 KB Output is correct
47 Correct 14 ms 1956 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4004 KB Output is correct
2 Correct 36 ms 4040 KB Output is correct
3 Correct 37 ms 4008 KB Output is correct
4 Correct 36 ms 4040 KB Output is correct
5 Correct 36 ms 4096 KB Output is correct
6 Correct 36 ms 4036 KB Output is correct
7 Correct 36 ms 4040 KB Output is correct
8 Correct 45 ms 4024 KB Output is correct
9 Correct 36 ms 4044 KB Output is correct
10 Correct 36 ms 4048 KB Output is correct
11 Correct 37 ms 4028 KB Output is correct
12 Correct 36 ms 4068 KB Output is correct
13 Correct 36 ms 4144 KB Output is correct
14 Correct 42 ms 4040 KB Output is correct
15 Correct 38 ms 4124 KB Output is correct
16 Correct 36 ms 4040 KB Output is correct
17 Correct 36 ms 4104 KB Output is correct
18 Correct 37 ms 4112 KB Output is correct
19 Correct 36 ms 4128 KB Output is correct
20 Correct 37 ms 4112 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 304 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 8 ms 1132 KB Output is correct
4 Correct 7 ms 1064 KB Output is correct
5 Correct 8 ms 1108 KB Output is correct
6 Correct 10 ms 1076 KB Output is correct
7 Correct 8 ms 1108 KB Output is correct
8 Correct 15 ms 2004 KB Output is correct
9 Correct 16 ms 2100 KB Output is correct
10 Correct 16 ms 2032 KB Output is correct
11 Correct 16 ms 2004 KB Output is correct
12 Correct 16 ms 2004 KB Output is correct
13 Correct 36 ms 4092 KB Output is correct
14 Correct 36 ms 4012 KB Output is correct
15 Correct 36 ms 4084 KB Output is correct
16 Correct 36 ms 4060 KB Output is correct
17 Correct 36 ms 4008 KB Output is correct
18 Correct 36 ms 4044 KB Output is correct
19 Correct 36 ms 4056 KB Output is correct
20 Correct 47 ms 6132 KB Output is correct
21 Correct 47 ms 6116 KB Output is correct
22 Correct 54 ms 6124 KB Output is correct
23 Correct 48 ms 6216 KB Output is correct
24 Correct 48 ms 6168 KB Output is correct
25 Correct 48 ms 6124 KB Output is correct
26 Correct 47 ms 6172 KB Output is correct
27 Correct 85 ms 10556 KB Output is correct
28 Correct 81 ms 10552 KB Output is correct
29 Correct 82 ms 10564 KB Output is correct
30 Correct 81 ms 10528 KB Output is correct
31 Correct 82 ms 10528 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 10476 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 1068 KB Output is correct
4 Correct 16 ms 2112 KB Output is correct
5 Correct 36 ms 4100 KB Output is correct
6 Correct 39 ms 4060 KB Output is correct
7 Correct 47 ms 6216 KB Output is correct
8 Correct 48 ms 6088 KB Output is correct
9 Correct 82 ms 10436 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 300 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 300 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 340 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 392 KB Output is correct
38 Correct 15 ms 1964 KB Output is correct
39 Correct 7 ms 852 KB Output is correct
40 Correct 6 ms 852 KB Output is correct
41 Correct 8 ms 1236 KB Output is correct
42 Correct 9 ms 1236 KB Output is correct
43 Correct 15 ms 1952 KB Output is correct
44 Correct 14 ms 2004 KB Output is correct
45 Correct 15 ms 1972 KB Output is correct
46 Correct 14 ms 2004 KB Output is correct
47 Correct 14 ms 1956 KB Output is correct
48 Correct 36 ms 4004 KB Output is correct
49 Correct 36 ms 4040 KB Output is correct
50 Correct 37 ms 4008 KB Output is correct
51 Correct 36 ms 4040 KB Output is correct
52 Correct 36 ms 4096 KB Output is correct
53 Correct 36 ms 4036 KB Output is correct
54 Correct 36 ms 4040 KB Output is correct
55 Correct 45 ms 4024 KB Output is correct
56 Correct 36 ms 4044 KB Output is correct
57 Correct 36 ms 4048 KB Output is correct
58 Correct 37 ms 4028 KB Output is correct
59 Correct 36 ms 4068 KB Output is correct
60 Correct 36 ms 4144 KB Output is correct
61 Correct 42 ms 4040 KB Output is correct
62 Correct 38 ms 4124 KB Output is correct
63 Correct 36 ms 4040 KB Output is correct
64 Correct 36 ms 4104 KB Output is correct
65 Correct 37 ms 4112 KB Output is correct
66 Correct 36 ms 4128 KB Output is correct
67 Correct 37 ms 4112 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 304 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 8 ms 1132 KB Output is correct
73 Correct 7 ms 1064 KB Output is correct
74 Correct 8 ms 1108 KB Output is correct
75 Correct 10 ms 1076 KB Output is correct
76 Correct 8 ms 1108 KB Output is correct
77 Correct 15 ms 2004 KB Output is correct
78 Correct 16 ms 2100 KB Output is correct
79 Correct 16 ms 2032 KB Output is correct
80 Correct 16 ms 2004 KB Output is correct
81 Correct 16 ms 2004 KB Output is correct
82 Correct 36 ms 4092 KB Output is correct
83 Correct 36 ms 4012 KB Output is correct
84 Correct 36 ms 4084 KB Output is correct
85 Correct 36 ms 4060 KB Output is correct
86 Correct 36 ms 4008 KB Output is correct
87 Correct 36 ms 4044 KB Output is correct
88 Correct 36 ms 4056 KB Output is correct
89 Correct 47 ms 6132 KB Output is correct
90 Correct 47 ms 6116 KB Output is correct
91 Correct 54 ms 6124 KB Output is correct
92 Correct 48 ms 6216 KB Output is correct
93 Correct 48 ms 6168 KB Output is correct
94 Correct 48 ms 6124 KB Output is correct
95 Correct 47 ms 6172 KB Output is correct
96 Correct 85 ms 10556 KB Output is correct
97 Correct 81 ms 10552 KB Output is correct
98 Correct 82 ms 10564 KB Output is correct
99 Correct 81 ms 10528 KB Output is correct
100 Correct 82 ms 10528 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 83 ms 10476 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 7 ms 1068 KB Output is correct
106 Correct 16 ms 2112 KB Output is correct
107 Correct 36 ms 4100 KB Output is correct
108 Correct 39 ms 4060 KB Output is correct
109 Correct 47 ms 6216 KB Output is correct
110 Correct 48 ms 6088 KB Output is correct
111 Correct 82 ms 10436 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 82 ms 10556 KB Output is correct
115 Correct 36 ms 4040 KB Output is correct
116 Correct 36 ms 4052 KB Output is correct
117 Correct 47 ms 6108 KB Output is correct
118 Correct 47 ms 6112 KB Output is correct
119 Correct 81 ms 10364 KB Output is correct
120 Correct 81 ms 10436 KB Output is correct
121 Correct 82 ms 10444 KB Output is correct
122 Correct 90 ms 10480 KB Output is correct
123 Correct 81 ms 10436 KB Output is correct
124 Correct 82 ms 10516 KB Output is correct
125 Correct 81 ms 10484 KB Output is correct
126 Correct 81 ms 10512 KB Output is correct
127 Correct 86 ms 10496 KB Output is correct
128 Correct 86 ms 10508 KB Output is correct