zcmimi's blog
avatar
zc
2019-12-21 19:47:00
  • 本文总阅读量
查看原题

点击跳转

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define rg register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i=x;i<=y;i++)
    #define Fdr(i,x,y) for(int i=x;i>=y;i--)
    #define fl(i,x) for(int i=head[x],to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) (int(log2(n)))
    #define inf 0x3f3f3f3f
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const char* ln="\n";const int str=1<<20;struct IN{char buf[str],*s,*t;bool _;IN():s(buf),t(buf),_(0){}il char gc(){return s==t&&((t=(s=buf)+fread(buf,1,str,stdin))==s)?EOF:(*s++);}IN&operator>>(char&ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)_=1;else ch=c;return *this;}IN& operator>>(char* ch){clr(ch,0);if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)_=1;return *this;}IN& operator>>(string& ch){if(_)return *this;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)return _=1,*this;ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)_=1;return *this;}template<typename T>IN&operator>>(T&x){if(_)return *this;char c=gc();bool ff=0;while(c!=EOF&&(c<'0'||c>'9'))ff^=(c=='-'),c=gc();if(c==EOF){_=1;return *this;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=(x<<3)+(x<<1)+c-48,c=gc();if(c==EOF)_=1;if(ff)x=-x;return *this;}}in;struct OUT{char buf[str],*s,*t;OUT():s(buf),t(buf+str){}~OUT(){fwrite(buf,1,s-buf,stdout);}void pt(char c){(s==t)?(fwrite(s=buf,1,str,stdout),*s++=c):(*s++=c);}OUT&operator<<(const char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(char*s){while(*s)pt(*s++);return *this;}OUT&operator<<(string s){for(int i=0;s[i];i++)pt(s[i]);return *this;}template<typename T>OUT&operator<<(T x){if(!x)return pt('0'),*this;if(x<0)pt('-'),x=-x;char a[30],t=0;while(x)a[t++]=x%10,x/=10;while(t--)pt(a[t]+'0');return *this;}}out;}using namespace IO;
#define N 1002
int n,s[N][N],b[N][N],ans=0,as=0;
struct node{
    int x,y;
}a[N];
int main(){
    fin("in");
    in>>n;
    int x,y,X,Y,tot=0;char ch;
    Fur(i,1,n){
        in>>x>>y>>ch;
        if(ch=='H')s[x][y]=1,++tot,a[tot].x=x,a[tot].y=y;
        else b[x][y]=1;
    }
    Fur(i,1,1000)
        s[0][i]+=s[0][i-1],
        s[i][0]+=s[i-1][0],
        b[0][i]+=b[0][i-1],
        b[i][0]+=b[i-1][0];

    Fur(i,1,1001)
        Fur(j,1,1001)
        s[i][j]+=s[i-1][j]+s[i][j-1]-s[i-1][j-1],
        b[i][j]+=b[i-1][j]+b[i][j-1]-b[i-1][j-1];

    Fur(i,1,tot)
        Fur(j,1,tot)
            Fur(k,1,tot)
                Fur(w,1,tot){
                    x=MIN(MIN(a[i].x,a[j].x),MIN(a[k].x,a[w].x));
                    y=MIN(MIN(a[i].y,a[j].y),MIN(a[k].y,a[w].y));
                    X=MAX(MAX(a[i].x,a[j].x),MIN(a[k].x,a[w].x));
                    Y=MAX(MAX(a[i].y,a[j].y),MIN(a[k].y,a[w].y));
                    if(b[X][Y]-b[X][y-1]-b[x-1][Y]+b[x-1][y-1])continue;
                    int t=s[X][Y]-s[X][y-1]-s[x-1][Y]+s[x-1][y-1],tt=(X-x)*(Y-y);
                    if(t>as)ans=tt,as=t;
                    else if(t==as)ans=MIN(ans,tt);
            }
    out<<as<<ln<<ans<<ln;
}
LG 3117 [USACO15JAN]牛的矩形Cow Rectangles
comment评论
Search
search