比较文本

查找两个文本文件之间的差异

实时编辑器

折叠未更改行

关闭换行

视图

比对精度

语法高亮

Diffchecker Desktop 运行Diffchecker最安全的方式。获取Diffchecker桌面应用：您的差异永远不会离开您的电脑！获取桌面版

Untitled diff

创建于 11年前差异永不过期

12 删除

行
总计
删除

字符
总计
删除

要继续使用此功能，请升级到 Diffchecker Pro 查看价格

92 行

25 添加

行
总计
添加

字符
总计
添加

要继续使用此功能，请升级到 Diffchecker Pro 查看价格

94 行

// iostream is too mainstream

#include <cstdio>

// bitch please

#include <iostream>

#include <vector>

#include <set>

#include <map>

#include <string>

#include <queue>

#include <stack>

#include <algorithm>

#include <cmath>

#include <iomanip>

#define dibs reserve

#define OVER9000 1234567890123456780LL

#define patkan 9

#define tisic 47

#define soclose 1e-10

#define pi 3.1415926535898

#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)

#define chocolate win

#define ff first

#define ss second

#define abs(x) ((x < 0)?-(x):(x))

#define uint unsigned int

#include <time.h>

// mylittlepony

using namespace std;

vector< vector<int> > G;

vector<int> P;

vector<bool> vis;

vector<int> par;

vector<int> path;

void DFS(int R) {

vis[R] =true;

ALL_THE(G[R],it) if(!vis[*it]) {

// cesta R->*it

P[*it] =1-P[*it];

path.push_back(*it);

par[*it] =R;

DFS(*it);

// cesta *it->R

path.push_back(R);

P[R] =1-P[R];

// este raz?

if(P[*it] == 1) {

// cesta R->*it->R

path.push_back(*it);

path.push_back(R);

P[*it] =0;

P[R] =1-P[R];}

}

int main() {

cin.sync_with_stdio(0);

cin.tie(0);

int N,M;

cin >> N >> M;

G.resize(N);

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

int a,b;

cin >> a >> b;

G[--a].push_back(--b);

G[b].push_back(a);}

P.resize(N);

for(int i =0; i < N; i++) cin >> P[i];

vis.resize(N,false);

par.resize(N);

path.push_back(0);

for(int i =0; i < N; i++) if(P[i] == 1) {

P[0] =1-P[0];

path.push_back(i);

DFS(0);

P[i] =0;

if(P[0] == 1 && !G[0].empty()) {

DFS(i);

path.push_back(G[0][0]);

if(P[i] == 1 && !G[i].empty()) {

P[G[0][0]] =1;

path.push_back(G[i][0]);

path.push_back(0);

P[G[i][0]] =1;

P[0] =0;

path.push_back(i);

path.push_back(G[0][0]);

P[i] =0;

P[G[0][0]] =0;}

path.push_back(G[i][0]);

P[G[i][0]] =0;}

break;}

for(int i =0; i < N; i++) if(P[i] == 1) {

cout << "-1\n";

return 0;}

cout << path.size() << "\n";

for(uint i =0; i < path.size(); i++) cout << path[i]+1 << ((i+1 == path.size())?"\n":" ");

return 0;}

// look at my code

// my code is amazing

已保存差异

原始文本

打开文件

// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <iomanip>
#define dibs reserve
#define OVER9000 1234567890123456780LL
#define patkan 9
#define tisic 47
#define soclose 1e-10
#define pi 3.1415926535898
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define chocolate win
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):(x))
#define uint unsigned int
#include <time.h>
// mylittlepony
using namespace std;

vector< vector<int> > G;
vector<int> P;
vector<bool> vis;
vector<int> par;
vector<int> path;

void DFS(int R) {
	vis[R] =true;
	ALL_THE(G[R],it) if(!vis[*it]) {
		// cesta R->*it
		P[*it] =1-P[*it];
		path.push_back(*it);
		par[*it] =R;
		DFS(*it);
		// cesta *it->R
		path.push_back(R);
		P[R] =1-P[R];
		// este raz?
		if(P[*it] == 1) {
			// cesta R->*it->R
			path.push_back(*it);
			path.push_back(R);
			P[*it] =0;
			P[R] =1-P[R];}
		}
	}

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	int N,M;
	cin >> N >> M;
	G.resize(N);
	for(int i =0; i < M; i++) {
		int a,b;
		cin >> a >> b;
		G[--a].push_back(--b);
		G[b].push_back(a);}
	P.resize(N);
	for(int i =0; i < N; i++) cin >> P[i];
	vis.resize(N,false);
	par.resize(N);
	path.push_back(0);
	P[0] =1-P[0];
	DFS(0);
	if(P[0] == 1 && !G[0].empty()) {
		path.push_back(G[0][0]);
		P[G[0][0]] =1;
		path.push_back(0);
		P[0] =0;
		path.push_back(G[0][0]);
		P[G[0][0]] =0;}
	for(int i =0; i < N; i++) if(P[i] == 1) {
		cout << "-1\n";
		return 0;}

cout << path.size() << "\n";
	for(uint i =0; i < path.size(); i++) cout << path[i]+1 << ((i+1 == path.size())?"\n":" ");
	return 0;}

// look at my code
// my code is amazing

更改后文本

打开文件

vector< vector<int> > G;
vector<int> P;
vector<bool> vis;
vector<int> par;
vector<int> path;

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	int N,M;
	cin >> N >> M;
	G.resize(N);
	for(int i =0; i < M; i++) {
		int a,b;
		cin >> a >> b;
		G[--a].push_back(--b);
		G[b].push_back(a);}
	P.resize(N);
	for(int i =0; i < N; i++) cin >> P[i];
	vis.resize(N,false);
	par.resize(N);
	for(int i =0; i < N; i++) if(P[i] == 1) {
		path.push_back(i);
		P[i] =0;
		DFS(i);
		if(P[i] == 1 && !G[i].empty()) {
			path.push_back(G[i][0]);
			P[G[i][0]] =1;
			path.push_back(i);
			P[i] =0;
			path.push_back(G[i][0]);
			P[G[i][0]] =0;}
		break;}
	for(int i =0; i < N; i++) if(P[i] == 1) {
		cout << "-1\n";
		return 0;}

cout << path.size() << "\n";
	for(uint i =0; i < path.size(); i++) cout << path[i]+1 << ((i+1 == path.size())?"\n":" ");
	return 0;}

// look at my code
// my code is amazing