pat1105 Spiral Matrix

题意：输入一些数把他们放到m*n的矩阵里，按照环形从大到小排放。

思路：for一下求出插值最小且m大于等于n的矩阵，然后优先队列维护输入的树即可。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>

using namespace std;

const int MAX_N = 110;
int mat[MAX_N][MAX_N];
int m, n, x;
int N;
priority_queue<int> pq;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d", &N);
    int t = sqrt(N);
    for (int i = 1; i <= t; i++) {
        int res = N / i;
        if (res * i == N) {
            n = i; m = res;
        }
    }
    for (int i = 0; i < N; i++) {
        scanf("%d", &x);
        pq.push(x);
    }
    int x, y, k;
    x = y = k = 0;
    memset(mat, -1, sizeof(mat));
    while (!pq.empty()) {
        mat[x][y] = pq.top(); pq.pop();
        int tx = x+dx[k], ty = y+dy[k];
        if (0 <= tx && tx < m && 0 <= ty && ty < n && mat[tx][ty] == -1) {
            x = tx; y = ty;
        } else {
            k++; k = k % 4;
            x = x + dx[k]; y = y + dy[k];
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (j > 0) printf(" ");
            printf("%d", mat[i][j]);
        }
        printf("\n");
    }

    return 0;
}