oj.uz

Submission #24260

# Submission time Handle Problem Language Result Execution time Memory
24260 2017-06-03T12:38:55 Z jiaqiyang Cultivation (JOI17_cultivation) C++14
80 / 100
 2000 ms 6700 KB 
#include <cstdio>
#include <climits>
#include <cstring>
#include <vector>
#include <algorithm>

typedef long long i64;

const int N = 300 + 10;

i64 r, c;
int n;

struct Point {
  i64 x, y;
  Point() {}
  Point(i64 _x, i64 _y): x(_x), y(_y) {}
  inline bool operator< (const Point &rhs) const {
    return x < rhs.x || (x == rhs.x && y < rhs.y);
  }
} p[N];

i64 f[N][N][3];

void init(int l) {
  static i64 cur[N];
  int tot = 0;
  for (int r = l; r <= n; ++r) {
    int k = std::lower_bound(cur, cur + tot, p[r].y) - cur;
    cur[tot] = p[r].y;
    std::rotate(cur + k, cur + tot, cur + tot + 1);
    f[l][r][0] = cur[0] - 1;
    f[l][r][1] = c - cur[tot++];
    for (int i = 1; i < tot; ++i) f[l][r][2] = std::max(f[l][r][2], cur[i] - cur[i - 1] - 1);
  }
}

i64 solve(int len) {
  i64 res = INT_MAX;
  static i64 info[4 * N][3];
  static i64 pool[4 * N], temp[4 * N];
  for (int i = 1; i <= n; ++i) {
    pool[i] = p[i].x;
    pool[i + n] = p[i].x + len;
    pool[i + 2 * n] = p[i].x + len + 1;
    pool[i + 3 * n] = p[i].x + r - 1;
  }
  std::merge(pool + 1, pool + n + 1, pool + n + 1, pool + 2 * n + 1, temp + 1);
  std::merge(pool + 2 * n + 1, pool + 3 * n + 1, pool + 3 * n + 1, pool + 4 * n + 1, temp + 2 * n + 1);
  std::merge(temp + 1, temp + 2 * n + 1, temp + 2 * n + 1, temp + 4 * n + 1, pool + 1);
  int tot = std::unique(pool + 1, pool + 4 * n + 1) - pool - 1;
  for (int i = 1, l = 1, r = 1; i <= tot; ++i) {
    while (l <= n && !(p[l].x <= pool[i] && pool[i] <= p[l].x + len)) ++l;
    for (r = std::max(l, r); r <= n && p[r].x <= pool[i] && pool[i] <= p[r].x + len;) ++r;
    static const i64 INF[3] = {INT_MAX, INT_MAX, INT_MAX};
    memcpy(info[i], l > n ? INF : f[l][r - 1], 3 * sizeof(i64));
  }
  static std::pair<int, i64> q[3][4 * N];
  int f[3] = {1, 1, 1}, r[3] = {0, 0, 0};
  for (int i = 1, j = 1; i <= tot; ++i) {
    i64 s = pool[i];
    for (int k = 0; k < 3; ++k) while (f[k] <= r[k] && q[k][f[k]].first < i) ++f[k];
    for (; j <= tot && pool[j] <= s + ::r - 1; ++j) {
      for (int k = 0; k < 3; ++k) {
        while (f[k] <= r[k] && q[k][r[k]].second <= info[j][k]) --r[k];
        q[k][++r[k]] = {j, info[j][k]};
      }
    }
    res = std::min(res, std::max(q[0][f[0]].second + q[1][f[1]].second, q[2][f[2]].second));
  }
  return res;
}

int main() {
  scanf("%lld%lld%d", &r, &c, &n);
  for (int i = 1; i <= n; ++i) scanf("%lld%lld", &p[i].x, &p[i].y);
  std::sort(p + 1, p + n + 1);
  std::vector<i64> cur;
  for (int i = 1; i <= n; ++i) init(i);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j < i; ++j)
      cur.push_back(std::max(p[i].x - p[j].x - 1, 0LL));
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      cur.push_back(p[i].x - 1 + r - p[j].x);
  for (int i = 1; i <= n; ++i) cur.push_back(p[i].x - 1), cur.push_back(r - p[i].x);
  cur.push_back(0);
  std::sort(cur.begin(), cur.end());
  cur.erase(std::unique(cur.begin(), cur.end()), cur.end());
  i64 ans = INT_MAX;
  for (int i = 0; i < cur.size(); ++i) ans = std::min(ans, cur[i] + solve(cur[i]));
  printf("%lld\n", ans);
  return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:91:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < cur.size(); ++i) ans = std::min(ans, cur[i] + solve(cur[i]));
                     ^
cultivation.cpp:75:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%d", &r, &c, &n);
                                  ^
cultivation.cpp:76:67: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= n; ++i) scanf("%lld%lld", &p[i].x, &p[i].y);
                                                                   ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3544 KB Output is correct
2 Correct 0 ms 3544 KB Output is correct
3 Correct 0 ms 3544 KB Output is correct
4 Correct 0 ms 3544 KB Output is correct
5 Correct 0 ms 3544 KB Output is correct
6 Correct 0 ms 3544 KB Output is correct
7 Correct 0 ms 3544 KB Output is correct
8 Correct 0 ms 3544 KB Output is correct
9 Correct 0 ms 3544 KB Output is correct
10 Correct 0 ms 3544 KB Output is correct
11 Correct 0 ms 3544 KB Output is correct
12 Correct 0 ms 3544 KB Output is correct
13 Correct 0 ms 3544 KB Output is correct
14 Correct 0 ms 3544 KB Output is correct
15 Correct 0 ms 3544 KB Output is correct
16 Correct 0 ms 3544 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3544 KB Output is correct
2 Correct 0 ms 3544 KB Output is correct
3 Correct 0 ms 3544 KB Output is correct
4 Correct 0 ms 3544 KB Output is correct
5 Correct 0 ms 3544 KB Output is correct
6 Correct 0 ms 3544 KB Output is correct
7 Correct 0 ms 3544 KB Output is correct
8 Correct 0 ms 3544 KB Output is correct
9 Correct 0 ms 3544 KB Output is correct
10 Correct 0 ms 3544 KB Output is correct
11 Correct 0 ms 3544 KB Output is correct
12 Correct 0 ms 3544 KB Output is correct
13 Correct 0 ms 3544 KB Output is correct
14 Correct 0 ms 3544 KB Output is correct
15 Correct 0 ms 3544 KB Output is correct
16 Correct 0 ms 3544 KB Output is correct
17 Correct 0 ms 3544 KB Output is correct
18 Correct 0 ms 3684 KB Output is correct
19 Correct 0 ms 3544 KB Output is correct
20 Correct 0 ms 3544 KB Output is correct
21 Correct 0 ms 3684 KB Output is correct
22 Correct 0 ms 4012 KB Output is correct
23 Correct 0 ms 3544 KB Output is correct
24 Correct 6 ms 4396 KB Output is correct
25 Correct 3 ms 4396 KB Output is correct
26 Correct 16 ms 6700 KB Output is correct
27 Correct 13 ms 6700 KB Output is correct
28 Correct 3 ms 4396 KB Output is correct
29 Correct 13 ms 6700 KB Output is correct
30 Correct 16 ms 6700 KB Output is correct
31 Correct 13 ms 6700 KB Output is correct
32 Correct 9 ms 6700 KB Output is correct
33 Correct 16 ms 6700 KB Output is correct
34 Correct 9 ms 6700 KB Output is correct
35 Correct 13 ms 6700 KB Output is correct
36 Correct 13 ms 6700 KB Output is correct
37 Correct 16 ms 6700 KB Output is correct
38 Correct 16 ms 6700 KB Output is correct
39 Correct 13 ms 6700 KB Output is correct
40 Correct 13 ms 6700 KB Output is correct
41 Correct 13 ms 6700 KB Output is correct
42 Correct 13 ms 6700 KB Output is correct
43 Correct 13 ms 6700 KB Output is correct
44 Correct 16 ms 6700 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3544 KB Output is correct
2 Correct 3 ms 3544 KB Output is correct
3 Correct 6 ms 3544 KB Output is correct
4 Correct 3 ms 3544 KB Output is correct
5 Correct 3 ms 3544 KB Output is correct
6 Correct 0 ms 3544 KB Output is correct
7 Correct 0 ms 3544 KB Output is correct
8 Correct 3 ms 3544 KB Output is correct
9 Correct 0 ms 3544 KB Output is correct
10 Correct 3 ms 3544 KB Output is correct
11 Correct 3 ms 3544 KB Output is correct
12 Correct 0 ms 3544 KB Output is correct
13 Correct 0 ms 3544 KB Output is correct
14 Correct 0 ms 3544 KB Output is correct
15 Correct 0 ms 3544 KB Output is correct
16 Correct 3 ms 3544 KB Output is correct
17 Correct 3 ms 3544 KB Output is correct
18 Correct 0 ms 3544 KB Output is correct
19 Correct 3 ms 3544 KB Output is correct
20 Correct 3 ms 3544 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3544 KB Output is correct
2 Correct 3 ms 3544 KB Output is correct
3 Correct 6 ms 3544 KB Output is correct
4 Correct 3 ms 3544 KB Output is correct
5 Correct 3 ms 3544 KB Output is correct
6 Correct 0 ms 3544 KB Output is correct
7 Correct 0 ms 3544 KB Output is correct
8 Correct 3 ms 3544 KB Output is correct
9 Correct 0 ms 3544 KB Output is correct
10 Correct 3 ms 3544 KB Output is correct
11 Correct 3 ms 3544 KB Output is correct
12 Correct 0 ms 3544 KB Output is correct
13 Correct 0 ms 3544 KB Output is correct
14 Correct 0 ms 3544 KB Output is correct
15 Correct 0 ms 3544 KB Output is correct
16 Correct 3 ms 3544 KB Output is correct
17 Correct 3 ms 3544 KB Output is correct
18 Correct 0 ms 3544 KB Output is correct
19 Correct 3 ms 3544 KB Output is correct
20 Correct 3 ms 3544 KB Output is correct
21 Correct 163 ms 3816 KB Output is correct
22 Correct 243 ms 3816 KB Output is correct
23 Correct 223 ms 3816 KB Output is correct
24 Correct 259 ms 3816 KB Output is correct
25 Correct 229 ms 3816 KB Output is correct
26 Correct 83 ms 3816 KB Output is correct
27 Correct 243 ms 3816 KB Output is correct
28 Correct 246 ms 3816 KB Output is correct
29 Correct 229 ms 3816 KB Output is correct
30 Correct 229 ms 3816 KB Output is correct
31 Correct 276 ms 3816 KB Output is correct
32 Correct 226 ms 3816 KB Output is correct
33 Correct 233 ms 3816 KB Output is correct
34 Correct 256 ms 3816 KB Output is correct
35 Correct 226 ms 3816 KB Output is correct
36 Correct 229 ms 3816 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3544 KB Output is correct
2 Correct 0 ms 3544 KB Output is correct
3 Correct 0 ms 3544 KB Output is correct
4 Correct 0 ms 3544 KB Output is correct
5 Correct 0 ms 3544 KB Output is correct
6 Correct 0 ms 3544 KB Output is correct
7 Correct 0 ms 3544 KB Output is correct
8 Correct 0 ms 3544 KB Output is correct
9 Correct 0 ms 3544 KB Output is correct
10 Correct 0 ms 3544 KB Output is correct
11 Correct 0 ms 3544 KB Output is correct
12 Correct 0 ms 3544 KB Output is correct
13 Correct 0 ms 3544 KB Output is correct
14 Correct 0 ms 3544 KB Output is correct
15 Correct 0 ms 3544 KB Output is correct
16 Correct 0 ms 3544 KB Output is correct
17 Correct 0 ms 3544 KB Output is correct
18 Correct 0 ms 3684 KB Output is correct
19 Correct 0 ms 3544 KB Output is correct
20 Correct 0 ms 3544 KB Output is correct
21 Correct 0 ms 3684 KB Output is correct
22 Correct 0 ms 4012 KB Output is correct
23 Correct 0 ms 3544 KB Output is correct
24 Correct 6 ms 4396 KB Output is correct
25 Correct 3 ms 4396 KB Output is correct
26 Correct 16 ms 6700 KB Output is correct
27 Correct 13 ms 6700 KB Output is correct
28 Correct 3 ms 4396 KB Output is correct
29 Correct 13 ms 6700 KB Output is correct
30 Correct 16 ms 6700 KB Output is correct
31 Correct 13 ms 6700 KB Output is correct
32 Correct 9 ms 6700 KB Output is correct
33 Correct 16 ms 6700 KB Output is correct
34 Correct 9 ms 6700 KB Output is correct
35 Correct 13 ms 6700 KB Output is correct
36 Correct 13 ms 6700 KB Output is correct
37 Correct 16 ms 6700 KB Output is correct
38 Correct 16 ms 6700 KB Output is correct
39 Correct 13 ms 6700 KB Output is correct
40 Correct 13 ms 6700 KB Output is correct
41 Correct 13 ms 6700 KB Output is correct
42 Correct 13 ms 6700 KB Output is correct
43 Correct 13 ms 6700 KB Output is correct
44 Correct 16 ms 6700 KB Output is correct
45 Correct 0 ms 3544 KB Output is correct
46 Correct 3 ms 3544 KB Output is correct
47 Correct 6 ms 3544 KB Output is correct
48 Correct 3 ms 3544 KB Output is correct
49 Correct 3 ms 3544 KB Output is correct
50 Correct 0 ms 3544 KB Output is correct
51 Correct 0 ms 3544 KB Output is correct
52 Correct 3 ms 3544 KB Output is correct
53 Correct 0 ms 3544 KB Output is correct
54 Correct 3 ms 3544 KB Output is correct
55 Correct 3 ms 3544 KB Output is correct
56 Correct 0 ms 3544 KB Output is correct
57 Correct 0 ms 3544 KB Output is correct
58 Correct 0 ms 3544 KB Output is correct
59 Correct 0 ms 3544 KB Output is correct
60 Correct 3 ms 3544 KB Output is correct
61 Correct 3 ms 3544 KB Output is correct
62 Correct 0 ms 3544 KB Output is correct
63 Correct 3 ms 3544 KB Output is correct
64 Correct 3 ms 3544 KB Output is correct
65 Correct 163 ms 3816 KB Output is correct
66 Correct 243 ms 3816 KB Output is correct
67 Correct 223 ms 3816 KB Output is correct
68 Correct 259 ms 3816 KB Output is correct
69 Correct 229 ms 3816 KB Output is correct
70 Correct 83 ms 3816 KB Output is correct
71 Correct 243 ms 3816 KB Output is correct
72 Correct 246 ms 3816 KB Output is correct
73 Correct 229 ms 3816 KB Output is correct
74 Correct 229 ms 3816 KB Output is correct
75 Correct 276 ms 3816 KB Output is correct
76 Correct 226 ms 3816 KB Output is correct
77 Correct 233 ms 3816 KB Output is correct
78 Correct 256 ms 3816 KB Output is correct
79 Correct 226 ms 3816 KB Output is correct
80 Correct 229 ms 3816 KB Output is correct
81 Execution timed out 2000 ms 5164 KB Execution timed out
82 Halted 0 ms 0 KB -