回收站选址

代码无bug

已于 2023-03-18 20:30:46 修改

阅读量39

点赞数

分类专栏： csp 文章标签： c++ leetcode 算法 Powered by 金山文档

于 2023-03-18 20:24:03 首次发布

本文链接：https://blog.csdn.net/aaronyyds/article/details/129642269

版权

csp 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

#include<bits/stdc++.h>
using namespace std;
int n;
pair<int, int>p[1010];
map<int, map<int, int>>mp;
int findk(map<int, map<int, int>> mp, int i, pair<int, int>p[]) {
    int k = 0;
    if (mp[p[i].first - 1][p[i].second-1] == 1) {
        k++;
    }
    if (mp[p[i].first + 1][p[i].second-1] == 1)k++;
    if (mp[p[i].first-1][p[i].second + 1] == 1)k++;
    if (mp[p[i].first+1][p[i].second + 1] == 1)k++;
    return k;
}
int main() {
    pair<int, int>p[1010];
    map<int, map<int, int>>mp;
    int i;
    cin >> n;
    for (i = 1; i <= n; i++) {
        int z, c;
        cin >> z >> c;
        mp[z][c] = 1;
        p[i] = make_pair(z, c);
    }
    int a[5] = { 0 };
    for (i = 1; i <= n; i++) {
        int k = 0;
        if (mp[p[i].first][p[i].second] == 1) {
            if (mp[p[i].first - 1][p[i].second] == 1 && mp[p[i].first + 1][p[i].second] == 1 && mp[p[i].first][p[i].second - 1] == 1 && mp[p[i].first][p[i].second + 1] == 1) {
                k = findk(mp, i, p);
                a[k]++;
            }
        }
    
    }
    for (i = 0; i < 5; i++) {
        cout << a[i] << endl;
    }
}