Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define nl "\n"
- #define fi first
- #define se second
- #define pb push_back
- #define ll long long
- #define ull unsigned ll
- #define RV return void
- #define inf 2000000000
- #define MOD ((ll) 1e9 + 7)
- #define sz(x) int(x.size())
- #define all(v) v.begin(), v.end()
- #define rall(v) v.rbegin(), v.rend()
- #define Mini(x) *min_element(all(x))
- #define Maxi(x) *max_element(all(x))
- #define fixed(n) fixed << setprecision(n)
- #define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
- #define cin(v) for (auto&i:v) cin >> i;
- #define cout(v) for (auto&i:v) cout << i << " ";
- #define clr(memo, x) memset(memo, x, sizeof memo)
- #define updmin(a, b) a = min(a, b)
- #define updmax(a, b) a = max(a, b)
- #define vi vector < int >
- #define vl vector < ll >
- #define vc vector < char >
- #define vs vector < string >
- #define v2i vector < vector < int > >
- #define v2l vector < vector < int > >
- #define seti set < int >
- #define setl set < ll >
- #define mapii map < int , int >
- #define mapll map < ll , ll >
- #define mapli map < ll , int >
- #define mapci map < char , int >
- #define mapsi map < string , int >
- #define pll pair < ll , ll >
- #define pii pair < int , int >
- #define range(l,r,x) for(int i=l ; i < r ; i+=x)
- #define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
- vector < string > ternary= {"NO\n" , "YES\n"};
- void Zainab(){
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- #endif
- }
- /*================================ Prblem solution ================================ */
- int dx[] ={ -1 , -1 , -1 , 1 , 1 , 1 , 0 , 0 };
- int dy[] ={0 , 1 , -1 , 0 , -1 , 1 , -1 , 1};
- void myCode(){
- int n , q;
- cin >> n >> q;
- map < int , vector < pair < int , int > > > mp;
- vector < vector < bool > > vis(n+1 , vector < bool > (n+1 , 0));
- while(q--){
- int l ,r , x;
- cin >> l >> r >> x;
- if(x){
- vis[l][r]=1;
- mp[x].pb({l,r});
- }
- else vis[l][r]=0;
- int cnt =0;
- for(auto& [f,s] : mp){
- for(auto& w : s) {
- if(vis[w.fi][w.se]){
- cnt++;
- break;
- }
- }
- }
- if(cnt > 2 ) {
- cout << "NO\n";
- continue;
- }
- bool enter=0;
- for(auto& [f,s] : mp){
- if(!sz(s)) continue;
- int l2 = s[0].fi , r2=s[0].se ;
- for(auto& w : s){
- if( vis[w.fi][w.se] and (abs(w.fi-l2) + abs(w.se - r2))%2){
- enter = 1;
- cout << "NO\n";
- break;
- }
- } if(enter) break;
- }
- if(enter) continue;
- cout << "YES\n";
- }
- }
- int main(){
- FastCode ;
- Zainab() ;
- int testCase=1;
- // cin >> testCase ;
- for(int i=1 ; i<= testCase ; i++)
- myCode();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement