1555B - Two Tables

Dear 丶 2022-09-03 00:15 82阅读 0赞

写了半天，发现两行代码搞定！

MAX\_INT 可以直接用

#include <iostream>
    #include <cmath>
    #define ll long long
    
    using namespace std;
    
    int main()
    { 
    	int Case;
    	cin >> Case;
    	while(Case--)
    	{ 
    		double W, H, x1, y1, x2, y2, w, h;
    		cin >> W >> H >> x1 >> y1 >> x2 >> y2 >> w >> h;
    		double ans = -1.0;
    		// 1
    		if(y1 >= h) ans = 0;
    		else{ 
    			
    			double tmp = h - y1;
    			if(H - y2 >= tmp) ans = tmp;
    		}
    		// 2
    		if(H-y2 >= h) ans = 0;
    		else{ 
    			double tmp = y2 - (H-h);
    			if(y1 >= tmp) 
    			{ 
    				if(ans == -1.0) ans = tmp;
    				else ans = min(ans, tmp);   
    			}
    		}
    		// 3
    		if(x1 >= w) ans = 0;
    		else
    		{ 
    			double tmp = w - x1;
    			if(W - x2 >= tmp)
    			{ 
    				if(ans == -1.0) ans = tmp;
    				else ans = min(ans, tmp);
    			}
    		}
    		// 4
    		if(W-x2 >= w) ans = 0;
    		else{ 
    			double tmp = x2 - (W-w);
    			if(x1 >= tmp)
    			{ 
    				if(ans == -1.0) ans = tmp;
    				else ans = min(ans, tmp);
    			}
    		}
    		printf("%.9lf\n",ans);
    	}
    }

#include <iostream>
    #include <cmath>
    #define ll long long
    
    using namespace std;
    
    int main()
    { 
    	int Case;
    	cin >> Case;
    	while(Case--)
    	{ 
    		int W, H, x1, y1, x2, y2, w, h;
    		cin >> W >> H >> x1 >> y1 >> x2 >> y2 >> w >> h;
    		int ans = INT_MAX;
    		if(W-(x2-x1)>=w) ans = min(ans,max(0,min(w-x1, x2+w-W))); 
    		if(H-(y2-y1)>=h) ans = min(ans,max(0,min(h-y1, y2+h-H)));
    		if(ans == INT_MAX) puts("-1");
    		else cout << ans << endl;
    	}
    }