oj.uz

답안 #414156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
414156 2021-05-30T07:12:55 Z 600Mihnea Cultivation (JOI17_cultivation) C++17
30 / 100
 570 ms 740 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll

ll max(ll a, signed b) {
  if (a > b) return a;
  return b;
}


const int N = 300 + 7;
const int INF = (int) 1e18 + 7;

int dimx, dimy, n;

struct point {
  int x;
  int y;
};

point v[N];
vector<int> cover[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  ///freopen ("input", "r", stdin);

  cin >> dimx >> dimy >> n;

  for (int i = 1; i <= n; i++) {
    cin >> v[i].x >> v[i].y;
  }

  assert(dimx <= 40);

  int sol = INF;

  for (int a = 0; a <= dimx; a++) {
    for (int b = 0; b <= dimx; b++) { /// fix north, south

      for (int i = 1; i <= dimx; i++) {
        cover[i].clear();
      }
      for (int i = 1; i <= n; i++) {
        int l = max(1, v[i].x - a), r = min(dimx, v[i].x + b);
        for (int j = l; j <= r; j++) {
          cover[j].push_back(i);
        }
      }

      bool ok = 1;
      for (int i = 1; i <= dimx; i++) {
        if (cover[i].empty()) {
          ok = 0;
          break;
        }
      }

      if (!ok) {
        continue;
      }

      /// now it's a pretty easy task

      /// For each row I have some restrictions
      int r1 = 0, r2 = 0, rsum = 0;

      for (int i = 1; i <= dimx; i++) {
        vector<int> pts;
        for (auto &j : cover[i]) {
          pts.push_back(v[j].y);
        }

        sort(pts.begin(), pts.end());

        r1 = max(r1, pts[0] - 1);
        r2 = max(r2, dimy - pts.back());

        for (int j = 1; j < (int) pts.size(); j++) {
          rsum = max(rsum, pts[j] - pts[j - 1] - 1);
        }
      }
      rsum = max(rsum, r1 + r2);
      sol = min(sol, a + b + rsum);
    }
  }

  cout << sol << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 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 332 KB Output is correct
13 Correct 1 ms 220 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 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 332 KB Output is correct
13 Correct 1 ms 220 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 19 ms 352 KB Output is correct
19 Correct 20 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 57 ms 332 KB Output is correct
22 Correct 184 ms 372 KB Output is correct
23 Correct 22 ms 332 KB Output is correct
24 Correct 293 ms 420 KB Output is correct
25 Correct 211 ms 596 KB Output is correct
26 Correct 481 ms 448 KB Output is correct
27 Correct 505 ms 580 KB Output is correct
28 Correct 277 ms 324 KB Output is correct
29 Correct 410 ms 564 KB Output is correct
30 Correct 490 ms 424 KB Output is correct
31 Correct 570 ms 452 KB Output is correct
32 Correct 508 ms 588 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 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 332 KB Output is correct
13 Correct 1 ms 220 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 19 ms 352 KB Output is correct
19 Correct 20 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 57 ms 332 KB Output is correct
22 Correct 184 ms 372 KB Output is correct
23 Correct 22 ms 332 KB Output is correct
24 Correct 293 ms 420 KB Output is correct
25 Correct 211 ms 596 KB Output is correct
26 Correct 481 ms 448 KB Output is correct
27 Correct 505 ms 580 KB Output is correct
28 Correct 277 ms 324 KB Output is correct
29 Correct 410 ms 564 KB Output is correct
30 Correct 490 ms 424 KB Output is correct
31 Correct 570 ms 452 KB Output is correct
32 Correct 508 ms 588 KB Output is correct
33 Correct 2 ms 352 KB Output is correct
34 Correct 512 ms 440 KB Output is correct
35 Correct 506 ms 516 KB Output is correct
36 Correct 552 ms 608 KB Output is correct
37 Correct 341 ms 504 KB Output is correct
38 Correct 530 ms 636 KB Output is correct
39 Correct 493 ms 740 KB Output is correct
40 Correct 554 ms 512 KB Output is correct
41 Correct 377 ms 416 KB Output is correct
42 Correct 379 ms 436 KB Output is correct
43 Correct 454 ms 716 KB Output is correct
44 Correct 534 ms 568 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 324 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 332 KB Output is correct
13 Correct 1 ms 220 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 3 ms 332 KB Output is correct
18 Correct 19 ms 352 KB Output is correct
19 Correct 20 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 57 ms 332 KB Output is correct
22 Correct 184 ms 372 KB Output is correct
23 Correct 22 ms 332 KB Output is correct
24 Correct 293 ms 420 KB Output is correct
25 Correct 211 ms 596 KB Output is correct
26 Correct 481 ms 448 KB Output is correct
27 Correct 505 ms 580 KB Output is correct
28 Correct 277 ms 324 KB Output is correct
29 Correct 410 ms 564 KB Output is correct
30 Correct 490 ms 424 KB Output is correct
31 Correct 570 ms 452 KB Output is correct
32 Correct 508 ms 588 KB Output is correct
33 Correct 2 ms 352 KB Output is correct
34 Correct 512 ms 440 KB Output is correct
35 Correct 506 ms 516 KB Output is correct
36 Correct 552 ms 608 KB Output is correct
37 Correct 341 ms 504 KB Output is correct
38 Correct 530 ms 636 KB Output is correct
39 Correct 493 ms 740 KB Output is correct
40 Correct 554 ms 512 KB Output is correct
41 Correct 377 ms 416 KB Output is correct
42 Correct 379 ms 436 KB Output is correct
43 Correct 454 ms 716 KB Output is correct
44 Correct 534 ms 568 KB Output is correct
45 Runtime error 2 ms 460 KB Execution killed with signal 6
46 Halted 0 ms 0 KB -