1786B - Cake Assembly Line - CodeForces Solution


brute force sortings

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
 int test;
 cin >> test;
 while (test--) {
  int n, w, h;
  cin >> n >> w >> h;
  int a[n + 5];
  int b[n + 5];
  for (int i = 1; i <= n; i++) {
   cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
   cin >> b[i];
  }
  int l[n + 5];
  int r[n + 5];
  for (int i = 1; i <= n; i++) {
   l[i] = b[i] + h - (a[i] + w);
   r[i] = b[i] - h - (a[i] - w);
  }
  sort(l + 1, l + n + 1);
  sort(r + 1, r + n + 1);
  if (l[n] <= r[1])
   cout << "YES" << endl;
  else
   cout << "NO" << endl;
 }
}


Comments

Submit
0 Comments
More Questions

1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards
897A - Scarborough Fair
1433B - Yet Another Bookshelf
1283B - Candies Division
1451B - Non-Substring Subsequence