~1 CCF 2022-06-2 treasure hunt! Big adventure!

Title Description

Input

Output

The sample input

Example 1 :

5 100 2
0 0
1 1
2 2
3 3
4 4
0 0 1
0 1 0
1 0 0

Example 2 :

5 4 2
0 0
1 1
2 2
3 3
4 4
0 0 0
0 1 0
1 0 0

Sample output

Example 1 :
3
Example 2 :
0

The subtasks

Source code

#include <iostream>
#include <vector>
#include <set>

using namespace std;


int main() {
    
    int n, L, s;
    cin >> n >> L >> s;
    vector<pair<int, int>> v(n);
    set<pair<int, int>> set;
    for (int i = 0; i < n; i++) {
    
        cin >> v[i].first >> v[i].second;
        set.insert(v[i]);
    }
    vector<vector<int>> f(s + 1, vector<int>(s + 1));
    for (int i = s; i >= 0; i--) {
    
        for (int j = 0; j <= s; j++) {
    
            cin >> f[i][j];
        }
    }

    int ret = 0;
    for (int i = 0; i < n; i++) {
    
        int r = v[i].first;
        int c = v[i].second;
        bool check = true;
//  If the matrix starting at the current point is not enough to contain the entire treasure map 
        if (r + s > L || c + s > L)
            check = false;
        for (int j = r, tr = 0; j <= r + s && check && tr <= s; j++, tr++) {
    
            for (int k = c, tc = 0; k <= c + s && check && tc <= s; k++, tc++) {
    
                if (f[tr][tc]) {
    
                    if (set.find({
    j, k}) == set.end()) {
    
                        check = false;

                    }

                } else {
    
                    if (set.find({
    j, k}) != set.end()) {
    
                        check = false;

                    }

                }
            }
        }
        if (check)
            ret++;
    }
    cout << ret;
    return 0;
}

About this problem

1. Note the subscript of the matrix , Not in order .
2. When code is submitted , choice CPP11 or CPP14
3. The current point cannot correspond to the lower left corner of the treasure map in three cases ：
（1） The matrix starting at the current point is not enough to contain the entire treasure map
（2） There is a tree somewhere in the treasure map , There is no tree in the corresponding position in the map
（3） There are trees at some point in the map , There is no tree in the corresponding position of the treasure map