Comparar texto

Encontre a diferença entre dois arquivos de texto

Editor live

Recolher inalteradas

Sem quebra de linha

Layout

Nível de detalhe

Realce de sintaxe

Diffchecker Desktop A maneira mais segura de usar o Diffchecker. Obtenha o aplicativo Diffchecker Desktop: seus diffs nunca saem do seu computador!Obter Desktop

Untitled diff

Criado há 11 anosO diff nunca expira

3 remoções

Linhas
Total
Removido

Caracteres
Total
Removido

Para continuar usando este recurso, atualize para Diffchecker Pro Ver preços

97 linhas

29 adições

Linhas
Total
Adicionado

Caracteres
Total
Adicionado

Para continuar usando este recurso, atualize para Diffchecker Pro Ver preços

121 linhas

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <algorithm>

#include <utility>

#include <string>

#include <iostream>

#include <cmath>

#define MAXN 400005

using namespace std;

struct datanode

{

int a, b;

};

static int s[MAXN];

static int a[MAXN];

static int p[MAXN];

static char b[MAXN];

static int res[MAXN];

int resc;

void DFS (int point, int par)

{

res[resc] = point;

resc++;

p[point] ^= 1;

int i;

for (i = s[point]; i < s[point+1]; i++)

{

if (!b[a[i]])

{

b[a[i]] = 1;

DFS(a[i], point);

}

if (par == -1)

{

if (p[point]) resc--;

if (p[point])

{

resc--;

p[point] ^= 1;

}

return;

}

if (p[point])

{

res[resc] = par;

resc++;

p[par] ^= 1;

res[resc] = point;

resc++;

p[point] ^= 1;

}

res[resc] = par;

resc++;

p[par] ^= 1;

}

int main ()

{

int N, M;

scanf("%d %d",&N,&M);

static struct datanode data[MAXN];

memset(s,0,sizeof(s));

int i;

for (i = 0; i < M; i++)

{

scanf("%d %d",&(data[i].a),&(data[i].b));

(data[i].a)--;

(data[i].b)--;

s[data[i].a]++;

s[data[i].b]++;

}

for (i = 1; i <= N; i++) s[i] += s[i-1];

for (i = 0; i < M; i++)

{

s[data[i].a]--;

a[s[data[i].a]] = data[i].b;

s[data[i].b]--;

a[s[data[i].b]] = data[i].a;

}

memset(b,0,sizeof(b));

for (i = 0; i < N; i++) scanf("%d",&(p[i]));

resc = 0;

b[0] = 1;

DFS(0, -1);

int point = 0;

while ((point < N) && (!p[point])) point++;

if (point == N)

{

printf("0\n");

return 0;

}

b[point] = 1;

DFS(point, -1);

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

{

if (p[i])

{

printf("-1\n");

return 0;

}

printf("%d\n",resc);

if (resc)

{

for (i = 0; i < resc; i++)

{

if (i) printf(" ");

printf("%d",res[i] + 1);

}

printf("\n");

}

return 0;

}

Diferenças salvas

Texto original

Abrir arquivo

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <utility>
#include <string>
#include <iostream>
#include <cmath>
#define MAXN 400005

using namespace std;

struct datanode
{
	int a, b;
};
	
static int s[MAXN];
static int a[MAXN];
static int p[MAXN];
static char b[MAXN];
static int res[MAXN];
int resc;

void DFS (int point, int par)
{
	res[resc] = point;
	resc++;
	p[point] ^= 1;
	int i;
	for (i = s[point]; i < s[point+1]; i++)
	{
		if (!b[a[i]])
		{
			b[a[i]] = 1;
			DFS(a[i], point);
		}
	}
	if (par == -1)
	{
		if (p[point]) resc--;
		return;
	}
	if (p[point])
	{
		res[resc] = par;
		resc++;
		p[par] ^= 1;
		res[resc] = point;
		resc++;
		p[point] ^= 1;
	}
	res[resc] = par;
	resc++;
	p[par] ^= 1;
}

int main ()
{
	int N, M;
	scanf("%d %d",&N,&M);
	static struct datanode data[MAXN];
	memset(s,0,sizeof(s));
	int i;
	for (i = 0; i < M; i++)
	{
		scanf("%d %d",&(data[i].a),&(data[i].b));
		(data[i].a)--;
		(data[i].b)--;
		s[data[i].a]++;
		s[data[i].b]++;
	}
	for (i = 1; i <= N; i++) s[i] += s[i-1];
	for (i = 0; i < M; i++)
	{
		s[data[i].a]--;
		a[s[data[i].a]] = data[i].b;
		s[data[i].b]--;
		a[s[data[i].b]] = data[i].a;
	}
	memset(b,0,sizeof(b));
	for (i = 0; i < N; i++) scanf("%d",&(p[i]));
	resc = 0;
	b[0] = 1;
	DFS(0, -1);
	printf("%d\n",resc);
	if (resc)
	{
		for (i = 0; i < resc; i++)
		{
			if (i) printf(" ");
			printf("%d",res[i] + 1);
		}
		printf("\n");
	}
	return 0;
}

Texto alterado

Abrir arquivo

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <utility>
#include <string>
#include <iostream>
#include <cmath>
#define MAXN 400005

using namespace std;

struct datanode
{
	int a, b;
};
	
static int s[MAXN];
static int a[MAXN];
static int p[MAXN];
static char b[MAXN];
static int res[MAXN];
int resc;

void DFS (int point, int par)
{
	res[resc] = point;
	resc++;
	p[point] ^= 1;
	int i;
	for (i = s[point]; i < s[point+1]; i++)
	{
		if (!b[a[i]])
		{
			b[a[i]] = 1;
			DFS(a[i], point);
		}
	}
	if (par == -1)
	{
		if (p[point])
		{
			resc--;
			p[point] ^= 1;
		}
		return;
	}
	if (p[point])
	{
		res[resc] = par;
		resc++;
		p[par] ^= 1;
		res[resc] = point;
		resc++;
		p[point] ^= 1;
	}
	res[resc] = par;
	resc++;
	p[par] ^= 1;
}

int point = 0;
	while ((point < N) && (!p[point])) point++;

if (point == N)
	{
		printf("0\n");
		return 0;
	}

b[point] = 1;
	DFS(point, -1);

for (i = 0; i < N; i++)
	{
		if (p[i])
		{
			printf("-1\n");
			return 0;
		}
	}

printf("%d\n",resc);
	if (resc)
	{
		for (i = 0; i < resc; i++)
		{
			if (i) printf(" ");
			printf("%d",res[i] + 1);
		}
		printf("\n");
	}
	return 0;
}