Submission #3466938

---

Source Code Expand

#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dx[]={0,1,0,-1};
int dy[]={-1,0,1,0};
bool used[55][55];
int a[55][55];
typedef pair<int,int>P;
vector<P>ANS;
int main(){
    int h,w;
    cin>>h>>w;
    int K;
    cin>>K;
    string s[h];
    r(i,h)cin>>s[i];
    r(i,h)r(j,w)a[i][j]=s[i][j]-'0';
    for(int AAA=9;AAA>=1;AAA--)r(Y,50){
        r(X,50){
            vector<P>v;
            if(used[Y][X])continue;
            if(a[Y][X]!=AAA)continue;
            v.push_back(P(Y,X));
            int y=Y;
            int x=X;
            int USED[h][w]={};
            USED[Y][X]=1;
            r(k,K-1){
                int MAX=0;
                P p;
                r(l,4){
                    int yy=y+dy[l];
                    int xx=x+dx[l];
                    if(yy<0||xx<0||yy>=h||xx>=w)continue;
                    if(used[yy][xx])continue;
                    if(USED[yy][xx])continue;
                    if(a[yy][xx]>MAX){
                        p=P(yy,xx);
                        MAX=a[yy][xx];
                    }
                }
                if(MAX==0)break;
                USED[p.first][p.second]=1;
                x=p.second;
                y=p.first;
                v.push_back(p);
            }
            if(v.size()!=8)continue;
            r(k,8)used[v[k].first][v[k].second]=1;
            r(k,8)ANS.push_back(v[k]);
        }
    }
    set<P>st;
    //r(i,ANS.size())st.insert(ANS[i]);
    //cout<<st.size()<<' '<<ANS.size()<<endl;
    cout<<ANS.size()/8<<endl;
    r(i,ANS.size())cout<<ANS[i].first+1<<' '<<ANS[i].second+1<<endl;
}

Submission Info

Judge Result