201412-1(门禁系统),201412-2(Z字形扫描)

//201412-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    scanf("%d", &n);

    map<int, int> m;
    int arr[n];
    int index = 0, num;
    while (n--) {
        scanf("%d", &num);
        arr[index++] = ++m[num];
    }
    for(int i=0;i<index;i++) {
        if(i!=0)
            printf(" ");
        printf("%d", arr[i]);
    }

    return 0;
}

//201412-1
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, num;
    scanf("%d", &n);

    unordered_map<int, int> m;
    while (n--) scanf("%d", &num), printf("%d ", ++m[num]);

    return 0;
}

//201412-2
#include <bits/stdc++.h>

using namespace std;

struct Node {
    int row, col;
} node[4] = /*东,,南,西南,东北*/{{0,  1},
                           {1,  0},
                           {1,  -1},
                           {-1, 1}};

int main() {
    int n;
    scanf("%d", &n);

    int arr[n][n];
    //录入数据
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            scanf("%d", &arr[i][j]);

    //0东,1西南,2南,3东北

    int row = 0, col = 0;
    //打印起点
    printf("%d", arr[row][col]);
    int nowDir = 0;
    //记录剩余需要打印的数据
    int count = n * n - 1;

    //打印完全部数据
    while (count) {
        row += node[nowDir].row;
        col += node[nowDir].col;
        if (row >= 0 && row < n && col >= 0 && col < n) {
            printf(" %d", arr[row][col]);
            count--;
        }

        if (nowDir == 0 && row == 0)
            nowDir = 1;
        else if (nowDir == 0 && row == n - 1)
            nowDir = 3;
        else if (nowDir == 1 && col == 0)
            nowDir = 2;
        else if (nowDir == 1 && row == n - 1)
            nowDir = 0;
        else if (nowDir == 2 && col == 0)
            nowDir = 3;
        else if (nowDir == 2 && col == n - 1)
            nowDir = 1;
        else if (nowDir == 3 && row == 0)
            nowDir = 0;
        else if (nowDir == 3 && col == n - 1)
            nowDir = 2;
    }

    return 0;
}

//201412-2
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> v(510, vector<int>(510));

int main() {
    int n;
    scanf("%d", &n);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            scanf("%d", &v[i][j]);

    int cnt = n * n - 1;
    /*
     * 1向右
     * 2向下
     * 3向左下
     * 4向右上
     * */

    int cur = 1;
    int row = 0, col = 0;
    printf("%d ", v[row][col]);

    pair<int, int> p[5]{{0,  0},
                        {0,  1},
                        {1,  0},
                        {1,  -1},
                        {-1, 1}};
    while (cnt > 0) {
        row += p[cur].first, col += p[cur].second;
        if (row >= 0 && row < n && col >= 0 && col < n)
            printf("%d ", v[row][col]), cnt--;

        if (cur == 1 && row == 0)
            cur = 3;
        else if (cur == 1 && row == n - 1)
            cur = 4;
        else if (cur == 2 && col == 0)
            cur = 4;
        else if (cur == 2 && col == n - 1)
            cur = 3;
        else if (cur == 3 && row == n - 1)
            cur = 1;
        else if (cur == 3 && col == 0)
            cur = 2;
        else if (cur == 4 && row == 0)
            cur = 1;
        else if (cur == 4 && col == n - 1)
            cur = 2;
    }


    return 0;
}