CCF drawing (full mark code + problem solving ideas + skill summary) February 2, 2014

Title Description

Their thinking

Because the data range is very small , So it can be solved directly
It is equivalent to marking all colored points on a square grid paper
Finally, count all colored points

Code implementation

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

int n;

bool m[N][N];

int main()
{
    
    cin >> n;
    
    while(n --)
    {
    
        int x1, y1, x2, y2;
        
        cin >> x1 >> y1 >> x2 >> y2;
        
        for (int i = x1; i < x2; i ++)
        {
    
            for (int j = y1; j < y2; j ++)
            {
    
                m[i][j] = true;
            }
        }
    }
    
    int res = 0;
    for (int i = 0; i < N; i ++)
    {
    
        for (int j = 0; j < N; j ++)
        {
    
            res += m[i][j];
        }
    }
    
    cout << res;
    return 0;
}

Skill summary

• Data range is important , First of all, think about the most stupid act of violence , When the data range is not allowed , Think again about the algorithm for optimization
• Don't solve problems in a proper way , for example ： My inherent thinking in this problem is to add large areas , Subtract coincident area , Then I don't know how to judge the weight … It's going to crash …
• If the data range is relatively small, we must think about the violent solution ！！