Submission #1198994

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<algorithm>
typedef long long int ll;
using namespace std;
#define EVEL 1
#ifndef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X;}
#define TF(f) {f;}
#define END {}
#endif

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,a) for (int i=1;i<=(a);i++)
const ll MOD = (10*10*10*10*10*10*10*10*10+7);

    int A,B,C;
    int N,M,K,X,Y,W,H;
    int ans;
    //string S;
    bool S[101][101];
    int temp[100]={0};
    bool f=true;
    bool fir=true;

int main(){
    cin>>W>>H>>N;

    REP(i,H){
        REP(j,W){
            S[i][j]=true;
        }
    }
    REP(i,N){
        cin>>X>>Y>>A;
        if(A==1){
            //x<xi
            REP(j,H){
                REP(k,X){
                    S[j][k]=false;
                }
            }
        }
        else if(A==2){
            REP(j,H){
                FOR(k,X,W){
                    S[j][k]=false;
                }
            }
        }
        else if(A==3){
            REP(j,W){
                REP(k,Y){
                    S[k][j]=false;
                }
            }
        }
        else if(A==4){
            REP(j,W){
                FOR(k,Y,H){
                    S[k][j]=false;
                }
            }
        }
        REP(i,H){REP(j,W){
            DEB(S[i][j])
        }END}
        END
    }
    REP(i,H)
        REP(j,W){
            S[i][j]?ans++:ans=ans;
        }
    cout<<ans;
}
/*A.size()!=0&&B.size()!=0&&C.size()!=0*/

Submission Info

Judge Result