oj.uz

Submission #37691

# Submission time Handle Problem Language Result Execution time Memory
37691 2017-12-27T02:16:36 Z funcsr Bulldozer (JOI17_bulldozer) C++14
60 / 100
 1071 ms 80648 KB 
#pragma GCC optimize ("O3")
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
typedef pair<P, int> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
struct Node {
  long long s, l, r, m;
  Node(long long s, long long l, long long r, long long m) : s(s), l(l), r(r), m(m) {}
  Node(long long w) : Node(w, max(w, 0LL), max(w, 0LL), max(w, 0LL)) {}
  Node() : Node(0) {}
};
Node op(const Node &a, const Node &b) {
  return Node(
    a.s + b.s,
    max(a.l, a.s + b.l),
    max(b.r, b.s + a.r),
    max(max(a.m, b.m), a.r + b.l)
  );
}

#define MAX_N (1<<11)
Node seg[MAX_N*2-1];
void update(int k, Node x) {
  k += MAX_N-1;
  seg[k] = x;
  while (k > 0) {
    k = (k-1)/2;
    seg[k] = op(seg[k*2+1], seg[k*2+2]);
  }
}

int N;
int X[2000], Y[2000], W[2000];

struct Rel {
  int p, q;
  Rel(int p, int q) : p(p), q(q) {
    if (q < 0) p = -p, q = -q;
  }
  bool operator<(const Rel& b) const {
    return 1LL*p*b.q < 1LL*b.p*q;
  }
  bool operator==(const Rel& b) const {
    return 1LL*p*b.q == 1LL*b.p*q;
  }
};
int pos[2000];
vector<P> G[2000000];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N;
  vector<P2> ps;
  rep(i, N) {
    int x, y, w;
    cin >> x >> y >> w;
    ps.pb(P2(P(x, -y), w));
  }
  sort(all(ps));
  rep(i, N) X[i] = ps[i]._1._1, Y[i] = -ps[i]._1._2, W[i] = ps[i]._2, pos[i] = i, update(i, Node(W[i]));
  vector<pair<Rel, P>> lines;
  rep(i, N) rep(j, i) {
    Rel r = Rel(-1, 0);
    if (X[i] != X[j]) r = Rel(Y[i]-Y[j], X[i]-X[j]);
    lines.pb(make_pair(r, P(i, j)));
  }
  sort(all(lines));
  long long m = seg[0].m;
  vector<long long> bs;
  vector<int> ln;
  rep(e, lines.size()) {
    const Rel &a = lines[e]._1;
    P p = lines[e]._2;
    bs.pb(1LL*Y[p._1]*a.q-1LL*X[p._1]*a.p);
    ln.pb(p._1);
    ln.pb(p._2);

    if (e+1 >= lines.size() || !(a == lines[e+1]._1)) {
      sort(all(bs)); uniq(bs);
      rep(i, bs.size()) G[i].clear();
      for (int p : ln) {
        int k = index(bs, 1LL*Y[p]*a.q-1LL*X[p]*a.p);
        G[k].pb(P(pos[p], p));
      }
      rep(i, bs.size()) {
        vector<P> &ps = G[i];
        sort(all(ps)); uniq(ps);
        rep(i, ps.size()/2) {
          int a = ps[i]._2, b = ps[(int)ps.size()-1-i]._2;
          swap(pos[a], pos[b]);
          update(pos[a], Node(W[a]));
          update(pos[b], Node(W[b]));
        }
      }
      bs.clear();
      ln.clear();
      m = max(m, seg[0].m);
    }
  }
  cout << m << "\n";
  return 0;
}

Compilation message

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:19:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
bulldozer.cpp:93:3: note: in expansion of macro 'rep'
   rep(e, lines.size()) {
   ^~~
bulldozer.cpp:100:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (e+1 >= lines.size() || !(a == lines[e+1]._1)) {
         ~~~~^~~~~~~~~~~~~~~
bulldozer.cpp:19:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
bulldozer.cpp:102:7: note: in expansion of macro 'rep'
       rep(i, bs.size()) G[i].clear();
       ^~~
bulldozer.cpp:19:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
bulldozer.cpp:107:7: note: in expansion of macro 'rep'
       rep(i, bs.size()) {
       ^~~
bulldozer.cpp:19:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
bulldozer.cpp:110:9: note: in expansion of macro 'rep'
         rep(i, ps.size()/2) {
         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47812 KB Output is correct
2 Correct 45 ms 47824 KB Output is correct
3 Correct 45 ms 47852 KB Output is correct
4 Correct 47 ms 47864 KB Output is correct
5 Correct 47 ms 47772 KB Output is correct
6 Correct 47 ms 47824 KB Output is correct
7 Correct 45 ms 47864 KB Output is correct
8 Correct 44 ms 47816 KB Output is correct
9 Correct 48 ms 47864 KB Output is correct
10 Correct 44 ms 47864 KB Output is correct
11 Correct 46 ms 47376 KB Output is correct
12 Correct 44 ms 47380 KB Output is correct
13 Correct 49 ms 47472 KB Output is correct
14 Correct 45 ms 47404 KB Output is correct
15 Correct 44 ms 47480 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47596 KB Output is correct
2 Correct 48 ms 47632 KB Output is correct
3 Correct 49 ms 47612 KB Output is correct
4 Correct 50 ms 47608 KB Output is correct
5 Correct 46 ms 47608 KB Output is correct
6 Correct 50 ms 47676 KB Output is correct
7 Correct 48 ms 47576 KB Output is correct
8 Correct 48 ms 47608 KB Output is correct
9 Correct 49 ms 47736 KB Output is correct
10 Correct 46 ms 47736 KB Output is correct
11 Correct 45 ms 47480 KB Output is correct
12 Correct 47 ms 47480 KB Output is correct
13 Correct 48 ms 47484 KB Output is correct
14 Correct 49 ms 47480 KB Output is correct
15 Correct 48 ms 47452 KB Output is correct
16 Correct 45 ms 47452 KB Output is correct
17 Correct 49 ms 47480 KB Output is correct
18 Correct 45 ms 47480 KB Output is correct
19 Correct 43 ms 47480 KB Output is correct
20 Correct 43 ms 47480 KB Output is correct
21 Correct 46 ms 47608 KB Output is correct
22 Correct 45 ms 47608 KB Output is correct
23 Correct 46 ms 47676 KB Output is correct
24 Correct 47 ms 47640 KB Output is correct
25 Correct 47 ms 47608 KB Output is correct
26 Correct 45 ms 47608 KB Output is correct
27 Correct 47 ms 47608 KB Output is correct
28 Correct 48 ms 47652 KB Output is correct
29 Correct 46 ms 47616 KB Output is correct
30 Correct 45 ms 47608 KB Output is correct
31 Correct 46 ms 47596 KB Output is correct
32 Correct 46 ms 47608 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47596 KB Output is correct
2 Correct 48 ms 47632 KB Output is correct
3 Correct 49 ms 47612 KB Output is correct
4 Correct 50 ms 47608 KB Output is correct
5 Correct 46 ms 47608 KB Output is correct
6 Correct 50 ms 47676 KB Output is correct
7 Correct 48 ms 47576 KB Output is correct
8 Correct 48 ms 47608 KB Output is correct
9 Correct 49 ms 47736 KB Output is correct
10 Correct 46 ms 47736 KB Output is correct
11 Correct 45 ms 47480 KB Output is correct
12 Correct 47 ms 47480 KB Output is correct
13 Correct 48 ms 47484 KB Output is correct
14 Correct 49 ms 47480 KB Output is correct
15 Correct 48 ms 47452 KB Output is correct
16 Correct 45 ms 47452 KB Output is correct
17 Correct 49 ms 47480 KB Output is correct
18 Correct 45 ms 47480 KB Output is correct
19 Correct 43 ms 47480 KB Output is correct
20 Correct 43 ms 47480 KB Output is correct
21 Correct 46 ms 47608 KB Output is correct
22 Correct 45 ms 47608 KB Output is correct
23 Correct 46 ms 47676 KB Output is correct
24 Correct 47 ms 47640 KB Output is correct
25 Correct 47 ms 47608 KB Output is correct
26 Correct 45 ms 47608 KB Output is correct
27 Correct 47 ms 47608 KB Output is correct
28 Correct 48 ms 47652 KB Output is correct
29 Correct 46 ms 47616 KB Output is correct
30 Correct 45 ms 47608 KB Output is correct
31 Correct 46 ms 47596 KB Output is correct
32 Correct 46 ms 47608 KB Output is correct
33 Correct 940 ms 80488 KB Output is correct
34 Correct 943 ms 80464 KB Output is correct
35 Correct 961 ms 80464 KB Output is correct
36 Correct 999 ms 80464 KB Output is correct
37 Correct 953 ms 80492 KB Output is correct
38 Correct 900 ms 80460 KB Output is correct
39 Correct 916 ms 80528 KB Output is correct
40 Correct 913 ms 80452 KB Output is correct
41 Correct 915 ms 80480 KB Output is correct
42 Correct 911 ms 80480 KB Output is correct
43 Correct 918 ms 80480 KB Output is correct
44 Correct 895 ms 80488 KB Output is correct
45 Correct 923 ms 80484 KB Output is correct
46 Correct 936 ms 80480 KB Output is correct
47 Correct 921 ms 80452 KB Output is correct
48 Correct 906 ms 80476 KB Output is correct
49 Correct 917 ms 80480 KB Output is correct
50 Correct 1071 ms 80492 KB Output is correct
51 Correct 959 ms 80500 KB Output is correct
52 Correct 948 ms 80464 KB Output is correct
53 Correct 943 ms 80608 KB Output is correct
54 Correct 936 ms 80520 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 47596 KB Output is correct
2 Correct 48 ms 47632 KB Output is correct
3 Correct 49 ms 47612 KB Output is correct
4 Correct 50 ms 47608 KB Output is correct
5 Correct 46 ms 47608 KB Output is correct
6 Correct 50 ms 47676 KB Output is correct
7 Correct 48 ms 47576 KB Output is correct
8 Correct 48 ms 47608 KB Output is correct
9 Correct 49 ms 47736 KB Output is correct
10 Correct 46 ms 47736 KB Output is correct
11 Correct 45 ms 47480 KB Output is correct
12 Correct 47 ms 47480 KB Output is correct
13 Correct 48 ms 47484 KB Output is correct
14 Correct 49 ms 47480 KB Output is correct
15 Correct 48 ms 47452 KB Output is correct
16 Correct 45 ms 47452 KB Output is correct
17 Correct 49 ms 47480 KB Output is correct
18 Correct 45 ms 47480 KB Output is correct
19 Correct 43 ms 47480 KB Output is correct
20 Correct 43 ms 47480 KB Output is correct
21 Correct 46 ms 47608 KB Output is correct
22 Correct 45 ms 47608 KB Output is correct
23 Correct 46 ms 47676 KB Output is correct
24 Correct 47 ms 47640 KB Output is correct
25 Correct 47 ms 47608 KB Output is correct
26 Correct 45 ms 47608 KB Output is correct
27 Correct 47 ms 47608 KB Output is correct
28 Correct 48 ms 47652 KB Output is correct
29 Correct 46 ms 47616 KB Output is correct
30 Correct 45 ms 47608 KB Output is correct
31 Correct 46 ms 47596 KB Output is correct
32 Correct 46 ms 47608 KB Output is correct
33 Correct 940 ms 80488 KB Output is correct
34 Correct 943 ms 80464 KB Output is correct
35 Correct 961 ms 80464 KB Output is correct
36 Correct 999 ms 80464 KB Output is correct
37 Correct 953 ms 80492 KB Output is correct
38 Correct 900 ms 80460 KB Output is correct
39 Correct 916 ms 80528 KB Output is correct
40 Correct 913 ms 80452 KB Output is correct
41 Correct 915 ms 80480 KB Output is correct
42 Correct 911 ms 80480 KB Output is correct
43 Correct 918 ms 80480 KB Output is correct
44 Correct 895 ms 80488 KB Output is correct
45 Correct 923 ms 80484 KB Output is correct
46 Correct 936 ms 80480 KB Output is correct
47 Correct 921 ms 80452 KB Output is correct
48 Correct 906 ms 80476 KB Output is correct
49 Correct 917 ms 80480 KB Output is correct
50 Correct 1071 ms 80492 KB Output is correct
51 Correct 959 ms 80500 KB Output is correct
52 Correct 948 ms 80464 KB Output is correct
53 Correct 943 ms 80608 KB Output is correct
54 Correct 936 ms 80520 KB Output is correct
55 Correct 982 ms 80544 KB Output is correct
56 Correct 950 ms 80620 KB Output is correct
57 Correct 927 ms 80648 KB Output is correct
58 Correct 919 ms 80464 KB Output is correct
59 Correct 928 ms 80484 KB Output is correct
60 Correct 932 ms 80452 KB Output is correct
61 Correct 943 ms 80492 KB Output is correct
62 Correct 975 ms 80480 KB Output is correct
63 Correct 936 ms 80504 KB Output is correct
64 Correct 946 ms 80480 KB Output is correct
65 Incorrect 1012 ms 80480 KB Output isn't correct
66 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 47812 KB Output is correct
2 Correct 45 ms 47824 KB Output is correct
3 Correct 45 ms 47852 KB Output is correct
4 Correct 47 ms 47864 KB Output is correct
5 Correct 47 ms 47772 KB Output is correct
6 Correct 47 ms 47824 KB Output is correct
7 Correct 45 ms 47864 KB Output is correct
8 Correct 44 ms 47816 KB Output is correct
9 Correct 48 ms 47864 KB Output is correct
10 Correct 44 ms 47864 KB Output is correct
11 Correct 46 ms 47376 KB Output is correct
12 Correct 44 ms 47380 KB Output is correct
13 Correct 49 ms 47472 KB Output is correct
14 Correct 45 ms 47404 KB Output is correct
15 Correct 44 ms 47480 KB Output is correct
16 Correct 47 ms 47596 KB Output is correct
17 Correct 48 ms 47632 KB Output is correct
18 Correct 49 ms 47612 KB Output is correct
19 Correct 50 ms 47608 KB Output is correct
20 Correct 46 ms 47608 KB Output is correct
21 Correct 50 ms 47676 KB Output is correct
22 Correct 48 ms 47576 KB Output is correct
23 Correct 48 ms 47608 KB Output is correct
24 Correct 49 ms 47736 KB Output is correct
25 Correct 46 ms 47736 KB Output is correct
26 Correct 45 ms 47480 KB Output is correct
27 Correct 47 ms 47480 KB Output is correct
28 Correct 48 ms 47484 KB Output is correct
29 Correct 49 ms 47480 KB Output is correct
30 Correct 48 ms 47452 KB Output is correct
31 Correct 45 ms 47452 KB Output is correct
32 Correct 49 ms 47480 KB Output is correct
33 Correct 45 ms 47480 KB Output is correct
34 Correct 43 ms 47480 KB Output is correct
35 Correct 43 ms 47480 KB Output is correct
36 Correct 46 ms 47608 KB Output is correct
37 Correct 45 ms 47608 KB Output is correct
38 Correct 46 ms 47676 KB Output is correct
39 Correct 47 ms 47640 KB Output is correct
40 Correct 47 ms 47608 KB Output is correct
41 Correct 45 ms 47608 KB Output is correct
42 Correct 47 ms 47608 KB Output is correct
43 Correct 48 ms 47652 KB Output is correct
44 Correct 46 ms 47616 KB Output is correct
45 Correct 45 ms 47608 KB Output is correct
46 Correct 46 ms 47596 KB Output is correct
47 Correct 46 ms 47608 KB Output is correct
48 Correct 940 ms 80488 KB Output is correct
49 Correct 943 ms 80464 KB Output is correct
50 Correct 961 ms 80464 KB Output is correct
51 Correct 999 ms 80464 KB Output is correct
52 Correct 953 ms 80492 KB Output is correct
53 Correct 900 ms 80460 KB Output is correct
54 Correct 916 ms 80528 KB Output is correct
55 Correct 913 ms 80452 KB Output is correct
56 Correct 915 ms 80480 KB Output is correct
57 Correct 911 ms 80480 KB Output is correct
58 Correct 918 ms 80480 KB Output is correct
59 Correct 895 ms 80488 KB Output is correct
60 Correct 923 ms 80484 KB Output is correct
61 Correct 936 ms 80480 KB Output is correct
62 Correct 921 ms 80452 KB Output is correct
63 Correct 906 ms 80476 KB Output is correct
64 Correct 917 ms 80480 KB Output is correct
65 Correct 1071 ms 80492 KB Output is correct
66 Correct 959 ms 80500 KB Output is correct
67 Correct 948 ms 80464 KB Output is correct
68 Correct 943 ms 80608 KB Output is correct
69 Correct 936 ms 80520 KB Output is correct
70 Correct 982 ms 80544 KB Output is correct
71 Correct 950 ms 80620 KB Output is correct
72 Correct 927 ms 80648 KB Output is correct
73 Correct 919 ms 80464 KB Output is correct
74 Correct 928 ms 80484 KB Output is correct
75 Correct 932 ms 80452 KB Output is correct
76 Correct 943 ms 80492 KB Output is correct
77 Correct 975 ms 80480 KB Output is correct
78 Correct 936 ms 80504 KB Output is correct
79 Correct 946 ms 80480 KB Output is correct
80 Incorrect 1012 ms 80480 KB Output isn't correct
81 Halted 0 ms 0 KB -