解題區/解題區 - Zerojudge

b425. 抽菸動作 請勿模仿

contents

  1. 1. Problem
  2. 2. Sample Input
  3. 3. Sample Output
  4. 4. Solution

Problem

替影像打上馬賽克效果，馬賽克效果是把區域內部的每一個像素改變，改變的方法為從舊的圖像中，搜索以其為中心的 11 x 11 方形內部所有像素的平均。

這一題要馬賽克區域為圓形，接著找到方形內部的像素平均即可。

Sample Input

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

Sample Output

1
2
3
1 2
3 4 5
3 4 5

Solution

馬賽克的方案也許還有其他，從這裡可以知道平均造就出新的像素顏色。那麼可以列出方程式，所謂的解馬賽克估計也是去找線性聯立方程組，利用高斯消去法就能求解，可惜的是會有多組解的情況吧。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <bits/stdc++.h> 
using namespace std;
class IMAGE {
public:
    struct Pixel {
        double r, g, b, a;
        Pixel(double x = 0, double y = 0, double z = 0, double w = 0):
            r(x), g(y), b(z), a(w) {}
        void read() {
            scanf("%lf %lf %lf", &r, &g, &b);
        }
        Pixel operator-(const Pixel &x) const {
        	return Pixel(r-x.r, g-x.g, b-x.b, a-x.a);
    	}
    	Pixel operator+(const Pixel &x) const {
        	return Pixel(r+x.r, g+x.g, b+x.b, a+x.a);
    	}
    	Pixel operator*(const double x) const {
        	return Pixel(r*x, g*x, b*x, a*x);
    	}
        Pixel operator/(const double x) const {
        	return Pixel(r/x, g/x, b/x, a/x);
    	}
    	void print() {
    		printf("%d %d %d", (int)round(r), (int)round(g), (int)round(b));
    	}
    };
    int W, H;
    static const int MAXN = 300;
    Pixel data[MAXN][MAXN], tmp[MAXN][MAXN];
    void read() {
        scanf("%d %d", &W, &H);
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++)
                data[i][j].read();
    }
    void blur(long long X, long long Y, long long R) {
        if (R < 0)	return ;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                if ((i-X)*(i-X) + (j-Y)*(j-Y) <= R*R) {
                    Pixel B(0, 0, 0);
                    int cnt = 0;
                    for (int a = -5; a <= 5; a++) {
                        for (int b = -5; b <= 5; b++) {
                            if (i+a < H && j+b < W && i+a >= 0 && j+b >= 0) {
                                B = B + data[i+a][j+b];
                                cnt++;
                            }
                        }
                    }
                    tmp[i][j] = B / cnt;
                } else {
                    tmp[i][j] = data[i][j];
                }
            }
        }
        
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++)
                data[i][j] = tmp[i][j];
    }
    void print() {
        printf("%d %d\n", W, H);
        for (int i = 0; i < H; i++)
            for (int j = 0; j < W; j++)
                data[i][j].print(), printf("%c", j == W-1 ? '\n' : ' ');
    }
} test;
int main() {
    long long X, Y, R;
    scanf("%lld %lld %lld", &X, &Y, &R);
    test.read();
    test.blur(Y, X, R);
    test.print();
    return 0;
}