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

1 remoção

Linhas
Total
Removido

Caracteres
Total
Removido

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

64 linhas

0 adições

Linhas
Total
Adicionado

Caracteres
Total
Adicionado

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

63 linhas

#include<bits/stdc++.h>

using namespace std;

//#define debug(...) printf( __VA_ARGS__ )

#define debug(...) /****nothing****/

#define ll long long

#define ull unsigned long long

#define pb push_back

#define mem(arr,val) memset(arr,val,sizeof(arr))

#define mp make_pair

#define pii pair<int,int>

#define F first

#define S second

#define sz(x) (int)(x).size()

#define nopos string::npos

#define fr(i,a,b) for(i=a;i<=b;i++)

#define frn(i,a,b) for(i=a;i>=b;i--)

set<int> st;

int n,m,i,j,k;

int main()

{

//freopen("d://i.txt","r",stdin);

//freopen("d://o.txt","w",stdout);

cin>>n>>m;

int fl2=1; // every group is not full of traitor

int cnt=0;

while(m--)

{

scanf("%d",&k);

int fl=0; // assume all are traitor in this group

while(k--)

{

scanf("%d",&j);

auto it=st.lower_bound(-j);

if(it!=st.end() && *it==-j)

{

fl=1;

break;

}

st.insert(j);

}

if(fl==0) // all are traitor in this group

{

fl2=0; // at least one group is all are traitor

break;

}

st.clear();

}

printf((fl2==0)?"YES":"NO");

return 0;

}

Diferenças salvas

Texto original

Abrir arquivo

#include<bits/stdc++.h>
using namespace std;

//#define debug(...)   printf( __VA_ARGS__ )
#define debug(...)   /****nothing****/

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mem(arr,val)    memset(arr,val,sizeof(arr))
#define mp make_pair
#define pii pair<int,int>
#define F first
#define S second
#define sz(x) (int)(x).size()
#define nopos string::npos
#define fr(i,a,b) for(i=a;i<=b;i++)
#define frn(i,a,b) for(i=a;i>=b;i--)
set<int> st;
int n,m,i,j,k;

int main()
{
    //freopen("d://i.txt","r",stdin);
    //freopen("d://o.txt","w",stdout);
    cin>>n>>m;

int fl2=1; // every group is not full of traitor
    int cnt=0;

while(m--)
    {
        scanf("%d",&k);

int fl=0; // assume all are traitor in this group

while(k--)
        {
            scanf("%d",&j);
            auto it=st.lower_bound(-j);

if(it!=st.end() && *it==-j)
            {
                fl=1;
                break;
            }

st.insert(j);
        }

if(fl==0) // all are traitor in this group
        {
            fl2=0; // at least one group is all are traitor
            break;
        }

st.clear();
    }

printf((fl2==0)?"YES":"NO");

return 0;
}

Texto alterado

Abrir arquivo

#include<bits/stdc++.h>
using namespace std;

//#define debug(...)   printf( __VA_ARGS__ )
#define debug(...)   /****nothing****/

int main()
{
    //freopen("d://i.txt","r",stdin);
    //freopen("d://o.txt","w",stdout);
    cin>>n>>m;

int fl2=1; // every group is not full of traitor
    int cnt=0;

while(m--)
    {
        scanf("%d",&k);

int fl=0; // assume all are traitor in this group

while(k--)
        {
            scanf("%d",&j);
            auto it=st.lower_bound(-j);

if(it!=st.end() && *it==-j)
            {
                fl=1;
            }

st.insert(j);
        }

if(fl==0) // all are traitor in this group
        {
            fl2=0; // at least one group is all are traitor
            break;
        }

st.clear();
    }

printf((fl2==0)?"YES":"NO");

return 0;
}