Macesuted

/**
 * @file reward.cpp
 * @author Macesuted (i@macesuted.moe)
 * @date 2023-03-11
 *
 * @copyright Copyright (c) 2023
 *
 */

#include <bits/stdc++.h>

Macesuted

/**
 * @file 6109.cpp
 * @author Macesuted (i@macesuted.moe)
 * @date 2022-03-11
 *
 * @copyright Copyright (c) 2022
 * @brief
 *      My Tutorial: https://macesuted.moe/article/lg6109
 *
 */

Macesuted

#include <bits/stdc++.h>
using namespace std;

enum chess //棋子种类
{
    NA,       //无（这个位置是空的）
    captain,  //王
    guard,    //士
    elephant, //象
    horse,    //马

Macesuted

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>

const int maxn = 205;
const int maxk = 105;
const int way[2][4] = {{1, 0, -1, 0}, {0, 1, 0, -1}};

Macesuted

#include <iostream>
#include <fstream>
#include <vector>
#include <cstdlib>

using std::cout;
using std::endl;
using std::cin;
using std::ios;