oj.uz

Submission #960935

# Submission time Handle Problem Language Result Execution time Memory
960935 2024-04-11T09:12:38 Z danikoynov Cultivation (JOI17_cultivation) C++14
15 / 100
 147 ms 856 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

const int maxn = 310, maxc = 42;

int n, r, c;
int used[4 * maxc][4 * maxc];
int x[maxn], y[maxn];

void solve()
{
    cin >> r >> c;
    cin >> n;
    for (int i = 1; i <= n; i ++)
        cin >> x[i] >> y[i];
        set < int > set_x, set_y;
        for (int i = 1; i <= n; i ++)
        {
             set_x.insert(x[i]);
             set_y.insert(y[i]);
        }
    int ans = r + c - 2;
    for (int h = 1; h <= r * 2; h ++)
        for (int w = 1; w <= c * 2; w ++)
        {
            for (int i = 0; i < 4 * maxc; i ++)
                for (int j = 0; j < 4 * maxc; j ++)
                    used[i][j] = 0;

            for (int i = 1; i <= n; i ++)
            {

                for (int dx = x[i]; dx < x[i] + h; dx ++)
                    for (int dy = y[i]; dy < y[i] + w; dy ++)
                    {
                        ///assert(dx < 2 * maxc && dy < 2 * maxc);
                        used[dx][dy] = 1;
                    }
            }

            bool done = false;
            for (int sx : set_x)
               for (int sy : set_y)
                {

                    bool tf = true;

                    for (int i = sx; i < sx + r && tf; i ++)
                        for (int j = sy; j < sy + c; j ++)
                        {
                            ///assert(i < 2 * maxc && j <2 * maxc);
                            if (used[i][j] == 0)
                            {
                                //if (h == 25 && w == 29)
                                //cout << sx << " : " << sy << " " << i << " " << j << endl;
                                tf = false;
                                break;
                            }
                        }

                    if (tf)
                    {
                        done = true;
                        break;
                    }
                }

            /*if (h == 3 && w == 2)
            {
                 for (int i = 1; i <= 8; i ++, cout << endl)
                     for (int j = 1; j <= 8; j ++)
                     cout << used[i][j] << " ";
            }*/
            /**cout <<"------------------------------" << endl;
            if (h == 2)
                exit(0);
            for (int i = 0; i < 2 * r; i ++, cout << endl)
                     for (int j = 0; j < 2 * c; j ++)
                     cout << used[i][j] << " ";*/
            if (done)
            {


                ///cout << h << " : " << w << endl;

                //exit(0);
                ans = min(ans, h + w - 2);
                break;
            }
        }
    cout << ans << endl;
}
int main()
{
    solve();
    return 0;
}
/**
40 30
50
19 20
18 16
34 28
5 8
28 21
24 13
7 1
28 23
28 18
12 6
3 6
18 8
40 27
22 19
23 22
8 6
9 12
16 10
27 25
26 19
4 9
40 26
21 22
10 8
5 2
30 25
12 12
3 1
24 14
5 3
4 8
19 9
21 16
6 3
38 29
27 20
37 25
36 24
22 20
29 26
30 19
16 14
3 3
39 25
5 7
20 15
13 12
33 30
27 16
25 14

*/

Compilation message

cultivation.cpp: In function 'void solve()':
cultivation.cpp:17:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   17 |     for (int i = 1; i <= n; i ++)
      |     ^~~
cultivation.cpp:19:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   19 |         set < int > set_x, set_y;
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 540 KB Output is correct
6 Correct 1 ms 508 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 1 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 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 540 KB Output is correct
6 Correct 1 ms 508 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 1 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 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 25 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 76 ms 344 KB Output is correct
22 Correct 30 ms 344 KB Output is correct
23 Correct 147 ms 348 KB Output is correct
24 Correct 20 ms 344 KB Output is correct
25 Correct 29 ms 348 KB Output is correct
26 Correct 38 ms 348 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 39 ms 344 KB Output is correct
29 Correct 9 ms 348 KB Output is correct
30 Correct 17 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 14 ms 348 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 540 KB Output is correct
6 Correct 1 ms 508 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 1 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 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 25 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 76 ms 344 KB Output is correct
22 Correct 30 ms 344 KB Output is correct
23 Correct 147 ms 348 KB Output is correct
24 Correct 20 ms 344 KB Output is correct
25 Correct 29 ms 348 KB Output is correct
26 Correct 38 ms 348 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 39 ms 344 KB Output is correct
29 Correct 9 ms 348 KB Output is correct
30 Correct 17 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 14 ms 348 KB Output is correct
33 Runtime error 1 ms 856 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 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 540 KB Output is correct
6 Correct 1 ms 508 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 1 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 344 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 25 ms 348 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 76 ms 344 KB Output is correct
22 Correct 30 ms 344 KB Output is correct
23 Correct 147 ms 348 KB Output is correct
24 Correct 20 ms 344 KB Output is correct
25 Correct 29 ms 348 KB Output is correct
26 Correct 38 ms 348 KB Output is correct
27 Correct 15 ms 348 KB Output is correct
28 Correct 39 ms 344 KB Output is correct
29 Correct 9 ms 348 KB Output is correct
30 Correct 17 ms 348 KB Output is correct
31 Correct 12 ms 348 KB Output is correct
32 Correct 14 ms 348 KB Output is correct
33 Runtime error 1 ms 856 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -