Submission #70991682

---

Source Code Expand

// **** I/O & small utilities ****
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <iterator> // iterator helpers: back_inserter, istream/ostream_iterator, next/prev, distance
#include <numeric>
#include <utility> // pair, move, forward, swap, tie, make_pair - lightweight helpers

// **** Core algorithms & numeric helpers ****
#include <algorithm> // sort, stable_sort, nth_element, partial_sort, binary_search, next_permutation, min/max, accumulate
#include <bitset> // fixed-size bitmasks, fast bit ops, count(), useful for mask DP & boolean arrays

// **** Sequence containers ****
#include <array> // std::array: fixed-size array with container interface (stack-allocated)
#include <deque> // double-ended queue: O(1) push/pop front/back, sliding-window, 0-1 BFS
#include <forward_list> // singly-linked list: low-overhead single-linked ops, O(1) insert_after/erase_after
#include <list> // doubly-linked list: splice, O(1) insert/erase with iterators, stable node-based ops
#include <vector> // dynamic array: push_back, reserve, random access - most used container

// **** Container adapters & heaps ****
#include <queue> // queue (FIFO), priority_queue (max/min heap) - BFS, Dijkstra, k-largest, sliding window heaps
#include <stack> // stack adapter (LIFO) - simple DFS, expression parsing

// **** Associative containers ****
#include <map> // ordered map/multimap (RB-tree): log(N) insert/find, ordered traversal, lower_bound, higher_bound
#include <set> // ordered set/multiset: log(N) membership, ordered operations and range queries, lower_bound, higher_bound
#include <unordered_map> // hash map: average O(1) lookup/insert - freq counters, memoization
#include <unordered_set> // hash set: average O(1) membership - deduplication, visited sets

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;

using namespace std;

// generic alias - lexicographic min-heap by pair<T1,T2>
template <typename T1, typename T2, typename Compare = greater<pair<T1, T2>>>
using min_heap_pair = priority_queue<pair<T1, T2>, vector<pair<T1, T2>>, Compare>;

// // comparator template - min-heap comparing only by .first
// template <typename T1, typename T2> struct CompareFirst {
//   bool operator()(const pair<T1, T2> &a, const pair<T1, T2> &b) const {
//     return a.first < b.first; // smaller first => higher priority (min-heap)
//   }
// };

// // optional factory function to deduce types
// template <typename T1, typename T2, typename Compare = greater<pair<T1, T2>>>
// auto make_min_heap() {
//   return min_heap_pair<T1, T2, Compare>{};
// }

// struct MyType {
//   u64 data;
//   ...
//   bool operator<(const MyType &other) const { return this->data < other.data; }
// };

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(nullptr);

  i64 N, X, Y;
  cin >> N >> X >> Y;

  vector<i64> A(N);
  for (auto &e : A) {
    cin >> e;
  }

  vector<i64> XANS(N, 0);
  vector<i64> YANS(N, 0);
  vector<i64> weights(N);

  sort(A.begin(), A.end());

  i64 wmin = A[0] * X;
  i64 wmax = A[0] * Y;

  for (i64 i = 0; i < A.size(); i++) {
    auto a_wmin = A[i] * X;
    auto a_wmax = A[i] * Y;

    if (!(a_wmin >= wmin && a_wmin <= wmax)) {
      cout << -1 << '\n';
      return 0;
    }

    weights[i] = a_wmax;
    YANS[i] = A[i];
    XANS[i] = 0;
  }

  auto d = Y - X;

  for (i64 i = 1; i < weights.size(); i++) {
    auto D = abs(weights[0] - weights[i]);

    if (D % d == 0) {
      XANS[i] += D / d;
      YANS[i] -= D / d;
      weights[i] -= D;

      if (i == weights.size() - 1) {
        cout << accumulate(YANS.begin(), YANS.end(), 0ll) << '\n';
        return 0;
      }
    } else {
      break;
    }
  }

  cout << -1 << '\n';

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function 'int main()':
./Main.cpp:87:21: warning: comparison of integer expressions of different signedness: 'i64' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |   for (i64 i = 0; i < A.size(); i++) {
      |                   ~~^~~~~~~~~~
./Main.cpp:103:21: warning: comparison of integer expressions of different signedness: 'i64' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |   for (i64 i = 1; i < weights.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~
./Main.cpp:111:13: warning: comparison of integer expressions of different signedness: 'i64' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |       if (i == weights.size() - 1) {
      |           ~~^~~~~~~~~~~~~~~~~~~~~

Judge Result