Submission #1369230

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000
#define W 10

int main(){
  int n;
  cin>>n;
  vector<int> x(n),y(n);
  vector<vector<int>> cnt(W, vector<int>(W,0));
  vector<vector<bool>> exist(W,vector<bool>(W,false));

  rep(i,n){
    cin>>x[i]>>y[i];
    exist[x[i]][y[i]] = true;
    cnt[x[i]][y[i]] += 1;
  }
  repl(i,1,W)rep(j,W) cnt[i][j] += cnt[i-1][j];
  rep(i,W)repl(j,1,W) cnt[i][j] += cnt[i][j-1];

  int ans = 0;
  rep(i,n)rep(j,i) if(x[i]!=x[j] && y[i]!=y[j] && exist[x[i]][y[j]] && exist[x[j]][y[i]]){
    int maxx = max(x[i],x[j]), minx = min(x[i],x[j]);
    int maxy = max(y[i],y[j]), miny = min(y[i],y[j]);
    if(cnt[maxx-1][maxy-1] - cnt[maxx-1][miny] - cnt[minx][maxy-1] + cnt[minx][miny] == 0) ans = max(ans, (maxx-minx)*(maxy-miny));
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result