CodeForces 1353 C. Board Moves 动态规划

最新推荐文章于 2022-09-05 21:54:23 发布

Curren.wong

最新推荐文章于 2022-09-05 21:54:23 发布

阅读量561

点赞数 2

分类专栏：算法刷题笔记 # 动态规划文章标签：动态规划算法数据结构 c++ codeforces

本文链接：https://blog.csdn.net/qq_41729780/article/details/106185063

版权

算法刷题笔记同时被 2 个专栏收录

76 篇文章 3 订阅

订阅专栏

动态规划

9 篇文章 0 订阅

订阅专栏

文章目录

1. 题目描述

1.1. Limit

Time Limit: 1 second

Memory Limit: 256 megabytes

1.2. Problem Description

You are given a board of size $\times n$ , where $n$ is odd (not divisible by $2$ ). Initially, each cell of the board contains one figure.

In one move, you can select exactly one figure presented in some cell and move it to one of the cells sharing a side or a corner with the current cell, i.e. from the cell $(i, j)$ you can move the figure to cells:

$(i - 1, j - 1)$ ;
$(i - 1, j)$ ;
$(i - 1, j + 1)$ ;
$(i, j - 1)$ ;
$(i, j + 1)$ ;
$(i + 1, j - 1)$ ;
$(i + 1, j)$ ;
$(i + 1, j + 1)$ ;

Of course, you can not move figures to cells out of the board. It is allowed that after a move there will be several figures in one cell.

Your task is to find the minimum number of moves needed to get all the figures into one cell (i.e. $n^2-1$ cells should contain $0$ figures and one cell should contain $n^2$ figures).

You have to answer $t$ independent test cases.

1.3. Input

The first line of the input contains one integer $t$ ( $\le t \le 200$ ) — the number of test cases. Then $t$ test cases follow.

The only line of the test case contains one integer $n$ ( $\le n < 5 \cdot 10^5$ ) — the size of the board. It is guaranteed that $n$ is odd (not divisible by $2$ ).

It is guaranteed that the sum of $n$ over all test cases does not exceed $\cdot 10^5$ ( $\sum n \le 5 \cdot 10^5$ ).

1.4. Onput

For each test case print the answer — the minimum number of moves needed to get all the figures into one cell.

1.5. Sample Input

1.6. Sample Onput

0
40
41664916690999888

1.7. Source

CodeForces 1353 C. Board Moves

2. 解读

通过观察建立递推方程，从矩阵中心向外，第 $i$ 层有 $8 i$ 个元素，需要移动 $i$ 次才能到达矩阵中心。

$\times (i-1)^2$

将 $i$ 换为矩阵维度 $x$ ， $i = 2 x - 1$ 。

$\times (2(x-1)-1)^2$

$\text{Table 1.样例数据表}$

$x$	$2 x - 1$	结果	差值
1	1	0
2	3	8	8
3	5	40	32
4	7	114	72
5	9	506	392
6	11	1164	648

3. 代码

#include <algorithm>
#include <iostream>
#include <string.h>
const long long num = 5 * 1e5 + 1;
using namespace std;

long long list[num];

void calculate(long long n)
{
    list[1] = 0;
    // 递推方程
    // 这里的 i 一定要是 long long ，不然会溢出，猜测是(i - 1) * (i - 1)用了i的类型进行存储
    for (long long i = 2; i < n; i++) {
        list[i] = list[i - 1] + 8 * (i - 1) * (i - 1);
    }
}

int main()
{
    // test case
    long long t;
    long long n;
    // 计算
    calculate((num + 1) / 2);
    // test case
    scanf("%lld", &t);
    // for each test case
    while (t--) {
        // 输入
        scanf("%lld", &n);
        // 输出
        printf("%lld\n", list[(n + 1) / 2]);
    }
}