Submission #6929166

---

Source Code Expand

import java.awt.Rectangle;
import java.util.*;
import java.util.Objects;

/**
 * @author masayamatu
 * 
 */
public class Main {


  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int w = sc.nextInt();
    int h = sc.nextInt();
    int n = sc.nextInt();
    int[] X = new int[n];
    int[] Y = new int[n];
    int ans = 0;
    for(int i = 0; i < n; i++){
     X[i] = sc.nextInt()-1;
     Y[i] = sc.nextInt()-1;
    }
   
    
    ans = dfs(new Rectangle(w,h),n,X,Y); 
    System.out.println(ans);
  }
  public static int dfs(Rectangle rect,int n,int[] X, int[] Y) {
    Map<Rectangle,Integer> temp = new HashMap<>();
    if(temp.containsKey(rect)) return temp.get(rect);
    int max = 0;
    for(int i = 0; i < n; i++) {
      int x = X[i];
      int y = Y[i];
      if(!rect.contains(x,y)) continue;
      
      int u = y - rect.y;
      int d = (rect.y+rect.height-1)-y;
      int l = x - rect.x;
      int r = (rect.x+rect.width-1)-x;
      int gold = u+d+l+r+1;
      
      if(u > 0 && l > 0) {
        gold += dfs(new Rectangle(rect.x,rect.y,l,u),n,X,Y);
      }
      if(u > 0 && r > 0) {
        gold += dfs(new Rectangle(x+1,rect.y,r,u),n,X,Y);
      }
      if(d > 0 && l > 0) {
        gold += dfs(new Rectangle(rect.x,y+1,l,d),n,X,Y);
      }
      if(d > 0 && r > 0) {
        gold += dfs(new Rectangle(x+1,y+1,r,d),n,X,Y);
      }
      max = Math.max(gold,max);
    }
    temp.put(rect,max);
    return max;
  }
}

Submission Info

Judge Result