Texte vergleichen

Finde den Unterschied zwischen zwei Textdateien

Live-Editor

Gleiches ausblenden

Zeilenumbruch aus

Ansicht

Vergleichsgenauigkeit

Syntaxhervorhebung

Diffchecker Desktop Der sicherste Weg, Diffchecker zu nutzen. Hol dir die Desktop-App: Deine Diffs verlassen nie deinen Computer!Desktop holen

Untitled diff

Erstellt vor 11 JahrenDiff läuft nie ab

3 Entfernungen

Zeilen
Gesamt
Entfernt

Zeichen
Gesamt
Entfernt

Um diese Funktion weiterhin zu nutzen, aktualisiere auf Diffchecker Pro Preise anzeigen

97 Zeilen

29 Hinzufügungen

Zeilen
Gesamt
Hinzugefügt

Zeichen
Gesamt
Hinzugefügt

Um diese Funktion weiterhin zu nutzen, aktualisiere auf Diffchecker Pro Preise anzeigen

121 Zeilen

#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;

}

Gespeicherte Diffs

Originaltext

Datei öffnen

#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;
}

Bearbeitung

Datei öffnen

#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;
}