oj.uz

Submission #1084582

# Submission time Handle Problem Language Result Execution time Memory
1084582 2024-09-06T12:23:58 Z rxlfd314 Bulldozer (JOI17_bulldozer) C++17
55 / 100
 622 ms 35272 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define vt vector
#define size(x) (int((x).size()))
#define all(x) begin(x), end(x)

#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

constexpr int mxN = 2005;
int N, X[mxN], Y[mxN], W[mxN];

struct Event {
  int y, x, i, j;
  Event(int _y, int _x, int _i, int _j) : y(_y), x(_x), i(_i), j(_j) {
    if (x < 0)
      y = -y, x = -x;
  }
};

struct Node {
  ll ans, lft, rht, sum;
  Node operator+(const Node &other) {
    return {
      max({ans, other.ans, rht + other.lft}),
      max(lft, sum + other.lft),
      max(other.rht, other.sum + rht),
      sum + other.sum
    };
  }
};

struct ST {
  Node st[mxN<<1];
  void update(int i, int v) {
    st[i+=N] = {max(v, 0), max(v, 0), max(v, 0), v};
    for (i >>= 1; i > 0; i >>= 1)
      st[i] = st[i<<1] + st[i<<1|1];
  }
  Node query(int l, int r) {
    Node lft = {0, 0, 0, 0};
    Node rht = {0, 0, 0, 0};
    for (l += N, r += N+1; l < r; l >>= 1, r >>= 1) {
      if (l & 1)
        lft = lft + st[l++];
      if (r & 1)
        rht = st[--r] + rht;
    }
    return lft + rht;
  }
} st;

signed main() {
#ifndef DEBUG
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
#endif
  cin >> N;
  vt<Event> sweep;
  FOR(i, 0, N-1) {
    cin >> X[i] >> Y[i] >> W[i];
    FOR(j, 0, i-1)
      sweep.push_back(Event(Y[i] - Y[j], X[i] - X[j], j, i));
  }
  
  sort(all(sweep), [&](const Event &a, const Event &b) {
    return 1ll * a.y * b.x < 1ll * b.y * a.x;    
  });
  
  vt<int> ord(N);
  iota(all(ord), 0);
  sort(all(ord), [&](const int &a, const int &b) {
    return X[a] < X[b];    
  });
  
  vt<int> pos(N);
  FOR(ii, 0, N-1) {
    const int i = ord[ii];
    #ifdef DEBUG
    cout << i+1 << "\n "[ii+1<N];
    #endif
    pos[i] = ii;
    st.update(ii, W[i]);
  }
  
  ll ans = st.query(0, N-1).ans;
#ifdef DEBUG
  cout << ans << ':';
  sort(all(ord), [&](const int &a, const int &b) {
      return pos[a] < pos[b];    
      });
  for (int l : ord)
    cout << ' ' << l+1;
  cout << '\n';
#endif
  FOR(k, 0, size(sweep)-1) {
    auto [y, x, i, j] = sweep[k];
    st.update(pos[i], W[j]);
    st.update(pos[j], W[i]);
    swap(pos[i], pos[j]);
    if (k == size(sweep)-1 || 1ll * y * sweep[k+1].x != 1ll * sweep[k+1].y * x)
      ans = max(ans, st.query(0, N-1).ans);
#ifdef DEBUG
    cout << ans << ": (" << y << ' ' << x << ')';
    sort(all(ord), [&](const int &a, const int &b) {
        return pos[a] < pos[b];    
        });
    for (int l : ord)
      cout << ' ' << l+1;
    cout << '\n';
#endif
  }
  
  cout << ans << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Incorrect 1 ms 604 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 396 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 684 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 396 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 684 KB Output is correct
33 Correct 611 ms 33480 KB Output is correct
34 Correct 593 ms 33480 KB Output is correct
35 Correct 567 ms 33948 KB Output is correct
36 Correct 603 ms 33480 KB Output is correct
37 Correct 575 ms 35272 KB Output is correct
38 Correct 622 ms 33460 KB Output is correct
39 Correct 584 ms 33480 KB Output is correct
40 Correct 567 ms 33480 KB Output is correct
41 Correct 615 ms 33360 KB Output is correct
42 Correct 580 ms 33208 KB Output is correct
43 Correct 578 ms 33476 KB Output is correct
44 Correct 559 ms 33444 KB Output is correct
45 Correct 574 ms 35012 KB Output is correct
46 Correct 596 ms 33360 KB Output is correct
47 Correct 564 ms 33476 KB Output is correct
48 Correct 560 ms 33768 KB Output is correct
49 Correct 570 ms 33252 KB Output is correct
50 Correct 578 ms 35016 KB Output is correct
51 Correct 587 ms 33328 KB Output is correct
52 Correct 585 ms 34248 KB Output is correct
53 Correct 562 ms 33208 KB Output is correct
54 Correct 557 ms 35252 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 396 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 684 KB Output is correct
33 Correct 611 ms 33480 KB Output is correct
34 Correct 593 ms 33480 KB Output is correct
35 Correct 567 ms 33948 KB Output is correct
36 Correct 603 ms 33480 KB Output is correct
37 Correct 575 ms 35272 KB Output is correct
38 Correct 622 ms 33460 KB Output is correct
39 Correct 584 ms 33480 KB Output is correct
40 Correct 567 ms 33480 KB Output is correct
41 Correct 615 ms 33360 KB Output is correct
42 Correct 580 ms 33208 KB Output is correct
43 Correct 578 ms 33476 KB Output is correct
44 Correct 559 ms 33444 KB Output is correct
45 Correct 574 ms 35012 KB Output is correct
46 Correct 596 ms 33360 KB Output is correct
47 Correct 564 ms 33476 KB Output is correct
48 Correct 560 ms 33768 KB Output is correct
49 Correct 570 ms 33252 KB Output is correct
50 Correct 578 ms 35016 KB Output is correct
51 Correct 587 ms 33328 KB Output is correct
52 Correct 585 ms 34248 KB Output is correct
53 Correct 562 ms 33208 KB Output is correct
54 Correct 557 ms 35252 KB Output is correct
55 Correct 564 ms 33396 KB Output is correct
56 Correct 577 ms 34504 KB Output is correct
57 Correct 572 ms 33356 KB Output is correct
58 Correct 579 ms 34248 KB Output is correct
59 Correct 573 ms 33480 KB Output is correct
60 Correct 565 ms 33992 KB Output is correct
61 Correct 559 ms 33476 KB Output is correct
62 Correct 590 ms 33732 KB Output is correct
63 Correct 575 ms 33480 KB Output is correct
64 Correct 591 ms 34996 KB Output is correct
65 Incorrect 585 ms 33476 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Incorrect 1 ms 604 KB Output isn't correct
6 Halted 0 ms 0 KB -