PAT乙级 1068 万绿丛中一点红

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#include<set>
#include<bits/stdc++.h>

using namespace std;

int main(void){
    int n, m, num, inputs, TOL;
    cin>>n>>m>>TOL;
    int pixels[m+2][n+2]={0};
    map<int, int> mp;
    for(int i=1; i<=m; i++){
        for(int j=1; j<=n; j++){
            cin>>inputs;
            pixels[i][j] = inputs;
            ++mp[inputs];
        }
    }
    m = m + 2;
    n = n + 2;
    int x0, x1, x2, y0, y1, y2, cor=0, tmp, tx, ty;
    for(int i=1; i<=m; i++){
        for(int j=1; j<=n; j++){
            num = pixels[i][j];
            if(mp[num]!=1) continue;
            x0 = j - 1;
            x1 = j;
            x2 = j + 1;
            y0 = i - 1;
            y1 = i;
            y2 = i + 1;
            if(x0<0||y0<0||x2>=n||y2>=m) continue;
            if(abs(num - pixels[y0][x0])<=TOL) continue;
            if(abs(num - pixels[y1][x0])<=TOL) continue;
            if(abs(num - pixels[y2][x0])<=TOL) continue;
            if(abs(num - pixels[y0][x1])<=TOL) continue;
            if(abs(num - pixels[y2][x1])<=TOL) continue;
            if(abs(num - pixels[y0][x2])<=TOL) continue;
            if(abs(num - pixels[y1][x2])<=TOL) continue;
            if(abs(num - pixels[y2][x2])<=TOL) continue;
            cor++;
            if(cor==2){
                cout<<"Not Unique";
                return 0;
            }
            tmp = num;
            tx = j;
            ty = i;
        }
    }
    if(cor==1) printf("(%d, %d): %d", tx, ty, tmp);
    else cout<<"Not Exist";
    return 0;
}

GitHub - ZouJiu1/PAT: 浙江大学PAT题目解答内容https://github.com/ZouJiu1/PAT/