传送门
题目描述
给定由非负整数组成的 n ∗ n n * n n∗n的正方形矩阵,你需要寻找一条路径:
以左上角为起点
每次只能向右或向下走
以右下角为终点 并且,如果我们把沿路遇到的数进行相乘,积应当是最小“round”,换句话说,应当以最小数目的0的结尾.
分析
这道题的细节是真的多
首先如果乘起来造成末尾新增了0,那么必然是2 * 5的结果,所以我们去分解每一个数,a[i][j][0/1]表示2和5的个数分别有多少个,然后取min进行状态转移就可以了
需要注意的是,如果有0的话,需要特判
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 1010;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
ll a[N][N][2];
int st;
int n;
ll ppp1(int x){
ll res = 0;
while(x % 2 == 0 && x) res++,x /= 2;
return res;
}
ll ppp2(int x){
ll res = 0;
while(x % 5 == 0 && x) res++,x /= 5;
return res;
}
void out(int x,int y){
if(x == 1 && y == 1) return;
if(x == 1){
out(x,y - 1);
printf("R");
}
else if(y == 1){
out(x - 1,y);
printf("D");
}
else if(a[x - 1][y][st] < a[x][y - 1][st]){
out(x - 1,y);
printf("D");
}
else{
out(x,y - 1);
printf("R");
}
}
int main() {
read(n);
int stx = -1,sty = -1;
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
int x;
read(x);
if(!x) stx = i,sty = j;
a[i][j][0] = ppp1(x);
a[i][j][1] = ppp2(x);
}
}
for(int i = 2;i <= n;i++){
a[1][i][0] += a[1][i - 1][0];
a[1][i][1] += a[1][i - 1][1];
a[i][1][0] += a[i - 1][1][0];
a[i][1][1] += a[i - 1][1][1];
}
for(int i = 2;i <= n;i++)
for(int j = 2;j <= n;j++){
a[i][j][0] += min(a[i - 1][j][0],a[i][j - 1][0]);
a[i][j][1] += min(a[i - 1][j][1],a[i][j - 1][1]);
}
if(a[n][n][0] <= a[n][n][1]) st = 0;
else st = 1;
if(stx != -1 && a[n][n][st] != 0){
di(1);
for(int i = 1;i < stx;i++) printf("D");
for(int i = 1;i < n;i++) printf("R");
for(int i = stx;i < n;i++) printf("D");
return 0;
}
dl(a[n][n][st])
out(n,n);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/