Diff
checker
Text
Text
Images
Documents
Excel
Folders
Legal
Enterprise
Desktop
Pricing
Sign in
Download Diffchecker Desktop
Compare text
Find the difference between two text files
Tools
History
Real-time editor
Hide unchanged lines
Disable line wrap
Layout
Split
Unified
Diff precision
Smart
Word
Char
Syntax highlighting
Choose syntax
Ignore
Transform text
Go to first change
Edit input
Diffchecker Desktop
The most secure way to run Diffchecker. Get the Diffchecker Desktop app: your diffs never leave your computer!
Get Desktop
Untitled diff
Created
9 years ago
Diff never expires
Clear
Export
Share
Explain
1 removal
Lines
Total
Removed
Characters
Total
Removed
To continue using this feature, upgrade to
Diff
checker
Pro
View Pricing
64 lines
Copy
0 additions
Lines
Total
Added
Characters
Total
Added
To continue using this feature, upgrade to
Diff
checker
Pro
View Pricing
63 lines
Copy
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
using namespace std;
//#define debug(...) printf( __VA_ARGS__ )
//#define debug(...) printf( __VA_ARGS__ )
#define debug(...) /****nothing****/
#define debug(...) /****nothing****/
#define ll long long
#define ll long long
#define ull unsigned long long
#define ull unsigned long long
#define pb push_back
#define pb push_back
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define mp make_pair
#define mp make_pair
#define pii pair<int,int>
#define pii pair<int,int>
#define F first
#define F first
#define S second
#define S second
#define sz(x) (int)(x).size()
#define sz(x) (int)(x).size()
#define nopos string::npos
#define nopos string::npos
#define fr(i,a,b) for(i=a;i<=b;i++)
#define fr(i,a,b) for(i=a;i<=b;i++)
#define frn(i,a,b) for(i=a;i>=b;i--)
#define frn(i,a,b) for(i=a;i>=b;i--)
set<int> st;
set<int> st;
int n,m,i,j,k;
int n,m,i,j,k;
int main()
int main()
{
{
//freopen("d://i.txt","r",stdin);
//freopen("d://i.txt","r",stdin);
//freopen("d://o.txt","w",stdout);
//freopen("d://o.txt","w",stdout);
cin>>n>>m;
cin>>n>>m;
int fl2=1; // every group is not full of traitor
int fl2=1; // every group is not full of traitor
int cnt=0;
int cnt=0;
while(m--)
while(m--)
{
{
scanf("%d",&k);
scanf("%d",&k);
int fl=0; // assume all are traitor in this group
int fl=0; // assume all are traitor in this group
while(k--)
while(k--)
{
{
scanf("%d",&j);
scanf("%d",&j);
auto it=st.lower_bound(-j);
auto it=st.lower_bound(-j);
if(it!=st.end() && *it==-j)
if(it!=st.end() && *it==-j)
{
{
fl=1;
fl=1;
Copy
Copied
Copy
Copied
break;
}
}
st.insert(j);
st.insert(j);
}
}
if(fl==0) // all are traitor in this group
if(fl==0) // all are traitor in this group
{
{
fl2=0; // at least one group is all are traitor
fl2=0; // at least one group is all are traitor
break;
break;
}
}
st.clear();
st.clear();
}
}
printf((fl2==0)?"YES":"NO");
printf((fl2==0)?"YES":"NO");
return 0;
return 0;
}
}
Saved diffs
Original text
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; }
Changed text
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; } 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; }
Find difference