oj.uz

답안 #37686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
37686 2017-12-27T02:00:20 Z funcsr Bulldozer (JOI17_bulldozer) C++14
25 / 100
 2000 ms 172736 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> ln[2000000];
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<Rel> 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(r);
  }
  sort(all(lines)); uniq(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]);
    ln[index(lines, r)].pb(P(i, j));
  }
  long long m = seg[0].m;
  rep(e, lines.size()) {
    vector<long long> bs;
    const Rel &a = lines[e];
    for (P p : ln[e]) bs.pb(1LL*Y[p._1]*a.q-1LL*X[p._1]*a.p);
    sort(all(bs)); uniq(bs);
    rep(i, bs.size()) G[i].clear();

    for (P p : ln[e]) {
      int k = index(bs, 1LL*Y[p._1]*a.q-1LL*X[p._1]*a.p);
      G[k].pb(P(pos[p._1], p._1));
      G[k].pb(P(pos[p._2], p._2));
    }
    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]));
      }
    }
    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:97:3: note: in expansion of macro 'rep'
   rep(e, lines.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:102:5: 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:109:5: 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:112:7: note: in expansion of macro 'rep'
       rep(i, ps.size()/2) {
       ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 94712 KB Output is correct
2 Correct 85 ms 94712 KB Output is correct
3 Correct 85 ms 94712 KB Output is correct
4 Correct 89 ms 94840 KB Output is correct
5 Correct 91 ms 94712 KB Output is correct
6 Correct 86 ms 94796 KB Output is correct
7 Correct 86 ms 94684 KB Output is correct
8 Correct 90 ms 94796 KB Output is correct
9 Correct 85 ms 94712 KB Output is correct
10 Correct 89 ms 94860 KB Output is correct
11 Correct 83 ms 94328 KB Output is correct
12 Correct 84 ms 94328 KB Output is correct
13 Correct 88 ms 94428 KB Output is correct
14 Correct 90 ms 94448 KB Output is correct
15 Correct 85 ms 94328 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 94628 KB Output is correct
2 Correct 90 ms 94556 KB Output is correct
3 Correct 89 ms 94660 KB Output is correct
4 Correct 89 ms 94580 KB Output is correct
5 Correct 92 ms 94576 KB Output is correct
6 Correct 89 ms 94648 KB Output is correct
7 Correct 90 ms 94712 KB Output is correct
8 Correct 93 ms 94652 KB Output is correct
9 Correct 94 ms 94596 KB Output is correct
10 Correct 91 ms 94636 KB Output is correct
11 Correct 91 ms 94440 KB Output is correct
12 Correct 84 ms 94336 KB Output is correct
13 Correct 89 ms 94424 KB Output is correct
14 Correct 85 ms 94452 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94480 KB Output is correct
17 Correct 86 ms 94436 KB Output is correct
18 Correct 91 ms 94428 KB Output is correct
19 Correct 89 ms 94456 KB Output is correct
20 Correct 86 ms 94456 KB Output is correct
21 Correct 87 ms 94656 KB Output is correct
22 Correct 89 ms 94608 KB Output is correct
23 Correct 91 ms 94648 KB Output is correct
24 Correct 91 ms 94648 KB Output is correct
25 Correct 92 ms 94652 KB Output is correct
26 Correct 92 ms 94652 KB Output is correct
27 Correct 89 ms 94560 KB Output is correct
28 Correct 93 ms 94732 KB Output is correct
29 Correct 173 ms 94608 KB Output is correct
30 Correct 89 ms 94536 KB Output is correct
31 Correct 93 ms 94584 KB Output is correct
32 Correct 89 ms 94720 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 94628 KB Output is correct
2 Correct 90 ms 94556 KB Output is correct
3 Correct 89 ms 94660 KB Output is correct
4 Correct 89 ms 94580 KB Output is correct
5 Correct 92 ms 94576 KB Output is correct
6 Correct 89 ms 94648 KB Output is correct
7 Correct 90 ms 94712 KB Output is correct
8 Correct 93 ms 94652 KB Output is correct
9 Correct 94 ms 94596 KB Output is correct
10 Correct 91 ms 94636 KB Output is correct
11 Correct 91 ms 94440 KB Output is correct
12 Correct 84 ms 94336 KB Output is correct
13 Correct 89 ms 94424 KB Output is correct
14 Correct 85 ms 94452 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94480 KB Output is correct
17 Correct 86 ms 94436 KB Output is correct
18 Correct 91 ms 94428 KB Output is correct
19 Correct 89 ms 94456 KB Output is correct
20 Correct 86 ms 94456 KB Output is correct
21 Correct 87 ms 94656 KB Output is correct
22 Correct 89 ms 94608 KB Output is correct
23 Correct 91 ms 94648 KB Output is correct
24 Correct 91 ms 94648 KB Output is correct
25 Correct 92 ms 94652 KB Output is correct
26 Correct 92 ms 94652 KB Output is correct
27 Correct 89 ms 94560 KB Output is correct
28 Correct 93 ms 94732 KB Output is correct
29 Correct 173 ms 94608 KB Output is correct
30 Correct 89 ms 94536 KB Output is correct
31 Correct 93 ms 94584 KB Output is correct
32 Correct 89 ms 94720 KB Output is correct
33 Execution timed out 2093 ms 172736 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 94628 KB Output is correct
2 Correct 90 ms 94556 KB Output is correct
3 Correct 89 ms 94660 KB Output is correct
4 Correct 89 ms 94580 KB Output is correct
5 Correct 92 ms 94576 KB Output is correct
6 Correct 89 ms 94648 KB Output is correct
7 Correct 90 ms 94712 KB Output is correct
8 Correct 93 ms 94652 KB Output is correct
9 Correct 94 ms 94596 KB Output is correct
10 Correct 91 ms 94636 KB Output is correct
11 Correct 91 ms 94440 KB Output is correct
12 Correct 84 ms 94336 KB Output is correct
13 Correct 89 ms 94424 KB Output is correct
14 Correct 85 ms 94452 KB Output is correct
15 Correct 86 ms 94332 KB Output is correct
16 Correct 87 ms 94480 KB Output is correct
17 Correct 86 ms 94436 KB Output is correct
18 Correct 91 ms 94428 KB Output is correct
19 Correct 89 ms 94456 KB Output is correct
20 Correct 86 ms 94456 KB Output is correct
21 Correct 87 ms 94656 KB Output is correct
22 Correct 89 ms 94608 KB Output is correct
23 Correct 91 ms 94648 KB Output is correct
24 Correct 91 ms 94648 KB Output is correct
25 Correct 92 ms 94652 KB Output is correct
26 Correct 92 ms 94652 KB Output is correct
27 Correct 89 ms 94560 KB Output is correct
28 Correct 93 ms 94732 KB Output is correct
29 Correct 173 ms 94608 KB Output is correct
30 Correct 89 ms 94536 KB Output is correct
31 Correct 93 ms 94584 KB Output is correct
32 Correct 89 ms 94720 KB Output is correct
33 Execution timed out 2093 ms 172736 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 94712 KB Output is correct
2 Correct 85 ms 94712 KB Output is correct
3 Correct 85 ms 94712 KB Output is correct
4 Correct 89 ms 94840 KB Output is correct
5 Correct 91 ms 94712 KB Output is correct
6 Correct 86 ms 94796 KB Output is correct
7 Correct 86 ms 94684 KB Output is correct
8 Correct 90 ms 94796 KB Output is correct
9 Correct 85 ms 94712 KB Output is correct
10 Correct 89 ms 94860 KB Output is correct
11 Correct 83 ms 94328 KB Output is correct
12 Correct 84 ms 94328 KB Output is correct
13 Correct 88 ms 94428 KB Output is correct
14 Correct 90 ms 94448 KB Output is correct
15 Correct 85 ms 94328 KB Output is correct
16 Correct 94 ms 94628 KB Output is correct
17 Correct 90 ms 94556 KB Output is correct
18 Correct 89 ms 94660 KB Output is correct
19 Correct 89 ms 94580 KB Output is correct
20 Correct 92 ms 94576 KB Output is correct
21 Correct 89 ms 94648 KB Output is correct
22 Correct 90 ms 94712 KB Output is correct
23 Correct 93 ms 94652 KB Output is correct
24 Correct 94 ms 94596 KB Output is correct
25 Correct 91 ms 94636 KB Output is correct
26 Correct 91 ms 94440 KB Output is correct
27 Correct 84 ms 94336 KB Output is correct
28 Correct 89 ms 94424 KB Output is correct
29 Correct 85 ms 94452 KB Output is correct
30 Correct 86 ms 94332 KB Output is correct
31 Correct 87 ms 94480 KB Output is correct
32 Correct 86 ms 94436 KB Output is correct
33 Correct 91 ms 94428 KB Output is correct
34 Correct 89 ms 94456 KB Output is correct
35 Correct 86 ms 94456 KB Output is correct
36 Correct 87 ms 94656 KB Output is correct
37 Correct 89 ms 94608 KB Output is correct
38 Correct 91 ms 94648 KB Output is correct
39 Correct 91 ms 94648 KB Output is correct
40 Correct 92 ms 94652 KB Output is correct
41 Correct 92 ms 94652 KB Output is correct
42 Correct 89 ms 94560 KB Output is correct
43 Correct 93 ms 94732 KB Output is correct
44 Correct 173 ms 94608 KB Output is correct
45 Correct 89 ms 94536 KB Output is correct
46 Correct 93 ms 94584 KB Output is correct
47 Correct 89 ms 94720 KB Output is correct
48 Execution timed out 2093 ms 172736 KB Time limit exceeded
49 Halted 0 ms 0 KB -