oj.uz

Submission #24270

# Submission time Handle Problem Language Result Execution time Memory
24270 2017-06-03T13:11:46 Z jiaqiyang Cultivation (JOI17_cultivation) C++14
100 / 100
 1966 ms 3996 KB 
#include <cstdio>
#include <climits>
#include <vector>
#include <algorithm>

typedef long long i64;

const int N = 300 + 10;

int r, c, n;

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

struct Info {
  int a, b, c;
  Info() { a = b = c = 0; }
  Info(int _a, int _b, int _c): a(_a), b(_b), c(_c) {}
} f[N][N];

void init(int l) {
  static int 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].a = cur[0] - 1;
    f[l][r].b = c - cur[tot++];
    for (int i = 1; i < tot; ++i) f[l][r].c = std::max(f[l][r].c, cur[i] - cur[i - 1] - 1);
  }
}

class Queue {
  std::pair<int, int> q[4 * N];
  int f, r;
 public:
  void clear() {
    f = 1;
    r = 0;
  }
  void trim(int s) {
    while (f <= r && q[f].first < s) ++f;
  }
  void push(int x, int y) {
    while (f <= r && q[r].second <= y) --r;
    q[++r] = std::make_pair(x, y);
  }
  inline int front() const { return q[f].second; }
};

int ans;

void solve(int len) {
  static Info info[4 * N];
  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 + 1;
  }
  std::merge(pool + 1, pool + n + 1, pool + n + 1, pool + 2 * n + 1, temp + 1);
  std::copy(temp + 1, temp + 2 * n + 1, pool + 1);
  int tot = std::unique(pool + 1, pool + 2 * 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] <= (i64)p[l].x + len)) ++l;
    for (r = std::max(l, r); r <= n && p[r].x <= pool[i] && pool[i] <= (i64)p[r].x + len;) ++r;
    info[i] = (l > n ? Info(INT_MAX, INT_MAX, INT_MAX) : f[l][r - 1]);
  }
  static Queue q[3];
  q[0].clear(), q[1].clear(), q[2].clear();
  for (int i = 1, j = 1; i <= tot; ++i) {
    i64 s = pool[i];
    q[0].trim(i), q[1].trim(i), q[2].trim(i);
    for (; j <= tot && pool[j] <= s + r - 1; ++j) q[0].push(j, info[j].a), q[1].push(j, info[j].b), q[2].push(j, info[j].c);
    i64 cur = std::max(q[0].front() + q[1].front(), q[2].front());
    if (cur >= INT_MAX) break;
    ans = std::min<i64>(ans, cur + len);
  }
}

int main() {
  scanf("%d%d%d", &r, &c, &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &p[i].x, &p[i].y);
  std::sort(p + 1, p + n + 1);
  std::vector<int> 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, 0));
  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());
  ans = INT_MAX;
  for (int i = 0; i < cur.size(); ++i) solve(cur[i]);
  printf("%d\n", ans);
  return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:102:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < cur.size(); ++i) solve(cur[i]);
                     ^
cultivation.cpp:86:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &r, &c, &n);
                              ^
cultivation.cpp:87:63: 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("%d%d", &p[i].x, &p[i].y);
                                                               ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
30.0 / 30.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2376 KB Output is correct
2 Correct 0 ms 2376 KB Output is correct
3 Correct 0 ms 2376 KB Output is correct
4 Correct 0 ms 2376 KB Output is correct
5 Correct 0 ms 2376 KB Output is correct
6 Correct 0 ms 2376 KB Output is correct
7 Correct 0 ms 2376 KB Output is correct
8 Correct 0 ms 2376 KB Output is correct
9 Correct 0 ms 2376 KB Output is correct
10 Correct 0 ms 2376 KB Output is correct
11 Correct 0 ms 2376 KB Output is correct
12 Correct 0 ms 2376 KB Output is correct
13 Correct 0 ms 2376 KB Output is correct
14 Correct 0 ms 2376 KB Output is correct
15 Correct 0 ms 2376 KB Output is correct
16 Correct 0 ms 2376 KB Output is correct
17 Correct 0 ms 2376 KB Output is correct
18 Correct 0 ms 2376 KB Output is correct
19 Correct 0 ms 2376 KB Output is correct
20 Correct 0 ms 2376 KB Output is correct
21 Correct 43 ms 2516 KB Output is correct
22 Correct 66 ms 2516 KB Output is correct
23 Correct 66 ms 2516 KB Output is correct
24 Correct 59 ms 2516 KB Output is correct
25 Correct 69 ms 2516 KB Output is correct
26 Correct 23 ms 2516 KB Output is correct
27 Correct 66 ms 2516 KB Output is correct
28 Correct 73 ms 2516 KB Output is correct
29 Correct 66 ms 2516 KB Output is correct
30 Correct 69 ms 2516 KB Output is correct
31 Correct 69 ms 2516 KB Output is correct
32 Correct 63 ms 2516 KB Output is correct
33 Correct 86 ms 2516 KB Output is correct
34 Correct 73 ms 2516 KB Output is correct
35 Correct 73 ms 2516 KB Output is correct
36 Correct 66 ms 2516 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2376 KB Output is correct
2 Correct 0 ms 2376 KB Output is correct
3 Correct 0 ms 2376 KB Output is correct
4 Correct 0 ms 2376 KB Output is correct
5 Correct 0 ms 2376 KB Output is correct
6 Correct 0 ms 2376 KB Output is correct
7 Correct 0 ms 2376 KB Output is correct
8 Correct 0 ms 2376 KB Output is correct
9 Correct 0 ms 2376 KB Output is correct
10 Correct 0 ms 2376 KB Output is correct
11 Correct 0 ms 2376 KB Output is correct
12 Correct 0 ms 2376 KB Output is correct
13 Correct 0 ms 2376 KB Output is correct
14 Correct 0 ms 2376 KB Output is correct
15 Correct 0 ms 2376 KB Output is correct
16 Correct 0 ms 2376 KB Output is correct
17 Correct 0 ms 2376 KB Output is correct
18 Correct 0 ms 2516 KB Output is correct
19 Correct 0 ms 2376 KB Output is correct
20 Correct 0 ms 2376 KB Output is correct
21 Correct 0 ms 2376 KB Output is correct
22 Correct 3 ms 2648 KB Output is correct
23 Correct 0 ms 2376 KB Output is correct
24 Correct 6 ms 2844 KB Output is correct
25 Correct 0 ms 2844 KB Output is correct
26 Correct 13 ms 3996 KB Output is correct
27 Correct 9 ms 3996 KB Output is correct
28 Correct 6 ms 2844 KB Output is correct
29 Correct 13 ms 3996 KB Output is correct
30 Correct 13 ms 3996 KB Output is correct
31 Correct 16 ms 3996 KB Output is correct
32 Correct 13 ms 3996 KB Output is correct
33 Correct 6 ms 3996 KB Output is correct
34 Correct 13 ms 3996 KB Output is correct
35 Correct 13 ms 3996 KB Output is correct
36 Correct 19 ms 3996 KB Output is correct
37 Correct 13 ms 3996 KB Output is correct
38 Correct 13 ms 3996 KB Output is correct
39 Correct 13 ms 3996 KB Output is correct
40 Correct 13 ms 3996 KB Output is correct
41 Correct 9 ms 3996 KB Output is correct
42 Correct 13 ms 3996 KB Output is correct
43 Correct 19 ms 3996 KB Output is correct
44 Correct 13 ms 3996 KB Output is correct
45 Correct 0 ms 2376 KB Output is correct
46 Correct 0 ms 2376 KB Output is correct
47 Correct 0 ms 2376 KB Output is correct
48 Correct 0 ms 2376 KB Output is correct
49 Correct 0 ms 2376 KB Output is correct
50 Correct 0 ms 2376 KB Output is correct
51 Correct 0 ms 2376 KB Output is correct
52 Correct 0 ms 2376 KB Output is correct
53 Correct 0 ms 2376 KB Output is correct
54 Correct 0 ms 2376 KB Output is correct
55 Correct 0 ms 2376 KB Output is correct
56 Correct 0 ms 2376 KB Output is correct
57 Correct 0 ms 2376 KB Output is correct
58 Correct 0 ms 2376 KB Output is correct
59 Correct 0 ms 2376 KB Output is correct
60 Correct 0 ms 2376 KB Output is correct
61 Correct 0 ms 2376 KB Output is correct
62 Correct 0 ms 2376 KB Output is correct
63 Correct 0 ms 2376 KB Output is correct
64 Correct 0 ms 2376 KB Output is correct
65 Correct 43 ms 2516 KB Output is correct
66 Correct 66 ms 2516 KB Output is correct
67 Correct 66 ms 2516 KB Output is correct
68 Correct 59 ms 2516 KB Output is correct
69 Correct 69 ms 2516 KB Output is correct
70 Correct 23 ms 2516 KB Output is correct
71 Correct 66 ms 2516 KB Output is correct
72 Correct 73 ms 2516 KB Output is correct
73 Correct 66 ms 2516 KB Output is correct
74 Correct 69 ms 2516 KB Output is correct
75 Correct 69 ms 2516 KB Output is correct
76 Correct 63 ms 2516 KB Output is correct
77 Correct 86 ms 2516 KB Output is correct
78 Correct 73 ms 2516 KB Output is correct
79 Correct 73 ms 2516 KB Output is correct
80 Correct 66 ms 2516 KB Output is correct
81 Correct 719 ms 3228 KB Output is correct
82 Correct 783 ms 3228 KB Output is correct
83 Correct 946 ms 3228 KB Output is correct
84 Correct 1123 ms 3228 KB Output is correct
85 Correct 1916 ms 3996 KB Output is correct
86 Correct 1736 ms 3996 KB Output is correct
87 Correct 1176 ms 3996 KB Output is correct
88 Correct 1796 ms 3996 KB Output is correct
89 Correct 1856 ms 3996 KB Output is correct
90 Correct 1143 ms 3228 KB Output is correct
91 Correct 1763 ms 3996 KB Output is correct
92 Correct 1763 ms 3996 KB Output is correct
93 Correct 1643 ms 3996 KB Output is correct
94 Correct 1899 ms 3996 KB Output is correct
95 Correct 1966 ms 3996 KB Output is correct
96 Correct 1846 ms 3996 KB Output is correct
97 Correct 1689 ms 3996 KB Output is correct
98 Correct 16 ms 3996 KB Output is correct