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á 8 anosO diff nunca expira

2 remoções

Linhas
Total
Removido

Caracteres
Total
Removido

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

102 linhas

3 adições

Linhas
Total
Adicionado

Caracteres
Total
Adicionado

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

103 linhas

#include <bits/stdc++.h>

using namespace std;

#define mp make_pair

#define pb push_back

#define len(a) (int)a.size()

#define fi first

#define sc second

#define d1(x) cerr<<#x<<":"<<x<<endl;

#define d2(x,y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl;

#define d3(x,y,z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl;

#define left ind+ind

#define right ind+ind+1

#define mid (l+r)/2

const long long LINF = 1e18+5;

const int MOD = (int) 1e9 + 7;

const int LOG = 18;

const int INF = 1e9;

const int N = 1e5+5;

const int M = 350;

const int SQ = 350;

typedef long long int lli;

typedef pair<int,int> pii;

typedef pair<pii,int> piii;

vector <int> ed[N];

int n,m,dp[N][2],s;

int dfs(int cur,int turn) {

if(dp[cur][turn] != -1) return dp[cur][turn];

if (!len(ed[cur])) {

if(turn == 1) return dp[cur][turn] = 0;

else return dp[cur][turn] = 2;

}

bool flag = true;

for (auto i : ed[cur]) {

if(dp[i][!turn] == -1)

flag = false;

}

if(flag == true) return dp[cur][turn] = 1;

int mx = 0;

dp[cur][turn] = 1;

for (auto i : ed[cur])

if(dp[i][!turn] == -1)

mx = max(mx,dfs(i,!turn));

return dp[cur][turn] = mx;

}

void write(int cur,int turn) {

printf("%d ",cur);

for (auto i : ed[cur]) {

if(dp[i][!turn] == 2) {

write(i,!turn);

break;

}

int main() {

memset(dp,-1,sizeof dp);

scanf("%d %d",&n,&m);

for (int i = 1 ; i <= n ; i++) {

int m;

scanf("%d",&m);

while(m--) {

int v;

scanf("%d",&v);

ed[i].pb(v);

}

scanf("%d",&s);

int get = dfs(s,1);

if (get == 0) {

printf("Lose");

}

else if (get == 1) {

printf("Draw");

}

else {

printf("Win\n");

write(s,1);

}

return 0 ;

}

Diferenças salvas

Texto original

Abrir arquivo

#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(x) cerr<<#x<<":"<<x<<endl;
#define d2(x,y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl;
#define d3(x,y,z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl;
#define left ind+ind
#define right ind+ind+1
#define mid (l+r)/2

const long long LINF = 1e18+5;
const int MOD = (int) 1e9 + 7;
const int LOG = 18;
const int INF = 1e9;
const int N = 1e5+5;
const int M = 350;
const int SQ = 350;

typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;

vector <int> ed[N];

int n,m,dp[N][2],s;

int dfs(int cur,int turn) {

if(dp[cur][turn] != -1) return dp[cur][turn];

if (!len(ed[cur])) {
		if(turn == 1) return dp[cur][turn] = 0;
		else return dp[cur][turn] = 2;
	}

bool flag = true;
	for (auto i : ed[cur]) {
		if(dp[i][!turn] == -1)
			flag = false;
	}

if(flag == true) return dp[cur][turn] = 1;

int mx = 0;

dp[cur][turn] = 1;

for (auto i : ed[cur])
		if(dp[i][!turn] == -1)
			mx = max(mx,dfs(i,!turn));
	return dp[cur][turn] = mx;
}

void write(int cur,int turn) {
	printf("%d ",cur);
	for (auto i : ed[cur]) {
		if(dp[i][!turn] == 2) {
			write(i,!turn);
			break;
		}
	}
}

int main() {

memset(dp,-1,sizeof dp);

scanf("%d %d",&n,&m);

for (int i = 1 ; i <= n ; i++) {
		int m;
		scanf("%d",&m);
		while(m--) {
			int v;
			scanf("%d",&v);
			ed[i].pb(v);
		}
	}
	scanf("%d",&s);

int get = dfs(s,1);

if (get == 0) {
		printf("Lose");
	}
	else if (get == 1) {
		printf("Draw");
	}

else {
		printf("Win\n");
		write(s,1);
	}

return 0 ;
}

Texto alterado

Abrir arquivo

#include <bits/stdc++.h>

const long long LINF = 1e18+5;
const int MOD = (int) 1e9 + 7;
const int LOG = 18;
const int INF = 1e9;
const int N = 1e5+5;
const int M = 350;
const int SQ = 350;

typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;

vector <int> ed[N];

int n,m,dp[N][2],s;

int dfs(int cur,int turn) {

if(dp[cur][turn] != -1) return dp[cur][turn];

if (!len(ed[cur])) {
		if(turn == 1) return dp[cur][turn] = 0;
		else return dp[cur][turn] = 2;
	}

bool flag = true;
	for (auto i : ed[cur]) {
		if(dp[i][!turn] == -1)
			flag = false;
	}

if(flag == true) return dp[cur][turn] = 1;

int mx = 0;

dp[cur][turn] = 1;

for (auto i : ed[cur])
		mx = max(mx,dfs(i,!turn));

return dp[cur][turn] = mx;
}

void write(int cur,int turn) {
	printf("%d ",cur);
	for (auto i : ed[cur]) {
		if(dp[i][!turn] == 2) {
			write(i,!turn);
			break;
		}
	}
}

int main() {

memset(dp,-1,sizeof dp);

scanf("%d %d",&n,&m);

for (int i = 1 ; i <= n ; i++) {
		int m;
		scanf("%d",&m);
		while(m--) {
			int v;
			scanf("%d",&v);
			ed[i].pb(v);
		}
	}
	scanf("%d",&s);

int get = dfs(s,1);

if (get == 0) {
		printf("Lose");
	}
	else if (get == 1) {
		printf("Draw");
	}

else {
		printf("Win\n");
		write(s,1);
	}

return 0 ;
}