oj.uz

Submission #498501

# Submission time Handle Problem Language Result Execution time Memory
498501 2021-12-25T10:53:25 Z 600Mihnea Bulldozer (JOI17_bulldozer) C++17
5 / 100
 4 ms 1252 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Point {
  ll x;
  ll y;
  ll value;
};

struct R {
  int sgn;
  ll up;
  ll down;
  int i;
  int j;
};

R get(ll x, ll y) {
  R sol;
  ll g = __gcd(x, y);
  x /= g;
  y /= g;

  sol.sgn = +1;
  if (x < 0 && y < 0) {
    x *= -1;
    y *= -1;
  }
  if (x < 0 || y < 0) {
    sol.sgn = -1;
  }
  sol.up = abs(x);
  sol.down = abs(y);
  return sol;
}

bool operator < (R a, R b) {
  if (a.sgn != b.sgn) {
    return a.sgn < b.sgn;
  }
  if (a.sgn == -1) {
    swap(a, b);
  }
  return a.up * b.down < b.up * a.down;
}

bool initialCmp(Point a, Point b) {
  if (a.y == b.y) {
    return a.x < b.x;
  }
  return a.y < b.y;
}

const int N = 2000 + 7;
int n;
R panta[N][N];
Point points[N];
ll value[N];

void sneakyHack() {
  for (int i = 1; i <= n; i++) {
    swap(points[i].x, points[i].y);
  }
}

int ord[N];
int inv[N];

struct Node {
  ll sol;
  ll sum;
  ll pref;
  ll suf;
};

Node operator + (Node a, Node b) {
  ll sol = max(max(a.sol, b.sol), a.suf + b.pref);
  ll sum = a.sum + b.sum;
  ll pref = max(a.pref, a.sum + b.pref);
  ll suf = max(b.suf, b.sum + a.suf);
  return {sol, sum, pref, suf};
}

Node tree[4 * N];

void build(int v, int tl, int tr) {
  if (tl == tr) {
    tree[v] = {max(value[tl], 0LL), value[tl], max(value[tl], 0LL), max(value[tl], 0LL)};
  } else {
    int tm = (tl + tr) / 2;
    build(2 * v, tl, tm);
    build(2 * v + 1, tm + 1, tr);
    tree[v] = tree[2 * v] + tree[2 * v + 1];
  }
}

void upd(int v, int tl, int tr, int i) {
  if (tr < i || i < tl) {
    return;
  }
  if (tl == tr) {
    tree[v] = {max(value[tl], 0LL), value[tl], max(value[tl], 0LL), max(value[tl], 0LL)};
  } else {
    int tm = (tl + tr) / 2;
    upd(2 * v, tl, tm, i);
    upd(2 * v + 1, tm + 1, tr, i);
    tree[v] = tree[2 * v] + tree[2 * v + 1];
  }
}

int main() {
  bool isHome;

  isHome = true;
  isHome = false;

  if (isHome) {
    freopen ("input", "r", stdin);
  } else {
    ios::sync_with_stdio(0); cin.tie(0);
  }

  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> points[i].x >> points[i].y >> points[i].value;
  }

  ll best = 0;

  for (int iteration = 1; iteration <= 2; iteration++) {
    sneakyHack();
    sort(points + 1, points + n + 1, initialCmp);

    for (int i = 1; i <= n; i++) {
      ord[i] = i;
      inv[i] = i;
      for (int j = i + 1; j <= n; j++) {
        panta[i][j] = get(points[i].x - points[j].x, points[i].y - points[j].y);
        panta[i][j].i = i;
        panta[i][j].j = j;
      }
      value[i] = points[i].value;
    }
    vector<R> all;
    for (int i = 1; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        all.push_back(panta[i][j]);
      }
    }
    build(1, 1, n);

    stable_sort(all.begin(), all.end());
    best = max(best, tree[1].sol);

    /// all[it] < all[it + 1]
    int l = 0;
    while (l < (int) all.size()) {
      int r = l;
      while (r + 1 < (int) all.size() && !(all[r] < all[r + 1])) {
        r++;
      }

      for (int it = l; it <= r; it++) {
        int i = all[it].i;
        int j = all[it].j;
        int pos_i = inv[i];
        int pos_j = inv[j];

        swap(ord[pos_i], ord[pos_j]);
        inv[ord[pos_i]] = pos_i;
        inv[ord[pos_j]] = pos_j;

        swap(value[pos_i], value[pos_j]);
      }

      best = max(best, tree[1].sol);

      l = r + 1;
    }



  }

  cout << best << "\n";




  return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:121:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |     freopen ("input", "r", stdin);
      |     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1252 KB Output is correct
2 Correct 2 ms 1252 KB Output is correct
3 Correct 1 ms 1240 KB Output is correct
4 Correct 2 ms 1252 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Correct 2 ms 1252 KB Output is correct
7 Correct 2 ms 1252 KB Output is correct
8 Correct 2 ms 1252 KB Output is correct
9 Correct 2 ms 1248 KB Output is correct
10 Correct 2 ms 1244 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1240 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1252 KB Output is correct
2 Correct 2 ms 1252 KB Output is correct
3 Correct 1 ms 1240 KB Output is correct
4 Correct 2 ms 1252 KB Output is correct
5 Correct 2 ms 1236 KB Output is correct
6 Correct 2 ms 1252 KB Output is correct
7 Correct 2 ms 1252 KB Output is correct
8 Correct 2 ms 1252 KB Output is correct
9 Correct 2 ms 1248 KB Output is correct
10 Correct 2 ms 1244 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Incorrect 4 ms 1240 KB Output isn't correct
17 Halted 0 ms 0 KB -