oj.uz

Submission #419323

# Submission time Handle Problem Language Result Execution time Memory
419323 2021-06-06T22:42:39 Z 2qbingxuan Cultivation (JOI17_cultivation) C++14
30 / 100
 286 ms 976 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#ifdef local
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define pary(a...) danb(#a, a)
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        std::cerr << (f++ ? ", " : "") << *L;
    std::cerr << " ]\033[0m\n";
}
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define pb emplace_back
#define get_pos(u,x) int(lower_bound(all(u),x)-begin(u))

using namespace std;
using ll = int_fast64_t;
using ld = long double;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
const int mod = 1000000007;
const int inf = 1e9;
const ll INF = 1e18;
const int maxn = 5025;
template <typename T> void sort_uni(T &v) { sort(all(v)), v.erase(unique(all(v)), v.end()); }

#define int ll
int calc(int R, int C, vector<pair<int,int>> pts) {
    int N = pts.size();
    auto solve = [&]() {
        sort(all(pts));

        vector<int> dx{0};
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < i; j++) {
                dx.emplace_back(pts[i].first - pts[j].first - 1);
            }
            dx.emplace_back(pts[i].first - 1);
            dx.emplace_back(R - pts[i].first);
        }
        sort_uni(dx);

        int mina = pts[0].first - 1;
        int minb = R - pts[N-1].first;
        int minsum = 0;
        for (int i = 1; i < N; i++) minsum = max(minsum, pts[i].first - pts[i-1].first - 1);

        int res = 2e9;
        for (int a: dx) {
            if (a < mina) continue;
            for (int b: dx) {
                if (b < minb) continue;
                if (a + b < minsum) continue;

                vector<pair<int,int>> evt;
                for (auto [x, y]: pts) evt.emplace_back(x-a, y);
                for (auto [x, y]: pts) evt.emplace_back(x+b+1, -y);
                inplace_merge(evt.begin(), evt.begin() + N, evt.end());

                vector<int> posy;

                auto add = [&](int val) {
                    auto it = lower_bound(all(posy), val);
                    posy.insert(it, val);
                    assert( is_sorted(all(posy)) );
                };
                auto remove = [&](int val) {
                    posy.erase(find(all(posy), val));
                };
                int ans = 0, minc = 0, mind = 0;
                for (int i = 0, j = 0; i < N*2; i = j) {
                    for (j = i; j < N*2; j++) {
                        if (evt[j].first != evt[i].first) break;
                        int y = evt[j].second;
                        if (y < 0) {
                            remove(-y);
                        } else {
                            add(y);
                        }
                    }
                    if (j == N*2) continue;
                    int l = evt[i].first;
                    int r = evt[j].first;
                    if (r <= 1 || l > R) continue;
                    assert (posy.size() > 0);
                    minc = max(minc, posy.front() - 1);
                    mind = max(mind, C - posy.back());
                    if (posy.size() >= 2) {
                        for (int k = 1; k < posy.size(); k++) {
                            ans = max(ans, posy[k] - posy[k-1] - 1);
                        }
                    }
                }
                ans = max(ans, minc + mind);
                debug(a, b, ans);
                debug(minc, mind);
                res = min<ll>(res, 0LL + a + b + ans);
            }
        }
        return res;
    };
    // int res = solve();
    // for (auto &[x, y]: pts) swap(x, y);
    // swap(R, C);
    return solve();
}

int naive(int R, int C, vector<pair<int,int>> pts) {
    int grid = 0;
    for (auto [x, y]: pts) grid |= 1<<((x-1) * C + (y-1));
    unordered_map<int,int> dis;
    const int U = (1 << (R*C)) - 1;
    queue<int> q;
    dis[grid] = 0;
    q.push(grid);

    int mask1 = 0, mask2 = 0;
    for (int i = 0; i < R; i++) for (int j = 0; j < C; j++) {
        if (j - 1 >= 0)
            mask1 |= 1 << (i * C + j);
        if (j + 1 < C)
            mask2 |= 1 << (i * C + j);
    }
    while (!q.empty()) {
        int cur = q.front(); q.pop();
        if (int nxt = (cur | cur << C) & U; !dis.count(nxt))
            dis[nxt] = dis[cur] + 1, q.push(nxt);

        if (int nxt = (cur | cur >> C); !dis.count(nxt))
            dis[nxt] = dis[cur] + 1, q.push(nxt);

        if (int nxt = cur | ((cur & mask1) >> 1); !dis.count(nxt))
            dis[nxt] = dis[cur] + 1, q.push(nxt);

        if (int nxt = cur | ((cur & mask2) << 1); !dis.count(nxt))
            dis[nxt] = dis[cur] + 1, q.push(nxt);
    }
    return dis[U];
}
void verify() {
    int R, C;
    cin >> R >> C;
    for (int i = 1; i < (1<<(R*C)); i++) {
        vector<pair<int,int>> pts;
        for (int j = 0; j < R*C; j++) if (i >> j & 1) pts.emplace_back(j / C + 1, j % C + 1);
        int na = naive(R, C, pts);
        int ca = calc(R, C, pts);
        if (na != ca) {
            debug(na, ca);
            for (auto [x, y]: pts) cerr<<x<<','<<y<<'\n';
            exit(3);
        }
    }
    exit(0);
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    // verify();

    int R, C, N;
    cin >> R >> C >> N;
    vector<pair<int,int>> pts(N);
    for (auto &[x, y]: pts) cin >> x >> y;
    // cerr << naive(R, C, pts) << '\n';
    cout << calc(R, C, pts) << '\n';
}

/*
4 4 2
1 2
2 1

4 3 2
1 1
1 3
 */

Compilation message

cultivation.cpp: In lambda function:
cultivation.cpp:65:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   65 |                 for (auto [x, y]: pts) evt.emplace_back(x-a, y);
      |                           ^
cultivation.cpp:66:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |                 for (auto [x, y]: pts) evt.emplace_back(x+b+1, -y);
      |                           ^
cultivation.cpp:98:43: warning: comparison of integer expressions of different signedness: 'll' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |                         for (int k = 1; k < posy.size(); k++) {
      |                                         ~~^~~~~~~~~~~~~
cultivation.cpp: In function 'll naive(ll, ll, std::vector<std::pair<long int, long int> >)':
cultivation.cpp:119:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  119 |     for (auto [x, y]: pts) grid |= 1<<((x-1) * C + (y-1));
      |               ^
cultivation.cpp:36:13: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17'
   36 | #define int ll
      |             ^~
cultivation.cpp:135:13: note: in expansion of macro 'int'
  135 |         if (int nxt = (cur | cur << C) & U; !dis.count(nxt))
      |             ^~~
cultivation.cpp:36:13: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17'
   36 | #define int ll
      |             ^~
cultivation.cpp:138:13: note: in expansion of macro 'int'
  138 |         if (int nxt = (cur | cur >> C); !dis.count(nxt))
      |             ^~~
cultivation.cpp:36:13: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17'
   36 | #define int ll
      |             ^~
cultivation.cpp:141:13: note: in expansion of macro 'int'
  141 |         if (int nxt = cur | ((cur & mask1) >> 1); !dis.count(nxt))
      |             ^~~
cultivation.cpp:36:13: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17'
   36 | #define int ll
      |             ^~
cultivation.cpp:144:13: note: in expansion of macro 'int'
  144 |         if (int nxt = cur | ((cur & mask2) << 1); !dis.count(nxt))
      |             ^~~
cultivation.cpp: In function 'void verify()':
cultivation.cpp:159:23: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  159 |             for (auto [x, y]: pts) cerr<<x<<','<<y<<'\n';
      |                       ^
cultivation.cpp: In function 'int main()':
cultivation.cpp:172:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  172 |     for (auto &[x, y]: pts) cin >> x >> y;
      |                ^

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 6 ms 364 KB Output is correct
19 Correct 3 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 10 ms 332 KB Output is correct
22 Correct 37 ms 416 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 80 ms 716 KB Output is correct
25 Correct 53 ms 524 KB Output is correct
26 Correct 160 ms 976 KB Output is correct
27 Correct 154 ms 976 KB Output is correct
28 Correct 79 ms 716 KB Output is correct
29 Correct 139 ms 976 KB Output is correct
30 Correct 158 ms 976 KB Output is correct
31 Correct 155 ms 976 KB Output is correct
32 Correct 157 ms 848 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 6 ms 364 KB Output is correct
19 Correct 3 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 10 ms 332 KB Output is correct
22 Correct 37 ms 416 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 80 ms 716 KB Output is correct
25 Correct 53 ms 524 KB Output is correct
26 Correct 160 ms 976 KB Output is correct
27 Correct 154 ms 976 KB Output is correct
28 Correct 79 ms 716 KB Output is correct
29 Correct 139 ms 976 KB Output is correct
30 Correct 158 ms 976 KB Output is correct
31 Correct 155 ms 976 KB Output is correct
32 Correct 157 ms 848 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 124 ms 976 KB Output is correct
35 Correct 156 ms 976 KB Output is correct
36 Correct 192 ms 848 KB Output is correct
37 Correct 116 ms 976 KB Output is correct
38 Correct 158 ms 976 KB Output is correct
39 Correct 169 ms 976 KB Output is correct
40 Correct 159 ms 976 KB Output is correct
41 Correct 111 ms 976 KB Output is correct
42 Correct 128 ms 976 KB Output is correct
43 Correct 146 ms 976 KB Output is correct
44 Correct 174 ms 976 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 204 KB Output is correct
2 Correct 241 ms 292 KB Output is correct
3 Correct 258 ms 296 KB Output is correct
4 Correct 244 ms 292 KB Output is correct
5 Correct 286 ms 308 KB Output is correct
6 Correct 68 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 152 ms 296 KB Output is correct
9 Correct 76 ms 204 KB Output is correct
10 Incorrect 226 ms 324 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 204 KB Output is correct
2 Correct 241 ms 292 KB Output is correct
3 Correct 258 ms 296 KB Output is correct
4 Correct 244 ms 292 KB Output is correct
5 Correct 286 ms 308 KB Output is correct
6 Correct 68 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 152 ms 296 KB Output is correct
9 Correct 76 ms 204 KB Output is correct
10 Incorrect 226 ms 324 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 6 ms 364 KB Output is correct
19 Correct 3 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 10 ms 332 KB Output is correct
22 Correct 37 ms 416 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 80 ms 716 KB Output is correct
25 Correct 53 ms 524 KB Output is correct
26 Correct 160 ms 976 KB Output is correct
27 Correct 154 ms 976 KB Output is correct
28 Correct 79 ms 716 KB Output is correct
29 Correct 139 ms 976 KB Output is correct
30 Correct 158 ms 976 KB Output is correct
31 Correct 155 ms 976 KB Output is correct
32 Correct 157 ms 848 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 124 ms 976 KB Output is correct
35 Correct 156 ms 976 KB Output is correct
36 Correct 192 ms 848 KB Output is correct
37 Correct 116 ms 976 KB Output is correct
38 Correct 158 ms 976 KB Output is correct
39 Correct 169 ms 976 KB Output is correct
40 Correct 159 ms 976 KB Output is correct
41 Correct 111 ms 976 KB Output is correct
42 Correct 128 ms 976 KB Output is correct
43 Correct 146 ms 976 KB Output is correct
44 Correct 174 ms 976 KB Output is correct
45 Correct 34 ms 204 KB Output is correct
46 Correct 241 ms 292 KB Output is correct
47 Correct 258 ms 296 KB Output is correct
48 Correct 244 ms 292 KB Output is correct
49 Correct 286 ms 308 KB Output is correct
50 Correct 68 ms 204 KB Output is correct
51 Correct 2 ms 204 KB Output is correct
52 Correct 152 ms 296 KB Output is correct
53 Correct 76 ms 204 KB Output is correct
54 Incorrect 226 ms 324 KB Output isn't correct
55 Halted 0 ms 0 KB -