oj.uz

Submission #1071494

# Submission time Handle Problem Language Result Execution time Memory
1071494 2024-08-23T07:51:28 Z thinknoexit Cultivation (JOI17_cultivation) C++17
30 / 100
 1211 ms 720 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 303;
int s[N], e[N];
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int r, c;
    cin >> r >> c;
    int n;
    cin >> n;
    for (int i = 1;i <= n;i++) cin >> s[i] >> e[i];
    set<int> up, down;
    for (int i = 1;i <= n;i++) {
        int all = s[i] - 1;
        up.insert(all);
        all = r - s[i];
        down.insert(all);
    }
    for (int i = 1;i <= n;i++) {
        for (int j = i + 1;j <= n;j++) {
            if (s[i] != s[j]) {
                up.insert(abs(s[i] - s[j]) - 1);
                down.insert(abs(s[i] - s[j]) - 1);
            }
            up.insert(abs(s[i] - s[j]));
            down.insert(abs(s[i] - s[j]));
        }
    }
    // iterate for all O(n ^ 2)
    ll mn = LLONG_MAX;
    for (auto& u : up) {
        for (auto& d : down) {
            bool ch = 1;
            int mx = 0;
            int dl = 0, dr = 0;
            multiset<int> ms;
            vector<pair<int, int>> event;
            for (int i = 1;i <= n;i++) {
                event.push_back({ max(1, s[i] - u), e[i] });
                event.push_back({ min(r + 1, s[i] + d + 1), -e[i] });
            }
            ms.insert(0);
            ms.insert(c + 1);
            sort(event.begin(), event.end());
            int sz = event.size();
            if (event[0].first != 1) continue;
            for (int i = 0, j;i < sz;i = j) {
                if (event[i].first == r + 1) break;
                for (j = i;j < sz && event[i].first == event[j].first;j++) {
                    int v = event[j].second;
                    if (v < 0) ms.erase(ms.find(-v));
                    else ms.insert(v);
                }
                for (j = i;j < sz && event[i].first == event[j].first;j++) {
                    int v = abs(event[j].second);
                    int l = *(--ms.lower_bound(abs(v)));
                    int r = *(ms.upper_bound(abs(v)));
                    if (ms.find(v) == ms.end())
                        mx = max(mx, r - l - 1);
                    else
                        mx = max({ mx, v - l - 1, r - v - 1 });
                }
                if ((int)ms.size() == 2) {
                    ch = 0;
                    break;
                }
                int fl = *(ms.upper_bound(0));
                int fr = *(--ms.lower_bound(c + 1));
                dl = max(dl, fl - 1);
                dr = max(dr, c - fr);
            }
            if (ch) {
                mn = min(mn, 0ll + u + d + max(dl + dr, mx));
                //cout << u << ' ' << d << ' ' << dl << ' ' << dr << ' ' << mx << '\n';
            }
        }
    }
    cout << mn << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 468 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 11 ms 468 KB Output is correct
22 Correct 43 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 74 ms 348 KB Output is correct
25 Correct 53 ms 348 KB Output is correct
26 Correct 119 ms 468 KB Output is correct
27 Correct 121 ms 348 KB Output is correct
28 Correct 71 ms 512 KB Output is correct
29 Correct 112 ms 720 KB Output is correct
30 Correct 119 ms 348 KB Output is correct
31 Correct 123 ms 468 KB Output is correct
32 Correct 123 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 468 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 11 ms 468 KB Output is correct
22 Correct 43 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 74 ms 348 KB Output is correct
25 Correct 53 ms 348 KB Output is correct
26 Correct 119 ms 468 KB Output is correct
27 Correct 121 ms 348 KB Output is correct
28 Correct 71 ms 512 KB Output is correct
29 Correct 112 ms 720 KB Output is correct
30 Correct 119 ms 348 KB Output is correct
31 Correct 123 ms 468 KB Output is correct
32 Correct 123 ms 468 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 102 ms 484 KB Output is correct
35 Correct 131 ms 476 KB Output is correct
36 Correct 134 ms 348 KB Output is correct
37 Correct 106 ms 348 KB Output is correct
38 Correct 131 ms 472 KB Output is correct
39 Correct 129 ms 344 KB Output is correct
40 Correct 136 ms 348 KB Output is correct
41 Correct 97 ms 464 KB Output is correct
42 Correct 123 ms 592 KB Output is correct
43 Correct 134 ms 596 KB Output is correct
44 Correct 135 ms 468 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 456 KB Output is correct
2 Correct 938 ms 348 KB Output is correct
3 Correct 1014 ms 344 KB Output is correct
4 Correct 1140 ms 348 KB Output is correct
5 Correct 1180 ms 348 KB Output is correct
6 Correct 103 ms 448 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 844 ms 348 KB Output is correct
9 Correct 257 ms 348 KB Output is correct
10 Correct 1037 ms 488 KB Output is correct
11 Correct 1192 ms 492 KB Output is correct
12 Correct 1119 ms 492 KB Output is correct
13 Correct 62 ms 344 KB Output is correct
14 Correct 294 ms 348 KB Output is correct
15 Correct 13 ms 348 KB Output is correct
16 Correct 1211 ms 348 KB Output is correct
17 Incorrect 1089 ms 596 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 456 KB Output is correct
2 Correct 938 ms 348 KB Output is correct
3 Correct 1014 ms 344 KB Output is correct
4 Correct 1140 ms 348 KB Output is correct
5 Correct 1180 ms 348 KB Output is correct
6 Correct 103 ms 448 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 844 ms 348 KB Output is correct
9 Correct 257 ms 348 KB Output is correct
10 Correct 1037 ms 488 KB Output is correct
11 Correct 1192 ms 492 KB Output is correct
12 Correct 1119 ms 492 KB Output is correct
13 Correct 62 ms 344 KB Output is correct
14 Correct 294 ms 348 KB Output is correct
15 Correct 13 ms 348 KB Output is correct
16 Correct 1211 ms 348 KB Output is correct
17 Incorrect 1089 ms 596 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 9 ms 468 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 11 ms 468 KB Output is correct
22 Correct 43 ms 344 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 74 ms 348 KB Output is correct
25 Correct 53 ms 348 KB Output is correct
26 Correct 119 ms 468 KB Output is correct
27 Correct 121 ms 348 KB Output is correct
28 Correct 71 ms 512 KB Output is correct
29 Correct 112 ms 720 KB Output is correct
30 Correct 119 ms 348 KB Output is correct
31 Correct 123 ms 468 KB Output is correct
32 Correct 123 ms 468 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 102 ms 484 KB Output is correct
35 Correct 131 ms 476 KB Output is correct
36 Correct 134 ms 348 KB Output is correct
37 Correct 106 ms 348 KB Output is correct
38 Correct 131 ms 472 KB Output is correct
39 Correct 129 ms 344 KB Output is correct
40 Correct 136 ms 348 KB Output is correct
41 Correct 97 ms 464 KB Output is correct
42 Correct 123 ms 592 KB Output is correct
43 Correct 134 ms 596 KB Output is correct
44 Correct 135 ms 468 KB Output is correct
45 Correct 128 ms 456 KB Output is correct
46 Correct 938 ms 348 KB Output is correct
47 Correct 1014 ms 344 KB Output is correct
48 Correct 1140 ms 348 KB Output is correct
49 Correct 1180 ms 348 KB Output is correct
50 Correct 103 ms 448 KB Output is correct
51 Correct 3 ms 348 KB Output is correct
52 Correct 844 ms 348 KB Output is correct
53 Correct 257 ms 348 KB Output is correct
54 Correct 1037 ms 488 KB Output is correct
55 Correct 1192 ms 492 KB Output is correct
56 Correct 1119 ms 492 KB Output is correct
57 Correct 62 ms 344 KB Output is correct
58 Correct 294 ms 348 KB Output is correct
59 Correct 13 ms 348 KB Output is correct
60 Correct 1211 ms 348 KB Output is correct
61 Incorrect 1089 ms 596 KB Output isn't correct
62 Halted 0 ms 0 KB -