Comparar texto

Encuentra la diferencia entre dos archivos de texto

Editor live

Ocultar sin cambios

Sin ajuste de línea

Vista

Nivel de detalle

Resaltado de sintaxis

Diffchecker Desktop La forma más segura de usar Diffchecker. ¡Obtén la app de Diffchecker Desktop: tus diffs nunca salen de tu computadora!Obtener Desktop

Untitled diff

Creado hace 9 añosEl diff nunca expira

1 eliminación

Líneas
Total
Eliminado

Caracteres
Total
Eliminado

Para continuar usando esta función, actualice a Diffchecker Pro Ver precios

75 líneas

13 adiciones

Líneas
Total
Añadido

Caracteres
Total
Añadido

Para continuar usando esta función, actualice a Diffchecker Pro Ver precios

88 líneas

#include <bits/stdc++.h>

using namespace std;

#define SIZE 100000

#define MAX_VALUE 100002

int main () {

int T, N, Q;

cin >> T;

while(T--) {

cin >> N >> Q;

int arr[SIZE];

for (int i = 0; i < N; ++i)

{

scanf("%d", arr+i);

}

for (int q = 0; q < Q; ++q)

{

int a, b, c, d;

scanf("%d %d %d %d", &a, &b, &c, &d);

a--; b--; c--; d--;

if(a < c && c <=b) {

int t = b;

b = c-1;

c = t+1;

} else if( c < a && a <= d) {

int t = a;

a = d+1;

d = t-1;

}

if(a == c || (b-a < 0)) {

cout << "YES" << endl;

continue;

}

int countNums1[MAX_VALUE+2] = {0}; // 1-indexed, and an extra element as sentinal value

int countNums2[MAX_VALUE+2] = {0};

int minArr = MAX_VALUE, maxArr = 1;

for (int i = a, j=c; i <= b; ++i, j++)

{

countNums1[arr[i]]++;

countNums2[arr[j]]++;

minArr = min(min(minArr, arr[i]), arr[j]);

maxArr = max(max(maxArr, arr[i]), arr[j]);

}

// cout << minArr << " " << maxArr << endl;

int i = minArr, j = minArr;

int misMatch = 0;

do {

while(countNums1[i] == 0 && i <= maxArr) {

i++;

}

if(i > maxArr)

break;

while(countNums2[j] == 0 && j <= maxArr) {

j++;

}

if(j > maxArr)

break;

if(i != j) {

int minC = min(countNums1[i], countNums2[j]);

misMatch += minC;

countNums1[i] -= minC;

countNums2[j] -= minC;

} else {

if(countNums1[i] < countNums2[j]) {

countNums2[j] -= countNums1[i];

i++;

} else if(countNums2[j] < countNums1[i]) {

countNums1[i] -= countNums2[j];

j++;

} else {

i++;

j++;

}

} while(misMatch < 2);

if(misMatch < 2)

cout << "YES" << endl;

else

cout << "NO" << endl;

}

return 0;

}

Diferencias guardadas

Texto original

Abrir archivo

#include <bits/stdc++.h>
using namespace std;
 
#define SIZE 100000
#define MAX_VALUE 100002
 
int main () {
	int T, N, Q;
	cin >> T;
	while(T--) {
		cin >> N >> Q;
		int arr[SIZE];
		for (int i = 0; i < N; ++i)
		{
			scanf("%d", arr+i);
		}
		for (int q = 0; q < Q; ++q)
		{
			int a, b, c, d;
			scanf("%d %d %d %d", &a, &b, &c, &d);
			a--; b--; c--; d--;
			int countNums1[MAX_VALUE+2] = {0}; // 1-indexed, and an extra element as sentinal value
			int countNums2[MAX_VALUE+2] = {0};
			int minArr = MAX_VALUE, maxArr = 1;
			for (int i = a, j=c; i <= b; ++i, j++)
			{
				countNums1[arr[i]]++;
				countNums2[arr[j]]++;
				minArr = min(min(minArr, arr[i]), arr[j]);
				maxArr = max(max(maxArr, arr[i]), arr[j]);
			}
 
			// cout << minArr << " " << maxArr << endl;
			int i = minArr, j = minArr;
			int misMatch = 0;
			do {
				while(countNums1[i] == 0 && i <= maxArr) {
					i++;
				}
				if(i > maxArr)
					break;
 
				while(countNums2[j] == 0 && j <= maxArr) {
					j++;
				}
				if(j > maxArr)
					break;
				
				if(i != j) {
					int minC = min(countNums1[i], countNums2[j]);
					misMatch += minC;
					countNums1[i] -= minC;
					countNums2[j] -= minC;
				} else {
					if(countNums1[i] < countNums2[j]) {
						countNums2[j] -= countNums1[i];
						i++;
					} else if(countNums2[j] < countNums1[i]) {
						countNums1[i] -= countNums2[j];
						j++;
					} else {
						i++;
						j++;
					}
				}
			} while(misMatch < 2);
 
			if(misMatch < 2)
				cout << "YES" << endl;
			else
				cout << "NO" << endl;
		}
	}
	return 0;
}

Texto modificado

Abrir archivo

#include <bits/stdc++.h>
using namespace std;
 
#define SIZE 100000
#define MAX_VALUE 100002
 
int main () {
	int T, N, Q;
	cin >> T;
	while(T--) {
		cin >> N >> Q;
		int arr[SIZE];
		for (int i = 0; i < N; ++i)
		{
			scanf("%d", arr+i);
		}
		for (int q = 0; q < Q; ++q)
		{
			int a, b, c, d;
			scanf("%d %d %d %d", &a, &b, &c, &d);
			a--; b--; c--; d--;
			if(a < c && c <=b) {
				int t = b;
				b = c-1;
				c = t+1;
			} else if( c < a && a <= d) {
				int t = a;
				a = d+1;
				d = t-1;
			}
			if(a == c || (b-a < 0)) {
				cout << "YES" << endl;
				continue;
			}
			int countNums1[MAX_VALUE+2] = {0}; // 1-indexed, and an extra element as sentinal value
			int countNums2[MAX_VALUE+2] = {0};
			int minArr = MAX_VALUE, maxArr = 1;
			for (int i = a, j=c; i <= b; ++i, j++)
			{
				countNums1[arr[i]]++;
				countNums2[arr[j]]++;
				minArr = min(min(minArr, arr[i]), arr[j]);
				maxArr = max(max(maxArr, arr[i]), arr[j]);
			}
 
			// cout << minArr << " " << maxArr << endl;
			int i = minArr, j = minArr;
			int misMatch = 0;
			do {
				while(countNums1[i] == 0 && i <= maxArr) {
					i++;
				}
				if(i > maxArr)
					break;
 
				while(countNums2[j] == 0 && j <= maxArr) {
					j++;
				}
				if(j > maxArr)
					break;
				
				if(i != j) {
					int minC = min(countNums1[i], countNums2[j]);
					misMatch += minC;
					countNums1[i] -= minC;
					countNums2[j] -= minC;
				} else {
					if(countNums1[i] < countNums2[j]) {
						countNums2[j] -= countNums1[i];
						i++;
					} else if(countNums2[j] < countNums1[i]) {
						countNums1[i] -= countNums2[j];
						j++;
					} else {
						i++;
						j++;
					}
				}
			} while(misMatch < 2);
 
			if(misMatch < 2)
				cout << "YES" << endl;
			else
				cout << "NO" << endl;
		}
	}
	return 0;
}