CCF-CSP 2022 12-3 JPEG解码

一道挺水的模拟题

有一点，在矩阵M的填充上，考虑用列举的方法得到。即手写位置数组x[],y[]。

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn = 65;
const int INF = 99999999;
double Q[8][8], M[8][8], a[maxn];//a数组记录扫描数据
int n, T;
int x[] = { 0,0,1,2,1,0,0,1,2,3,4,3,2,1,0,0,1,2,3,4,5,6,5,4,3,2,1,0,0,1,2,3,4,5,6,7,7,6,5,4,3,2,1,2,3,4,5,6,7,7,6,5,4,3,4,5,6,7,7,6,5,6,7,7 };
int y[] = { 0,1,0,0,1,2,3,2,1,0,0,1,2,3,4,5,4,3,2,1,0,0,1,2,3,4,5,6,7,6,5,4,3,2,1,0,1,2,3,4,5,6,7,7,6,5,4,3,2,3,4,5,6,7,7,6,5,4,5,6,7,7,6,7 };
double Me[8][8];//最终解码后的矩阵
const double PI = acos(-1);

void trans() {//一大串公式对应的算法
    for (int i = 0;i < 8;i++) {
        for (int j = 0;j < 8;j++) {
            long double sum = 0;
            for (int u = 0;u < 8;u++) {
                for (int v = 0;v < 8;v++) {
                    double au = u == 0 ? sqrt(0.5) : 1;
                    double av = v == 0 ? sqrt(0.5) : 1;
                    sum += (au * av * M[u][v] * cos(PI * 0.125 * ((double)i + 0.5) * (double)u)) * cos(PI * 0.125 * ((double)j + 0.5) * (double)v);
                }
            }
            Me[i][j] = sum * 0.25 + 128;
            int temp = Me[i][j];
            double delta = Me[i][j] - temp;
            if (delta >= 0.5)temp += 1;//注意小数在比较时的处理
            if (temp > 255)cout << 255 << " ";
            else if (temp < 0)cout << 0 << " ";
            else cout << temp << " ";
        }
        if(i <= 6)cout << endl;
    }
    
}

int main() {
    ios::sync_with_stdio(false);
    for (int i = 0;i < 8;i++) {
        for (int j = 0;j < 8;j++) {
            cin >> Q[i][j];
        }
    }
    cin >> n;
    cin >> T;
    for (int i = 1;i <= n;i++)cin >> a[i];
    int i = 0, j = 0;
    for (i = 0;i < n;i++) {
        M[x[i]][y[i]] = a[i + 1];
    }

    if (T == 0) {
        for (i = 0;i < 8;i++) {
            for (j = 0;j < 8;j++) {
                if (j <= 6)cout << M[i][j] << " ";
                else cout << M[i][j];
            }
            if(i <= 6)cout << endl;
        }
    }
    else {
        for (i = 0;i < 8;i++) {
            for (j = 0;j < 8;j++) {
                M[i][j] *= Q[i][j];
            }
        }
        if (T == 1) {
            for (i = 0;i < 8;i++) {
                for (j = 0;j < 8;j++) {
                    if (j <= 6)cout << M[i][j] << " ";
                    else cout << M[i][j];
                }
                if(i <= 6)cout << endl;
            }
        }
        if (T == 2) {
            trans();
        }
    }
    return 0;
}