fork download
  1. #include<bits/stdc++.h>
  2.  
  3. #define MOD 1000000007
  4. #define MAX 10000005
  5. #define ll long long
  6. #define slld(t) scanf("%lld",&t)
  7. #define sd(t) scanf("%d",&t)
  8. #define pd(t) printf("%d\n",t)
  9. #define plld(t) printf("%lld\n",t)
  10. #define pcc pair<char,char>
  11. #define pii pair<int,int>
  12. #define pll pair<ll,ll>
  13. #define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
  14. #define mp(a,b) make_pair(a,b)
  15. #define F first
  16. #define S second
  17. #define pb(x) push_back(x)
  18. #define vi vector<int>
  19.  
  20. using namespace std;
  21.  
  22. int score[501][501],inc[501][501];
  23.  
  24. void solve(int i,int m){
  25. inc[i][0]=0;
  26. for(int j=1;j<=m;j++){
  27. inc[i][j]=100-score[i][j]-inc[i][j-1];
  28. }
  29. }
  30.  
  31. int main(){
  32.  
  33. int t;
  34. sd(t);
  35. while(t--){
  36. int n,m;
  37. sd(n);sd(m);
  38.  
  39. for(int i=1;i<=n;i++){
  40. for(int j=1;j<=m;j++){
  41. sd(score[i][j]);
  42. }
  43. solve(i,m);
  44. }
  45.  
  46. for(int i=2;i<=n;i++){
  47. inc[i][m]=inc[i][m]-inc[i-1][m];
  48. }
  49.  
  50. if(!inc[n][m]) cout<<"YES\n";
  51. else cout<<"NO\n";
  52. }
  53. }
Success #stdin #stdout 0s 5376KB
stdin
2
3 3
90 90 90
90 90 90
90 90 100
2 2
60 50
70 90
stdout
YES
NO