标签:1232 int 三体 ss static import new public AcWing
差分和前缀和互为逆运算,这个题用三维差分,三维只是比较麻烦,和容斥原理比较类似。
Problem
好像是A组第六题,蓝桥杯省赛第六题居然已经这么难了?
因为保证矩阵行列相乘小于1e6但不知道行和列分别有多大,所以需要用到数组下标映射,也就是代码中的
public static int get(int i, int j, int k){...}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(System.out);
static int N = 2000010, A, B, C, m;
static long s[] = new long[N], b[] = new long[N], bp[] = new long[N];
static int op[][] = new int[N >> 1][7];
static int d[][] = new int[][]{
{0, 0, 0, 1},
{0, 0, 1, -1},
{0, 1, 0, -1},
{0, 1, 1, 1},
{1, 0, 0, -1},
{1, 0, 1, 1},
{1, 1, 0, 1},
{1, 1, 1, -1},
};
public static void main(String[] args) throws Exception {
String ss[] = br.readLine().split(" ");
A = Integer.parseInt(ss[0]);
B = Integer.parseInt(ss[1]);
C = Integer.parseInt(ss[2]);
m = Integer.parseInt(ss[3]);
ss = br.readLine().split(" ");
int uu = 0;
for (int i = 1; i <= A; i++) {
for (int j = 1; j <= B; j++) {
for (int k = 1; k <= C; k++) {
s[get(i, j, k)] = Long.parseLong(ss[uu++]);
}
}
}
for (int i = 1; i <= A; i++) {
for (int j = 1; j <= B; j++) {
for (int k = 1; k <= C; k++) {
for (int u = 0; u < 8; u++) {
int x = i - d[u][0];
int y = j - d[u][1];
int z = k - d[u][2];
int t = d[u][3];
bp[get(i, j, k)] += s[get(x, y, z)] * t;
}
}
}
}
for (int i = 1; i <= m; i++) {
ss = br.readLine().split(" ");
for (int j = 0; j < 7; j++)
op[i][j] = Integer.parseInt(ss[j]);
}
int l = 1, r = m;
while (l < r) {
int mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
pw.print(r);
pw.flush();
pw.close();
br.close();
}
public static int get(int i, int j, int k) {
return (i * B + j) * C + k;
}
public static boolean check(int mid) {
b = Arrays.copyOf(bp, bp.length);
for (int i = 1; i <= mid; i++) {
int x1 = op[i][0];
int x2 = op[i][1];
int y1 = op[i][2];
int y2 = op[i][3];
int z1 = op[i][4];
int z2 = op[i][5];
int t = op[i][6];
b[get(x1 , y1 , z1 )] -= t;
b[get(x1 , y1 , z2 + 1)] += t;
b[get(x1 , y2 + 1, z1 )] += t;
b[get(x1 , y2 + 1, z2 + 1)] -= t;
b[get(x2 + 1, y1 , z1 )] += t;
b[get(x2 + 1, y1 , z2 + 1)] -= t;
b[get(x2 + 1, y2 + 1, z1 )] -= t;
b[get(x2 + 1, y2 + 1, z2 + 1)] += t;
}
Arrays.fill(s, 0);
for (int i = 1; i <= A; i++) {
for (int j = 1; j <= B; j++) {
for (int k = 1; k <= C; k++) {
s[get(i, j, k)] = b[get(i, j, k)];
for (int u = 1; u < 8; u++) {
int x = i - d[u][0];
int y = j - d[u][1];
int z = k - d[u][2];
int t = d[u][3];
s[get(i, j, k)] -= s[get(x, y, z)] * t;
}
if (s[get(i, j, k)] < 0) return true;
}
}
}
return false;
}
}
SoKeeGanCN
发布了153 篇原创文章 · 获赞 3 · 访问量 2716
私信
关注
标签:1232,int,三体,ss,static,import,new,public,AcWing 来源: https://blog.csdn.net/qq_43515011/article/details/104516245
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。