oj.uz

답안 #961228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961228 2024-04-11T18:07:47 Z danikoynov Cultivation (JOI17_cultivation) C++14
60 / 100
 2000 ms 876 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

const ll maxn = 310;

ll n, r, c;
ll x[maxn], y[maxn];

ll used[maxn];

struct data
{

    ll atl_lf = 0, atl_rf = 0, atl_sum = 0;
    data(ll _atl_lf = 0, ll _atl_rf = 0, ll _atl_sum = 0)
    {
        atl_lf = _atl_lf;
        atl_rf = _atl_rf;
        atl_sum = _atl_sum;
    }
};
void solve()
{
    cin >> r >> c;
    cin >> n;
    for (ll i = 1; i <= n; i ++)
        cin >> x[i] >> y[i];


    ll res = r + c - 2;
    set < ll > set_x;
    for (ll i = 1; i <= n; i ++)
        set_x.insert(x[i] - 1);

    set < ll > pos_sum;
    for (ll dw : set_x)
    {
        for (int i = 1; i <= n; i ++)
            pos_sum.insert(r - x[i] + dw);
    }

    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= n; j ++)
            if (x[i] < x[j])
                pos_sum.insert(x[j] - x[i] - 1);


    for (ll up : pos_sum)
    {


        set < ll > rel;
        for (ll i = 1; i <= n; i ++)
        {
            rel.insert(x[i]);
            rel.insert(x[i] + up + 1);
        }
        unordered_map < ll, data > tk;

        for (ll i : rel)
        {
            set < ll > pos;
            for (ll j = 1; j <= n; j ++)
            {
                if (x[j] <= i && x[j] + up >= i)
                    pos.insert(y[j]);
            }

            if (pos.empty())
            {

                tk[i] = data(4e9, 4e9, 4e9);
                break;
            }
            ll atl_lf = *pos.begin() - 1;
            ll atl_rf =  c - *pos.rbegin();
            ll atl_sum = 0;
            for (set < ll > :: iterator it = pos.begin(); next(it) != pos.end(); it ++)
            {

                atl_sum = max(atl_sum, *next(it) - *it - 1);
            }
            tk[i] = data(atl_lf, atl_rf, atl_sum);
        }
        /**cout << "up " << up << " so far " << res << endl;
        for (int i : rel)
        {
            cout << i << " " << tk[i].atl_lf << " " << tk[i].atl_rf << " " << tk[i].atl_sum << endl;
        }*/
///        cout << "data " << up << " " << dw << " " << atl_lf << " " << atl_rf << " " << atl_sum << endl;

        vector < ll > p;
        for (ll cur : rel)
            p.push_back(cur);
        int sz = p.size();
        for (int i = 0; i < sz; i ++)
        {
            if (tk[p[i]].atl_lf == 4e9)
                continue;
            ll atl_lf = 0, atl_rf = 0, atl_sum = 0;
            bool el = false;
            for (int j = i; j < sz; j ++)
            {
                if (p[j] >= p[i] + r)
                {
                    el = true;
                    break;
                }
                atl_lf = max(atl_lf, tk[p[j]].atl_lf);
                atl_rf = max(atl_rf, tk[p[j]].atl_rf);
                atl_sum = max(atl_sum, tk[p[j]].atl_sum);
                if (p[j] == p[i] + r - 1)
                {
                    el = true;
                    break;
                }
            }
            if (!el)
                break;
            res = min(res, up + max(atl_lf + atl_rf, atl_sum));
        }
        ///res = min(res, up + dw + max(atl_sum, atl_lf + atl_rf));

    }

    cout << res << endl;
}
int main()
{
    solve();
    return 0;
}
/**
4 3
3
2 1
2 3
4 1

1000000000 1000000000
25
496770868 499466029
150245306 140351260
443861207 442170127
915815913 907024280
592352731 580300173
614771420 602707761
545759771 564678204
790963611 795646738
466306333 474998682
700037062 710428701
326403486 341417980
13108429 18468915
296795338 282907012
207909366 219254859
617032761 616107308
248155618 254253131
284599784 288724312
68437874 69050438
36863359 47496556
343816887 338965809
560430677 554034425
327115091 319475338
290706522 308826179
799518444 796166899
438981788 441006320



1000000000 1000000000
25
496770868 499466029
150245306 140351260
443861207 442170127
915815913 907024280
592352731 580300173
614771420 602707761
545759771 564678204
790963611 795646738
466306333 474998682
700037062 710428701
326403486 341417980
13108429 18468915
296795338 282907012
207909366 219254859
617032761 616107308
248155618 254253131
284599784 288724312
68437874 69050438
36863359 47496556
343816887 338965809
560430677 554034425
327115091 319475338
290706522 308826179
799518444 796166899
438981788 441006320

1000000000 1000000000
17
822413671 70423910
260075513 431043546
300945721 793553248
142848049 163787897
392462410 831950868
699005697 111397300
444396260 130450496
642691616 595456084
467968916 463598810
159764248 611476406
929313754 539645102
365153650 964108073
906780716 373514044
970118116 655138295
257280896 236115217
909808245 942097331
523555293 969550238


*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 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 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 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 1 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 4 ms 348 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 15 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 19 ms 432 KB Output is correct
26 Correct 34 ms 352 KB Output is correct
27 Correct 34 ms 348 KB Output is correct
28 Correct 22 ms 352 KB Output is correct
29 Correct 29 ms 348 KB Output is correct
30 Correct 36 ms 440 KB Output is correct
31 Correct 32 ms 348 KB Output is correct
32 Correct 33 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 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 1 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 4 ms 348 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 15 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 19 ms 432 KB Output is correct
26 Correct 34 ms 352 KB Output is correct
27 Correct 34 ms 348 KB Output is correct
28 Correct 22 ms 352 KB Output is correct
29 Correct 29 ms 348 KB Output is correct
30 Correct 36 ms 440 KB Output is correct
31 Correct 32 ms 348 KB Output is correct
32 Correct 33 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 60 ms 348 KB Output is correct
35 Correct 64 ms 440 KB Output is correct
36 Correct 66 ms 448 KB Output is correct
37 Correct 52 ms 348 KB Output is correct
38 Correct 68 ms 344 KB Output is correct
39 Correct 67 ms 448 KB Output is correct
40 Correct 66 ms 348 KB Output is correct
41 Correct 29 ms 444 KB Output is correct
42 Correct 47 ms 344 KB Output is correct
43 Correct 64 ms 348 KB Output is correct
44 Correct 57 ms 344 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 38 ms 492 KB Output is correct
3 Correct 40 ms 348 KB Output is correct
4 Correct 43 ms 348 KB Output is correct
5 Correct 42 ms 344 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 38 ms 348 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 40 ms 348 KB Output is correct
11 Correct 43 ms 464 KB Output is correct
12 Correct 45 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 13 ms 472 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 41 ms 344 KB Output is correct
17 Correct 42 ms 348 KB Output is correct
18 Correct 17 ms 344 KB Output is correct
19 Correct 41 ms 348 KB Output is correct
20 Correct 43 ms 468 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 38 ms 492 KB Output is correct
3 Correct 40 ms 348 KB Output is correct
4 Correct 43 ms 348 KB Output is correct
5 Correct 42 ms 344 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 38 ms 348 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 40 ms 348 KB Output is correct
11 Correct 43 ms 464 KB Output is correct
12 Correct 45 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 13 ms 472 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 41 ms 344 KB Output is correct
17 Correct 42 ms 348 KB Output is correct
18 Correct 17 ms 344 KB Output is correct
19 Correct 41 ms 348 KB Output is correct
20 Correct 43 ms 468 KB Output is correct
21 Execution timed out 2062 ms 876 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 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 1 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 4 ms 348 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 15 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 24 ms 348 KB Output is correct
25 Correct 19 ms 432 KB Output is correct
26 Correct 34 ms 352 KB Output is correct
27 Correct 34 ms 348 KB Output is correct
28 Correct 22 ms 352 KB Output is correct
29 Correct 29 ms 348 KB Output is correct
30 Correct 36 ms 440 KB Output is correct
31 Correct 32 ms 348 KB Output is correct
32 Correct 33 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 60 ms 348 KB Output is correct
35 Correct 64 ms 440 KB Output is correct
36 Correct 66 ms 448 KB Output is correct
37 Correct 52 ms 348 KB Output is correct
38 Correct 68 ms 344 KB Output is correct
39 Correct 67 ms 448 KB Output is correct
40 Correct 66 ms 348 KB Output is correct
41 Correct 29 ms 444 KB Output is correct
42 Correct 47 ms 344 KB Output is correct
43 Correct 64 ms 348 KB Output is correct
44 Correct 57 ms 344 KB Output is correct
45 Correct 9 ms 344 KB Output is correct
46 Correct 38 ms 492 KB Output is correct
47 Correct 40 ms 348 KB Output is correct
48 Correct 43 ms 348 KB Output is correct
49 Correct 42 ms 344 KB Output is correct
50 Correct 13 ms 348 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 38 ms 348 KB Output is correct
53 Correct 17 ms 344 KB Output is correct
54 Correct 40 ms 348 KB Output is correct
55 Correct 43 ms 464 KB Output is correct
56 Correct 45 ms 348 KB Output is correct
57 Correct 4 ms 344 KB Output is correct
58 Correct 13 ms 472 KB Output is correct
59 Correct 7 ms 348 KB Output is correct
60 Correct 41 ms 344 KB Output is correct
61 Correct 42 ms 348 KB Output is correct
62 Correct 17 ms 344 KB Output is correct
63 Correct 41 ms 348 KB Output is correct
64 Correct 43 ms 468 KB Output is correct
65 Execution timed out 2062 ms 876 KB Time limit exceeded
66 Halted 0 ms 0 KB -