fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30.  
  31. void solve() {
  32.  
  33. int w, h;
  34. cin>> w >> h;
  35.  
  36. int ans = 0;
  37. int mn = INF;
  38. int mx = -INF;
  39.  
  40. int x1;
  41. cin >> x1;
  42.  
  43. for(int i=1; i<=x1; i++){
  44. int x;
  45. cin >> x;
  46. mn = min(mn, x);
  47. mx = max(mx, x);
  48. }
  49. ans = max(ans, (mx-mn)*h);
  50.  
  51. int x2;
  52. cin >> x2;
  53. mn = INF;
  54. mx = -INF;
  55. for(int i=1; i<=x2; i++){
  56. int x;
  57. cin >> x;
  58. mn = min(mn, x);
  59. mx = max(mx, x);
  60. }
  61. ans = max(ans, (mx-mn)*h);
  62.  
  63.  
  64. int y1;
  65. cin >> y1;
  66. mn = INF;
  67. mx = -INF;
  68. for(int i=1; i<=y1; i++){
  69. int y;
  70. cin >> y;
  71. mn = min(mn, y);
  72. mx = max(mx, y);
  73. }
  74. ans = max(ans, (mx-mn)*w);
  75.  
  76. int y2;
  77. cin >> y2;
  78. mn = INF;
  79. mx = -INF;
  80. for(int i=1; i<=y2; i++){
  81. int y;
  82. cin >> y;
  83. mn = min(mn, y);
  84. mx = max(mx, y);
  85. }
  86. ans = max(ans, (mx-mn)*w);
  87.  
  88. cout << ans << endl;
  89.  
  90. }
  91.  
  92.  
  93.  
  94.  
  95.  
  96. int32_t main() {
  97. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  98.  
  99. int t = 1;
  100. cin >> t;
  101. while (t--) {
  102. solve();
  103. }
  104.  
  105. return 0;
  106. }
Success #stdin #stdout 0.01s 5320KB
stdin
3
5 8
2 1 2
3 2 3 4
3 1 4 6
2 4 5
10 7
2 3 9
2 1 7
3 1 3 4
3 4 5 6
11 5
3 1 6 8
3 3 6 8
3 1 3 4
2 2 4
stdout
25
42
35