oj.uz

Submission #292663

# Submission time Handle Problem Language Result Execution time Memory
292663 2020-09-07T11:32:44 Z BThero Cultivation (JOI17_cultivation) C++17
5 / 100
 64 ms 1920 KB 
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

pii arr[305];
int pref[305][305];
int cnt[305][305];
int R, C, n;

void solve() {
  scanf("%d %d", &R, &C);
  scanf("%d", &n);
  
  for (int i = 1; i <= n; ++i) {
    int x, y;
    scanf("%d %d", &x, &y);
    arr[i] = mp(x, y);
  }
  
  int ans = R + C;
  
  for (int dx = 0; dx <= R - 1; ++dx) {
    for (int dy = 0; dy <= C - 1; ++dy) {
      for (int i = 1; i <= 2 * R; ++i) {
        for (int j = 1; j <= 2 * C; ++j) {
          cnt[i][j] = 0;
        }
      }
    
      for (int i = 1; i <= n; ++i) {
        int x1 = arr[i].fi;
        int x2 = x1 + dx;
        int y1 = arr[i].se;
        int y2 = y1 + dy;
        
        ++cnt[x1][y1];
        --cnt[x2 + 1][y1];
        --cnt[x1][y2 + 1];
        ++cnt[x2 + 1][y2 + 1];
      }
      
      for (int i = 1; i <= 2 * R; ++i) {
        for (int j = 1; j <= 2 * C; ++j) {
          cnt[i][j] += cnt[i - 1][j];
          cnt[i][j] += cnt[i][j - 1];
          cnt[i][j] -= cnt[i - 1][j - 1];
        }
      }
      
      for (int i = 1; i <= 2 * R; ++i) {
        for (int j = 1; j <= 2 * C; ++j) {
          pref[i][j] = !!cnt[i][j] + pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
        }
      }
      
      for (int x1 = 1; x1 <= R; ++x1) {
        for (int y1 = 1; y1 <= C; ++y1) {
          int x2 = x1 + R - 1;
          int y2 = y1 + C - 1;
          int tot = pref[x2][y2];
          tot -= pref[x1 - 1][y2];
          tot -= pref[x2][y1 - 1];
          tot += pref[x1 - 1][y1 - 1];
          
          if (tot == R * C) {
            ans = min(ans, dx + dy);
          }
        }
      }
    }
  }
  
  printf("%d\n", ans);
}

int main() {
  int tt = 1;
  
  while (tt--) {
    solve();
  }

  return 0;
}

Compilation message

cultivation.cpp: In function 'void solve()':
cultivation.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   scanf("%d %d", &R, &C);
      |   ~~~~~^~~~~~~~~~~~~~~~~
cultivation.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
cultivation.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |     scanf("%d %d", &x, &y);
      |     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 13 ms 504 KB Output is correct
19 Correct 64 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Incorrect 53 ms 568 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 13 ms 504 KB Output is correct
19 Correct 64 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Incorrect 53 ms 568 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1920 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 2 ms 1920 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 13 ms 504 KB Output is correct
19 Correct 64 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Incorrect 53 ms 568 KB Output isn't correct
22 Halted 0 ms 0 KB -