csp202206-2寻宝！大冒险！

最新推荐文章于 2023-12-18 20:24:43 发布

Lie ㅤ

最新推荐文章于 2023-12-18 20:24:43 发布

阅读量574

点赞数 1

文章标签： c++ 算法蓝桥杯

本文链接：https://blog.csdn.net/m0_61837058/article/details/126084553

版权

恶心人是吧， for (auto [x, v] : mp) 这样的写法不让编译=-=

很简单的一个模拟题

#include<bits/stdc++.h>
using namespace std;

#define x first
#define y second
#define rep(i,a,n) for (int i = a; i < n; i ++ )
#define repn(i,a,n) for (int i = a; i <= n; i ++ )
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
typedef long long ll;
typedef pair<int,int> PII;

ll gcd(ll a,ll b) { return b ? gcd(b,a % b) : a; }
const int mod = 1e9+7;
int n, l, s;
map<PII, int> mp;
map<PII, int> rp;
vector<PII> qwe;//因为csp不支持for (auto [q, v] : mp)   会报编译出错，所以用vector存一下
//暴力枚举每一个树， 最差最差1000 * 51 * 51,能过
int main()
{
    IOS;
    cin >> n >> l >> s;
    for (int i = 1; i <= n; i ++ )
    {
        int a, b;
        cin >> a >> b;
        mp[{a, b}] = 1;
        qwe.push_back({a, b});
        
    }
    for (int i = s; i >= 0; i --)
    {
        for (int j = 0; j <= s; j ++ )
        {
            int x;
            cin >> x;
            if (x == 1) rp[{i, j}] = 1;
        }
    }
    int cnt = 0;
    for (int r = 0; r < qwe.size(); r ++ )
    {
        int dx = qwe[r].x, dy = qwe[r].y;
        bool fg = true;
        for (int i = 0; i <= s; i ++ )
        {
            for (int j = 0; j <= s; j ++ )
            {
                if(mp[{dx + i, dy + j}] != rp[{i, j}] || dx + i > l || dy + j > l)
                {
                    fg = false;
                    break;
                }
            }
            if(!fg) break;
        }
        if(fg)
            cnt ++;
    }
    cout << cnt << endl;
    return 0;
}