行业知识
题目3180:蓝桥杯2023年第十四届省赛真题-棋盘=========及=====探讨输入输出对竞赛的影响
2026-11-20 06:35:09
来源:互联网转载
原理链接:
题���3180:蓝桥杯2023年第十四届省赛真题-棋盘
https://www.dotcpp.com/oj/problem3180.html
第一次尝试:
package Dotcpp;import java.util.Scanner;public class 题目3180蓝桥杯2023年第十四届省赛真题__棋盘 {/*小蓝拥有 n × n 大小的棋盘小蓝进行了 m 次操作每次操作会将棋盘上某个范围内的所有棋子的颜色取反 (也就是白色棋子变为黑色,黑色棋子变为白色)。 */public static void main(String[] args) {//输入的第一行包含两个整数 n, m,//接下来 m 行每行包含四个整数 x1, y1, x2, y2,//对于所有评测用例,1 ≤ n, m ≤ 2000 ,1 ≤ x1 ≤ x2 ≤ n ,1 ≤ y1 ≤ y2 ≤ m 。Scanner sc = new Scanner(System.in);int n = sc.nextInt();int m = sc.nextInt();int qipan [][] = new int[n][n];while(m-->0){int x1 = sc.nextInt();int y1 = sc.nextInt();int x2 = sc.nextInt();int y2 = sc.nextInt();Reverse(qipan,x1,y1,x2,y2);}//while(m-->=0)for (int i=0;ifor (int j=0;jSystem.out.print(qipan[i][j]);}System.out.println();}}private static void Reverse(int[][] qipan, int x1, int y1, int x2, int y2) {for (int i=x1-1;ifor (int j=y1-1;jif (qipan[i][j] == 0){qipan[i][j] = 1;}else{qipan[i][j] = 0;}}}}}for (int i=x1-1;ifor (int j=y1-1;jif (qipan[i][j] == 0){qipan[i][j] = 1;}else{qipan[i][j] = 0;}}}public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt();int m = sc.nextInt();int qipan [][] = new int[2002][2002];while (m--0){int x1 = sc.nextInt();int y1 = sc.nextInt();int x2 = sc.nextInt();int y2 = sc.nextInt();for (int i=x1;iqipan[i][y1]++;qipan[i][y2+1]--;}}for (int i=1;ifor (int j=1;jqipan[i][j]+=qipan[i][j-1];System.out.print(qipan[i][j]%2);}System.out.println();}}} static int n,m;static int[][] map; public static void main(String[] args) throws Exception { n = nextInt(); m = nextInt(); map = new int[n + 4][n + 4]; for(int [] row : map) Arrays.fill(row,1); //show(); for(int i = 0; i
上一篇:阿里云服务器怎么升级数据?