oj.uz

답안 #1049557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049557 2024-08-08T22:49:18 Z gaurezzz Vision Program (IOI19_vision) C++17
100 / 100
 13 ms 3368 KB 
#include <bits/stdc++.h>
#include "vision.h"

#define F first 
#define S second
#define ll long long
#define nd '\n'

using namespace std;

ll n,m,k;
ll casillas[205][205];
ll columns[205];
ll grupos[205][10];
ll binario1[10];

ll rows[205];
ll grupos2[205][10];
ll binario2[10];

int binario3 [10];
//el siguiente proceso se hace primero para columnas y luego para filas

    //Armar las columnas
    //or de los elementos de cada columna

    //Agrupar las columnas por indice y por potencia de 2
    //es decir q vamos a ir uniendo con and cada uno de los segmentos
    //si un segmento tiene and como verdadero, significa q la segunda casilla esta ahi

    //Armar los grupos de cada indice vs sus posibilidades por cada potencia
    //entonces abra q usar and para comprobar que ahi esta la segunda casilla

    //entonces con esto vamos a tener en binario la diferencia de distancias

//cuando ya tengamos en binario las dos diferencias entonces hacemos la suma binaria y ya

void diccionario(){

	ll x=0;

	for (ll i=0; i<n; i++){

		for (ll k=0; k<m; k++){

			casillas[i][k] = x;
			x++;
		}
	}

	//cout << "Imprimiendo diccionario" << nd;

	//for (ll i=0; i<n; i++){

	//	for (ll k=0; k<m; k++) //cout << casillas[i][k] << " ";
		//cout << nd;
	//}
}

void armar_columnas(){

	for (ll k=0; k<m; k++){

		vector <int> armando (n,0);

		for (ll i=0; i<n; i++){
			armando[i] = casillas[i][k];
		}

		columns[k] = add_or(armando);

		//cout << "Armando " << k << nd;

		//for (ll i=0; i<n; i++) //cout << armando[i] << " ";

		//cout << nd;
	}

	//cout << "indices columnas" << nd;

	//for (ll i=0; i<m; i++){

		//cout << columns[i] << " ";
	//} //cout << nd;

	for (ll k=0; k<m; k++){

		ll exp=0;

		for (ll pot=1; pot<m; pot*=2, ++exp){

			vector <int> armando;


			for (ll rec=0; rec<pot; rec++){

				if (rec+k >= m) break;
				armando.push_back(columns[rec+k]);
			}

			//cout << "indice: " << k << nd;
			//cout << "potencia: " << pot << nd;

			//for (ll i=0; i<(ll)armando.size(); i++) //cout << armando[i] << ' ';
			//cout << nd;

			grupos[k][exp] = add_or(armando);
		}
	}

	//cout << "grupos" << nd;

	//for (ll i=0; i<m; i++){

		//for (ll k=0; k<10; k++) //cout << grupos[i][k] << " ";
		//cout << nd;
	//}
}
// or d etodas las posibilidades por indice
// and y luego la casilla de todas las posibilidades
// or de todos los and

void armar_binario1(){

	ll exp=0;

	for (ll pot=1; pot<m; pot*=2, ++exp){

		//cout << "pot " << pot << nd;

		vector <int> columnspos;

		for (ll c1=0; c1<m; c1++){

			vector <int> armando;

			ll c2=c1+pot;

			for (; c2 < m; c2+=pot*2){

				if (grupos[c2][exp] != 0) armando.push_back(grupos[c2][exp]);
			}

			//cout << "Armando" << nd;

			//for (ll i=0; i<(ll)armando.size(); i++) //cout << armando[i] << " ";
			//cout << nd;

			if (armando.empty()) break;

			ll casilla = add_or(armando);
			columnspos.push_back(add_and({(int)columns[c1], (int)casilla}));
		}

		binario1[exp] = add_or(columnspos);

		//cout << "columnspos "<< nd;

		//for (ll i=0; i<(ll)columnspos.size(); i++) //cout << columnspos[i] << " ";
		//cout << nd;

		//cout << "binario 1 "<< nd;

		//for (ll i=0; i<10; i++) //cout << binario1[i] << " ";
		//cout << nd;
	}
}

void armar_filas(){

	for (ll k=0; k<n; k++){

		vector <int> armando (m,0);

		for (ll i=0; i<m; i++){
			armando[i] = casillas[k][i];
		}

		rows[k] = add_or(armando);

		//cout << "Armando " << k << nd;

		//for (ll i=0; i<m; i++) //cout << armando[i] << " ";

		//cout << nd;
	}

	//cout << "indices filas" << nd;

	//for (ll i=0; i<n; i++){

		//cout << rows[i] << " ";
	//} //cout << nd;

	for (ll k=0; k<n; k++){

		ll exp=0;

		for (ll pot=1; pot<n; pot*=2, ++exp){

			vector <int> armando;


			for (ll rec=0; rec<pot; rec++){

				if (rec+k >= n) break;
				armando.push_back(rows[rec+k]);
			}

			//cout << "indice: " << k << nd;
			//cout << "potencia: " << pot << nd;

			//for (ll i=0; i<(int)armando.size(); i++) //cout << armando[i] << ' ';
			//cout << nd;

			grupos2[k][exp] = add_or(armando);
		}
	}

	//cout << "grupos" << nd;

	//for (ll i=0; i<m; i++){

	//	for (ll k=0; k<10; k++) //cout << grupos2[i][k] << " ";
		//cout << nd;
	//}
}

void armar_binario2(){

	ll exp=0;

	for (ll pot=1; pot<n; pot*=2, ++exp){

		vector <int> filaspos;

		for (ll c1=0; c1<n; c1++){

			vector <int> armando;

			ll c2=c1+pot;

			for (; c2 < n; c2+=pot*2){

				if (grupos2[c2][exp] != 0) armando.push_back(grupos2[c2][exp]);
			}

			//cout << "Armando" << nd;

			//for (ll i=0; i<(ll)armando.size(); i++) //cout << armando[i] << " ";
			//cout << nd;

			if (armando.empty()) break;

			ll casilla = add_or(armando);
			filaspos.push_back(add_and({(int)rows[c1], (int)casilla}));
		}

		binario2[exp] = add_or(filaspos);

		//cout << "filaspos "<< nd;

		//for (ll i=0; i<(ll)filaspos.size(); i++) //cout << filaspos[i] << " ";
		//cout << nd;

		//cout << "binario 2 "<< nd;

		//for (ll i=0; i<10; i++) //cout << binario2[i] << " ";
		//cout << nd;
	}
}

void columnas(){

	armar_columnas();
	armar_binario1();

}

void filas(){

	armar_filas();
	armar_binario2();

}

void sumar (){

	int operaciones[9];
	int ant;

	ant=0;

	//for (int i=0; i<10; i++) //cout << binario1[i] << " ";
	//cout << nd;

	//for (int i=0; i<10; i++) //cout << binario2[i] << " ";
	//cout << nd;

	int cero = add_and({add_not(0), 0});
	if (binario1[0] == 0) binario1[0] = cero;
	if (binario2[0] == 0) binario2[0] = cero;

	operaciones[4] = add_or({(int)binario1[0], (int)binario2[0]});
	operaciones[5] = add_and({(int)binario1[0], (int)binario2[0]});
	operaciones[6] = add_not(operaciones[5]);
	binario3[0] = add_and({operaciones[4], operaciones[6]});
	ant = operaciones[5];

	for (ll i=1; i<10; i++){

		if (binario1[i] == 0) binario1[i] = cero;
		if (binario2[i] == 0) binario2[i] = cero;

		operaciones[0] = add_and({ant, (int)binario1[i]});
		operaciones[1] = add_or({ant, (int)binario1[i]});
		operaciones[2] = add_not(operaciones[0]);
		operaciones[3] = add_and({operaciones[1], operaciones[2]});
		operaciones[4] = add_or({operaciones[3], (int)binario2[i]});
		operaciones[5] = add_and({operaciones[3], (int)binario2[i]});
		operaciones[6] = add_not(operaciones[5]);
		binario3[i] = add_and({operaciones[4], operaciones[6]});
		ant = add_or({operaciones[0],operaciones[5]});
	}
}

void comparar(){

	int aux = add_not(0);
	int uno = add_or({0,aux});

	bitset<10> kBinario (k);

	vector <int> r(10);

	for (int i=0; i<10; i++){

		if (kBinario[i]){

			r[i] = add_and({binario3[i], uno});
		}

		else{

			r[i] = add_not({binario3[i]});
		}
		
	}

	add_and(r);
}


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

	n=H, m=W, k=K;

	diccionario();

	columnas();
	filas();

	sumar();

	comparar();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 444 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 404 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 444 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 444 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 404 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 444 KB Output is correct
38 Correct 3 ms 1300 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 3 ms 1372 KB Output is correct
44 Correct 3 ms 1152 KB Output is correct
45 Correct 4 ms 1372 KB Output is correct
46 Correct 5 ms 1352 KB Output is correct
47 Correct 3 ms 1372 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1236 KB Output is correct
2 Correct 5 ms 1236 KB Output is correct
3 Correct 4 ms 1240 KB Output is correct
4 Correct 5 ms 1076 KB Output is correct
5 Correct 4 ms 1492 KB Output is correct
6 Correct 4 ms 1496 KB Output is correct
7 Correct 4 ms 1496 KB Output is correct
8 Correct 4 ms 1496 KB Output is correct
9 Correct 4 ms 1240 KB Output is correct
10 Correct 4 ms 1240 KB Output is correct
11 Correct 4 ms 1240 KB Output is correct
12 Correct 4 ms 1240 KB Output is correct
13 Correct 4 ms 1240 KB Output is correct
14 Correct 4 ms 1240 KB Output is correct
15 Correct 4 ms 1496 KB Output is correct
16 Correct 4 ms 1492 KB Output is correct
17 Correct 4 ms 1496 KB Output is correct
18 Correct 4 ms 1496 KB Output is correct
19 Correct 4 ms 1496 KB Output is correct
20 Correct 4 ms 1492 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 2 ms 1048 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 3 ms 1112 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 3 ms 1136 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 4 ms 1240 KB Output is correct
14 Correct 5 ms 1240 KB Output is correct
15 Correct 4 ms 1240 KB Output is correct
16 Correct 4 ms 1240 KB Output is correct
17 Correct 4 ms 1496 KB Output is correct
18 Correct 4 ms 1496 KB Output is correct
19 Correct 4 ms 1496 KB Output is correct
20 Correct 7 ms 2152 KB Output is correct
21 Correct 8 ms 2264 KB Output is correct
22 Correct 7 ms 2260 KB Output is correct
23 Correct 7 ms 2516 KB Output is correct
24 Correct 7 ms 2024 KB Output is correct
25 Correct 7 ms 2024 KB Output is correct
26 Correct 9 ms 2260 KB Output is correct
27 Correct 12 ms 3280 KB Output is correct
28 Correct 13 ms 3280 KB Output is correct
29 Correct 13 ms 3280 KB Output is correct
30 Correct 12 ms 3284 KB Output is correct
31 Correct 11 ms 3284 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 604 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 3284 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 4 ms 1116 KB Output is correct
5 Correct 4 ms 1240 KB Output is correct
6 Correct 4 ms 1496 KB Output is correct
7 Correct 7 ms 2264 KB Output is correct
8 Correct 7 ms 2008 KB Output is correct
9 Correct 11 ms 3368 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 444 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 404 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 444 KB Output is correct
38 Correct 3 ms 1300 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 3 ms 1372 KB Output is correct
44 Correct 3 ms 1152 KB Output is correct
45 Correct 4 ms 1372 KB Output is correct
46 Correct 5 ms 1352 KB Output is correct
47 Correct 3 ms 1372 KB Output is correct
48 Correct 4 ms 1236 KB Output is correct
49 Correct 5 ms 1236 KB Output is correct
50 Correct 4 ms 1240 KB Output is correct
51 Correct 5 ms 1076 KB Output is correct
52 Correct 4 ms 1492 KB Output is correct
53 Correct 4 ms 1496 KB Output is correct
54 Correct 4 ms 1496 KB Output is correct
55 Correct 4 ms 1496 KB Output is correct
56 Correct 4 ms 1240 KB Output is correct
57 Correct 4 ms 1240 KB Output is correct
58 Correct 4 ms 1240 KB Output is correct
59 Correct 4 ms 1240 KB Output is correct
60 Correct 4 ms 1240 KB Output is correct
61 Correct 4 ms 1240 KB Output is correct
62 Correct 4 ms 1496 KB Output is correct
63 Correct 4 ms 1492 KB Output is correct
64 Correct 4 ms 1496 KB Output is correct
65 Correct 4 ms 1496 KB Output is correct
66 Correct 4 ms 1496 KB Output is correct
67 Correct 4 ms 1492 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 860 KB Output is correct
73 Correct 2 ms 860 KB Output is correct
74 Correct 3 ms 856 KB Output is correct
75 Correct 2 ms 1048 KB Output is correct
76 Correct 2 ms 856 KB Output is correct
77 Correct 3 ms 1112 KB Output is correct
78 Correct 3 ms 1116 KB Output is correct
79 Correct 3 ms 1136 KB Output is correct
80 Correct 3 ms 1116 KB Output is correct
81 Correct 3 ms 1116 KB Output is correct
82 Correct 4 ms 1240 KB Output is correct
83 Correct 5 ms 1240 KB Output is correct
84 Correct 4 ms 1240 KB Output is correct
85 Correct 4 ms 1240 KB Output is correct
86 Correct 4 ms 1496 KB Output is correct
87 Correct 4 ms 1496 KB Output is correct
88 Correct 4 ms 1496 KB Output is correct
89 Correct 7 ms 2152 KB Output is correct
90 Correct 8 ms 2264 KB Output is correct
91 Correct 7 ms 2260 KB Output is correct
92 Correct 7 ms 2516 KB Output is correct
93 Correct 7 ms 2024 KB Output is correct
94 Correct 7 ms 2024 KB Output is correct
95 Correct 9 ms 2260 KB Output is correct
96 Correct 12 ms 3280 KB Output is correct
97 Correct 13 ms 3280 KB Output is correct
98 Correct 13 ms 3280 KB Output is correct
99 Correct 12 ms 3284 KB Output is correct
100 Correct 11 ms 3284 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 604 KB Output is correct
103 Correct 11 ms 3284 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 2 ms 860 KB Output is correct
106 Correct 4 ms 1116 KB Output is correct
107 Correct 4 ms 1240 KB Output is correct
108 Correct 4 ms 1496 KB Output is correct
109 Correct 7 ms 2264 KB Output is correct
110 Correct 7 ms 2008 KB Output is correct
111 Correct 11 ms 3368 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 11 ms 3296 KB Output is correct
115 Correct 5 ms 1032 KB Output is correct
116 Correct 4 ms 1492 KB Output is correct
117 Correct 9 ms 2264 KB Output is correct
118 Correct 7 ms 1980 KB Output is correct
119 Correct 12 ms 3140 KB Output is correct
120 Correct 11 ms 3284 KB Output is correct
121 Correct 11 ms 3284 KB Output is correct
122 Correct 13 ms 3280 KB Output is correct
123 Correct 12 ms 3280 KB Output is correct
124 Correct 11 ms 3284 KB Output is correct
125 Correct 11 ms 3284 KB Output is correct
126 Correct 12 ms 3284 KB Output is correct
127 Correct 11 ms 3284 KB Output is correct
128 Correct 12 ms 3284 KB Output is correct