Confronta il testo

Trova la differenza tra due file di testo

Real-time diff

Unified diff

Collapse lines

Highlight change

Syntax highlighting

Strumenti

Diffchecker Desktop The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!Get Desktop

Comparing sensitive data, confidential files or internal emails?

Most legal and privacy policies prohibit uploading sensitive data online. Diffchecker Desktop ensures your confidential information never leaves your computer. Work offline and compare documents securely.

Download Diffchecker Desktop Learn more

Untitled diff

Created 8 years agoDiff never expires

1 removal

64 lines

0 additions

63 lines

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

}

Diff salvati

Testo originale

Open file

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

Testo modificato

Open file

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