Submission #24263

#TimeUsernameProblemLanguageResultExecution timeMemory
24263jiaqiyangCultivation (JOI17_cultivation)C++14
80 / 100
2000 ms6704 KiB
#include <cstdio> #include <climits> #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]; struct Info { i64 a, b, c; Info() { a = b = c = 0; } Info(i64 _a, i64 _b, i64 _c): a(_a), b(_b), c(_c) {} } f[N][N]; 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].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, i64> 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, i64 y) { while (f <= r && q[r].second <= y) --r; q[++r] = std::make_pair(x, y); } inline i64 front() const { return q[f].second; } }; i64 solve(int len) { i64 res = INT_MAX; 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; 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; 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); res = std::min(res, std::max(q[0].front() + q[1].front(), q[2].front())); } 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() && cur[i] <= ans; ++i) ans = std::min(ans, cur[i] + solve(cur[i])); printf("%lld\n", ans); return 0; }

Compilation message (stderr)

cultivation.cpp: In function 'int main()':
cultivation.cpp:106:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < cur.size() && cur[i] <= ans; ++i) ans = std::min(ans, cur[i] + solve(cur[i]));
                     ^
cultivation.cpp:90: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:91: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);
                                                                   ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...