結果

問題 No.5002 stick xor
ユーザー ts_ts_
提出日時 2018-05-27 00:24:03
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 927 ms / 1,000 ms
コード長 5,432 bytes
コンパイル時間 32,804 ms
実行使用メモリ 1,660 KB
スコア 42,857
最終ジャッジ日時 2018-05-27 00:24:54
ジャッジサーバーID
（参考情報） 		judge6 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

unsigned long xor128(){
    static unsigned long x=123456789,y=362436069,z=521288629,w=88675123;
    unsigned long t=(x^(x<<11));
    x=y;y=z;z=w;
    return (w=(w^(w>>19))^(t^(t>>8)));
}
double timeLimit=0.85;
const int64_t CYCLES_PER_SEC=2800000000;
struct Timer {
	int64_t start;
	Timer() { reset(); }
	void reset() { start = getCycle(); }
	void plus(double a) { start -= (a * CYCLES_PER_SEC); }
	inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
	inline int64_t getCycle() {
		uint32_t low, high;
		__asm__ volatile ("rdtsc" : "=a" (low), "=d" (high));
		return ((int64_t)low) | ((int64_t)high << 32);
	}
};
const int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int n,k,W0;
int L[501];
string s[61];
bool g[61][61],tg[61][61];
vector<pair<pint,pint> > cand(7201);
vector<pair<pint,pint> > ans,tmp;
pair<pint,pint> calc(int length,int num){
    pair<pint,pint> ret;
    bool flag=true;
    pint best={-1000100010,0};
    int lx,rx,ly,ry;
    rep(i,n)rep(j,n-length+1)if(g[i][j]|g[i][j+length-1]){
        pint score={0,0};
        int slide=1;
        while(j-slide>=0&&g[i][j-slide]!=g[i][j]&&slide<2) ++score.second,++slide;
        slide=length;
        while(j+slide<n&&g[i][j+slide]!=g[i][j+length-1]&&slide<2+length) ++score.second,++slide;
        rep(k,length){
            if(flag){
                if(g[i][j+k]==1) ++score.first;
                else --score.first;
            }
            if(k>0&&g[i][j+k-1]==g[i][j+k]) ++score.second;
            slide=1;
            while(i-slide>=0&&g[i][j+k]!=g[i-slide][j+k]&&slide<3) ++score.second,++slide;
            slide=1;
            while(i+slide<n&&g[i][j+k]!=g[i+slide][j+k]&&slide<3) ++score.second,++slide;
        }
        if(best<score){
            ret=make_pair(pint(i+1,j+1),pint(i+1,j+length));
            best=score;
        }
    }
    
    rep(i,n)rep(j,n-length+1)if(g[j][i]|g[j+length-1][i]){
        pint score={0,0};
        int slide=1;
        while(j-slide>=0&&g[j-slide][i]!=g[j][i]&&slide<2) ++score.second,++slide;
        slide=length;
        while(j+slide<n&&g[j+slide][i]!=g[j+length-1][i]&&slide<2+length) ++score.second,++slide;
        rep(k,length){
            if(flag){
                if(g[j+k][i]==1) ++score.first;
                else --score.first;
            }
            if(k>0&&g[j+k-1][i]==g[j+k][i]) ++score.second;
            slide=1;
            while(i-slide>=0&&g[j+k][i]!=g[j+k][i-slide]&&slide<3) ++score.second,++slide;
            slide=1;
            while(i+slide<n&&g[j+k][i]!=g[j+k][i+slide]&&slide<3) ++score.second,++slide;
        }
        if(best<score){
            ret=make_pair(pint(j+1,i+1),pint(j+length,i+1));
            best=score;
        }
    }
    ly=ret.first.first,lx=ret.first.second,ry=ret.second.first,rx=ret.second.second;
    FOR(i,ly,ry+1)FOR(j,lx,rx+1) g[i-1][j-1]^=1;
    return ret;
}
pair<pint,pint> calc2(int length){
    pair<pint,pint> ret;
    pint best={-1000100010,0};
    int lx,rx,ly,ry;
    int sz=0;
    rep(i,n)rep(j,n-length+1)if(g[i][j]|g[i][j+length-1]){
        pint score={0,0};
        rep(k,length){
            if(g[i][j+k]==1) ++score.first;
            else --score.first;
            if(k>0&&g[i][j+k-1]==g[i][j+k]) ++score.second;
        }
        if(best<score){
            sz=0;
            cand[sz++]=make_pair(pint(i+1,j+1),pint(i+1,j+length));
            best=score;
        }
        else if(best==score){
            cand[sz++]=make_pair(pint(i+1,j+1),pint(i+1,j+length));
        }
    }
    
    rep(i,n)rep(j,n-length+1)if(g[j][i]|g[j+length-1][i]){
        pint score={0,0};
        rep(k,length){
            if(g[j+k][i]==1) ++score.first;
            else --score.first;
            if(k>0&&g[j+k-1][i]==g[j+k][i]) ++score.second;
        }
        if(best<score){
            sz=0;
            cand[sz++]=make_pair(pint(j+1,i+1),pint(j+length,i+1));
            best=score;
        }
        else if(best==score){
            cand[sz++]=make_pair(pint(j+1,i+1),pint(j+length,i+1));
        }
    }
    ret=cand[xor128()%sz];
    ly=ret.first.first,lx=ret.first.second,ry=ret.second.first,rx=ret.second.second;
    FOR(i,ly,ry+1)FOR(j,lx,rx+1) g[i-1][j-1]^=1;
    return ret;
}
int get_score(){
    int ret=0;
    rep(i,n)ret+=count(g[i],g[i]+n,0);
    return ret;
}
int main(){
    Timer timer;
    timer.reset();
    cin>>n>>k;
    rep(i,k) cin>>L[i];
    rep(i,n) cin>>s[i];;
    ans.resize(k);
    rep(i,n)rep(j,n){
        g[i][j]=s[i][j]-'0';
    }
    //tg=g;
    int loop=75;
    int bestscore=-1000100010;
    pair<pint,pint> ret;
    rep(i,k-loop){
        ret=calc(L[i],i+1);
        ans[i]=ret;
    }
    memcpy(tg,g,sizeof(g));
    FOR(i,k-loop,k){
        ret=calc(L[i],i+1);
        ans[i]=ret;
    }
    bestscore=get_score();
    tmp.resize(loop);
    while(timer.get()<timeLimit){
        memcpy(g,tg,sizeof(tg));
        FOR(i,k-loop,k){
            ret=calc2(L[i]);
            tmp[i-k+loop]=ret;
        }
        int cur=get_score();
        if(bestscore<cur){
            bestscore=cur;
            rep(i,loop) ans[i+k-loop]=tmp[i];
        }
    }
    rep(i,k){
        cout<<ans[i].first.first<<" "<<ans[i].first.second<<" "<<ans[i].second.first<<" "<<ans[i].second.second<<endl;
    }
    return 0;
}
0