oj.uz

Submission #673107

# Submission time Handle Problem Language Result Execution time Memory
673107 2022-12-19T18:03:32 Z peijar Bulldozer (JOI17_bulldozer) C++17
0 / 100
 49 ms 560 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

template <typename T> struct Point {
  T x, y;

  Point() : x(0), y(0) {}

  Point(T _x, T _y) : x(_x), y(_y) {}

  Point operator+(const Point other) const {
    return Point(x + other.x, y + other.y);
  }

  Point operator-(const Point other) const {
    return Point(x - other.x, y - other.y);
  }

  Point operator*(const T lambda) const {
    return Point(x * lambda, y * lambda);
  }

  Point operator/(const T lambda) const {
    return Point(x / lambda, y / lambda);
  }

  bool operator<(const Point &other) const {
    return tie(x, y) < tie(other.x, other.y);
  }
  bool operator==(const Point &other) const {
    return tie(x, y) == tie(other.x, other.y);
  }
  bool operator>(const Point &other) const { return other < *this; }
  bool operator!=(const Point &other) const { return !(*this == other); }
  bool operator<=(const Point &other) const { return !(other < *this); }
  bool operator>=(const Point &other) const { return other <= *this; }

  friend ostream &operator<<(ostream &out, const Point &a) {
    return out << a.x << " " << a.y;
  }
  friend istream &operator>>(istream &in, Point &a) { return in >> a.x >> a.y; }
  friend T dot(const Point a, const Point b) { return a.x * b.x + a.y * b.y; }

  friend T cross(const Point a, const Point b) { return a.x * b.y - a.y * b.x; }

  friend T dis2(const Point a, const Point b) { return dot(b - a, b - a); }
};

using P = Point<int>;

struct Angle {
  int x, y;

  Angle() : x(0), y(0) {}
  Angle(int _x, int _y) : x(_x), y(_y) {}

  int half() const {
    assert(x or y);
    return y < 0 or (!y and x < 0);
  }

  friend bool operator<(Angle a, Angle b) {
    return make_pair(a.half(), a.y * b.x) < make_pair(b.half(), a.x * b.y);
  }

  friend bool operator==(Angle a, Angle b) { return !(a < b) and !(b < a); }
};

const int MAXN = 1e4;

int iDeb[MAXN], iFin[MAXN];
int prefMax[MAXN], suffMax[MAXN], rangeSum[MAXN], maxSum[MAXN];

void pull(int node) {
  prefMax[node] =
      max(prefMax[2 * node], rangeSum[2 * node] + prefMax[2 * node + 1]);
  suffMax[node] =
      max(suffMax[2 * node + 1], rangeSum[2 * node + 1] + suffMax[2 * node]);
  maxSum[node] = max({maxSum[2 * node], maxSum[2 * node + 1],
                      suffMax[2 * node] + prefMax[2 * node + 1]});
  rangeSum[node] = rangeSum[2 * node] + rangeSum[2 * node + 1];
}

void build(int node, int l, int r) {
  iDeb[node] = l, iFin[node] = r;
  if (l == r)
    return;
  int m = (l + r) / 2;
  build(2 * node, l, m);
  build(2 * node + 1, m + 1, r);
}

void upd(int node, int pos, int x) {
  if (iDeb[node] > pos or iFin[node] < pos)
    return;
  if (iDeb[node] == iFin[node]) {
    rangeSum[node] = x;
    prefMax[node] = suffMax[node] = maxSum[node] = max(0LL, x);
    return;
  }

  upd(2 * node, pos, x);
  upd(2 * node + 1, pos, x);
  pull(node);
}

void printLeaves(int node) {
  if (iDeb[node] == iFin[node]) {
    cout << rangeSum[node] << ' ';
    return;
  }
  printLeaves(2 * node);
  printLeaves(2 * node + 1);
  if (node == 1)
    cout << endl;
}

signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int nbPoints;
  cin >> nbPoints;
  vector<P> points(nbPoints);
  vector<int> poids(nbPoints);
  for (int i = 0; i < nbPoints; ++i)
    cin >> points[i] >> poids[i];
  vector<Angle> angles;
  for (int i = 0; i < nbPoints; ++i)
    for (int j = i + 1; j < nbPoints; ++j) {
      P diff = points[j] - points[i];
      if (diff.x < 0 or (diff.x == 0 and diff.y < 0))
        diff = diff * (-1);
      angles.emplace_back(diff.x, diff.y);
      assert(diff.x or diff.y);
    }
  sort(angles.begin(), angles.end());
  angles.resize(unique(angles.begin(), angles.end()) - angles.begin());

  vector<int> ordreInit(nbPoints);
  iota(ordreInit.begin(), ordreInit.end(), 0LL);
  build(1, 0, nbPoints - 1);

  auto getComparator = [&](P dir) {
    return [&points, dir](int i, int j) {
      if (cross(dir, points[i]) != cross(dir, points[j]))
        return cross(dir, points[i]) < cross(dir, points[j]);
      if (cross(dir, points[i]) > 0)
        return dot(dir, points[i]) > dot(dir, points[j]);
      return dot(dir, points[i]) < dot(dir, points[j]);
    };
  };

  int ret = 0;

  for (Angle a : angles) {
    P dir(a.x, a.y);
    sort(ordreInit.begin(), ordreInit.end(), getComparator(dir));
    for (int i = 0; i < nbPoints; ++i)
      upd(1, i, poids[ordreInit[i]]);
    ret = max(ret, maxSum[1]);
  }
  cout << ret << endl;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 548 KB Output is correct
2 Correct 44 ms 560 KB Output is correct
3 Correct 49 ms 544 KB Output is correct
4 Correct 40 ms 468 KB Output is correct
5 Correct 42 ms 468 KB Output is correct
6 Correct 39 ms 544 KB Output is correct
7 Correct 39 ms 468 KB Output is correct
8 Correct 44 ms 552 KB Output is correct
9 Correct 46 ms 468 KB Output is correct
10 Correct 40 ms 468 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 548 KB Output is correct
2 Correct 44 ms 560 KB Output is correct
3 Correct 49 ms 544 KB Output is correct
4 Correct 40 ms 468 KB Output is correct
5 Correct 42 ms 468 KB Output is correct
6 Correct 39 ms 544 KB Output is correct
7 Correct 39 ms 468 KB Output is correct
8 Correct 44 ms 552 KB Output is correct
9 Correct 46 ms 468 KB Output is correct
10 Correct 40 ms 468 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 548 KB Output is correct
2 Correct 44 ms 560 KB Output is correct
3 Correct 49 ms 544 KB Output is correct
4 Correct 40 ms 468 KB Output is correct
5 Correct 42 ms 468 KB Output is correct
6 Correct 39 ms 544 KB Output is correct
7 Correct 39 ms 468 KB Output is correct
8 Correct 44 ms 552 KB Output is correct
9 Correct 46 ms 468 KB Output is correct
10 Correct 40 ms 468 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -