设为首页 加入收藏

TOP

Codeforces 15B Laser
2015-07-24 05:50:32 来源: 作者: 【 】 浏览:4
Tags:Codeforces 15B Laser

题目链接:点击打开链接


#include
  
   
#include
   
     #include
    
      #include
     
       #include
      
        #include
        #include
        
          #include
         
           #include
          
            #include
           
             #include
            
              using namespace std; #define N 5005 #define ll __int64 inline ll Abs(ll x){return x>0?x:-x;} int main(){ ll i, j, T;cin>>T; while(T--){ ll x1,y1,x2,y2,n,m; scanf("%I64d %I64d %I64d %I64d %I64d %I64d",&n,&m,&x1,&y1,&x2,&y2); ll minn = min(x1,x2), maxx = max(x1,x2); x1 = minn, x2 = maxx; x2 -= x1-1; x1 = 1; minn = min(y1,y2), maxx = max(y1,y2); y1 = minn, y2 = maxx; y2 -= y1-1; y1 = 1; if(x1==x2 || y1==y2) { if(y1==y2) { swap(n,m); swap(x1,y1); swap(x2,y2); } ll cha1 = y2-y1-1, cha2 = m - y2; cha1 -= cha2; cha1 = max(cha1, 0ll); printf("%I64d\n",n*cha1); } else { ll x3 = x1+(n-x2), y3 = y1+(m-y2);; if(x3>=(x2-1) && y3>=(y2-1)) printf("%I64d\n", (x2-x1)*(y2-y1)*2); else printf("%I64d\n",n*m-(x3-x1+1)*(y3-y1+1)*2); } } return 0; } 
            
           
          
         
        
      
     
    
   
  


】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇HDU 3360 National Treasures 奇.. 下一篇Longest Consecutive Sequence

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: