oj.uz

답안 #961217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961217 2024-04-11T17:45:26 Z danikoynov Cultivation (JOI17_cultivation) C++14
30 / 100
 1158 ms 612 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];
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);

    for (ll dw : set_x)
    {
        unordered_set < ll > set_up;
        for (ll i = 1; i <= n; i ++)
            set_up.insert(r - x[i]);

        /**for (ll i = 1; i <= n; i ++)
            for (ll j = 1; j <= n; j ++)
        {
            if (x[i] >= x[j] - dw)
                continue;
            set_up.insert(x[j] - x[i] - dw - 1);
        }*/
        /**for (ll up : set_up)
            cout << up << " ";
        cout << endl;*/
        for (ll up : set_up)
        {
            ll atl_lf = 0, atl_rf = 0, atl_sum = 0;
            unordered_set < ll > rel;
            for (ll i = 1; i <= n; i ++)
            {
                rel.insert(x[i]);
                rel.insert(max((ll)1, x[i] - dw - 1));
                rel.insert(min(r, x[i] + up + 1));
            }
            for (ll i : rel)
            {
                set < ll > pos;
                for (ll j = 1; j <= n; j ++)
                {
                    if (i < x[j])
                    {
                        if (x[j] - dw <= i)
                            pos.insert(y[j]);
                    }
                    else
                    {
                        if (x[j] + up >= i)
                            pos.insert(y[j]);
                    }
                }
                if (pos.empty())
                {
                    atl_sum = 4e9;
                    break;
                }
                atl_lf = max(atl_lf, *pos.begin() - 1);
                atl_rf = max(atl_rf, c - *pos.rbegin());

                for (set < ll > :: iterator it = pos.begin(); next(it) != pos.end(); it ++)
                {

                    atl_sum = max(atl_sum, *next(it) - *it - 1);
                }


            }
            //cout << "data " << up << " " << dw << " " << atl_lf << " " << atl_rf << " " << atl_sum << endl;

            res = min(res, up + dw + max(atl_sum, atl_lf + atl_rf));
        }
    }
    cout << res << endl;
}
int main()
{
    solve();
    return 0;
}
/**
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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 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 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 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 1 ms 436 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 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 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 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 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 1 ms 436 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 344 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 22 ms 420 KB Output is correct
19 Correct 8 ms 608 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 348 KB Output is correct
22 Correct 173 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 319 ms 600 KB Output is correct
25 Correct 244 ms 428 KB Output is correct
26 Correct 464 ms 428 KB Output is correct
27 Correct 483 ms 596 KB Output is correct
28 Correct 298 ms 432 KB Output is correct
29 Correct 397 ms 428 KB Output is correct
30 Correct 500 ms 432 KB Output is correct
31 Correct 479 ms 348 KB Output is correct
32 Correct 497 ms 428 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 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 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 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 1 ms 436 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 344 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 22 ms 420 KB Output is correct
19 Correct 8 ms 608 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 348 KB Output is correct
22 Correct 173 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 319 ms 600 KB Output is correct
25 Correct 244 ms 428 KB Output is correct
26 Correct 464 ms 428 KB Output is correct
27 Correct 483 ms 596 KB Output is correct
28 Correct 298 ms 432 KB Output is correct
29 Correct 397 ms 428 KB Output is correct
30 Correct 500 ms 432 KB Output is correct
31 Correct 479 ms 348 KB Output is correct
32 Correct 497 ms 428 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1074 ms 600 KB Output is correct
35 Correct 981 ms 440 KB Output is correct
36 Correct 1135 ms 440 KB Output is correct
37 Correct 777 ms 444 KB Output is correct
38 Correct 1158 ms 440 KB Output is correct
39 Correct 1110 ms 440 KB Output is correct
40 Correct 1139 ms 444 KB Output is correct
41 Correct 174 ms 444 KB Output is correct
42 Correct 616 ms 460 KB Output is correct
43 Correct 1102 ms 444 KB Output is correct
44 Correct 948 ms 428 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 448 KB Output is correct
2 Correct 23 ms 448 KB Output is correct
3 Correct 28 ms 440 KB Output is correct
4 Correct 30 ms 436 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Incorrect 19 ms 612 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 448 KB Output is correct
2 Correct 23 ms 448 KB Output is correct
3 Correct 28 ms 440 KB Output is correct
4 Correct 30 ms 436 KB Output is correct
5 Correct 29 ms 348 KB Output is correct
6 Incorrect 19 ms 612 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 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 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 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 1 ms 436 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 344 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 22 ms 420 KB Output is correct
19 Correct 8 ms 608 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 45 ms 348 KB Output is correct
22 Correct 173 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 319 ms 600 KB Output is correct
25 Correct 244 ms 428 KB Output is correct
26 Correct 464 ms 428 KB Output is correct
27 Correct 483 ms 596 KB Output is correct
28 Correct 298 ms 432 KB Output is correct
29 Correct 397 ms 428 KB Output is correct
30 Correct 500 ms 432 KB Output is correct
31 Correct 479 ms 348 KB Output is correct
32 Correct 497 ms 428 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1074 ms 600 KB Output is correct
35 Correct 981 ms 440 KB Output is correct
36 Correct 1135 ms 440 KB Output is correct
37 Correct 777 ms 444 KB Output is correct
38 Correct 1158 ms 440 KB Output is correct
39 Correct 1110 ms 440 KB Output is correct
40 Correct 1139 ms 444 KB Output is correct
41 Correct 174 ms 444 KB Output is correct
42 Correct 616 ms 460 KB Output is correct
43 Correct 1102 ms 444 KB Output is correct
44 Correct 948 ms 428 KB Output is correct
45 Correct 8 ms 448 KB Output is correct
46 Correct 23 ms 448 KB Output is correct
47 Correct 28 ms 440 KB Output is correct
48 Correct 30 ms 436 KB Output is correct
49 Correct 29 ms 348 KB Output is correct
50 Incorrect 19 ms 612 KB Output isn't correct
51 Halted 0 ms 0 KB -