CodeForces - 32D Constellation【水题】

题目链接：https://codeforces.com/contest/32/problem/D

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lowbit(x) (x & (-x))
#define CASET int _; scanf("%d", &_); for(int kase=1;kase<=_;kase++)

typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;

static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-10;
static const db PI=acos(-1.0);
static const int MOD=1e9+7;

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
struct ANS{
    int x,y,step;
};
static const int MAXN=300+10;
int n,m,k;
char g[MAXN][MAXN];
vector<ANS> ans;
int main()
{
    read(n); read(m); read(k);
    for(int i=1;i<=n;i++) scanf("%s",g[i]+1);
    for(int k=1;k<=n && k<=m;k++)
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                if(g[i][j]=='*' && i-k>=1 && i+k<=n && j-k>=1 && j+k<=m && g[i-k][j]=='*' && g[i+k][j]=='*' && g[i][j-k]=='*' && g[i][j+k]=='*') ans.push_back({i,j,k});
            
    if(k>ans.size()) puts("-1");
    else
    {
        printf("%d %d\n",ans[k-1].x,ans[k-1].y);
        printf("%d %d\n",ans[k-1].x-ans[k-1].step,ans[k-1].y);
        printf("%d %d\n",ans[k-1].x+ans[k-1].step,ans[k-1].y);
        printf("%d %d\n",ans[k-1].x,ans[k-1].y-ans[k-1].step);
        printf("%d %d\n",ans[k-1].x,ans[k-1].y+ans[k-1].step);
    }
    return 0;
}