結果

問題 No.82 市松模様
ユーザー threepipes_s
提出日時 2014-12-02 23:25:21
言語 Java8
(openjdk 1.8.0.191)
結果
AC  
実行時間 123 ms
コード長 5,136 Byte
コンパイル時間 1,807 ms
使用メモリ 20,144 KB
最終ジャッジ日時 2018-11-26 21:41:13

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
sample1.txt AC 80 ms
19,192 KB
sample2.txt AC 85 ms
19,188 KB
sample3.txt AC 84 ms
19,196 KB
test1.txt AC 85 ms
19,188 KB
test2.txt AC 86 ms
19,192 KB
test3.txt AC 84 ms
19,192 KB
test4.txt AC 86 ms
19,200 KB
test5.txt AC 89 ms
19,220 KB
test6.txt AC 123 ms
20,140 KB
test7.txt AC 123 ms
20,144 KB
テストケース一括ダウンロード

ソースコード

diff #
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.TreeSet;
public class Main {
//	public static int w;
//	public static int k;
//	public static int n;
//	public static int[][] dp;
//	public static int[] r;
//	public static long[] buy;
//	public static List<double[]> list = new ArrayList<double[]>();
//	public static NodeW[] product;
//	public static int[][] dists;
//	public static int x;
//	public static int[][] memo;
//	public static String str;
//	public static HashSet<String> set;
	public static void main(String[] args) throws NumberFormatException, IOException{

		ContestScanner in = new ContestScanner();
		int w = in.nextInt();
		int h = in.nextInt();
		String c = in.nextToken();
		String[] pat = new String[2];
		if(c.equals("B")){
			pat[0] = "B";
			pat[1] = "W";
		}else{
			pat[0] = "W";
			pat[1] = "B";
		}
		for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				System.out.print(pat[(j+i)%2]);
			}
			System.out.println();
		}
	}
	
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}


class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int id;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id){
		this.id = id;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
}


class NodeW{
	int id;
//	int dist;
	List<NodeW> edge = new ArrayList<NodeW>();
	List<Integer> costList = new ArrayList<Integer>();
	public NodeW(int id) {
		this.id = id;
	}
	public void createEdge(NodeW node, int cost) {
		edge.add(node);
		costList.add(cost);
//		node.setDist(dist+1);
	}
//	public void setDist(int dist){
//		this.dist = Math.max(this.dist, dist);
//		for(NodeW node: edge){
//			node.setDist(dist+1);
//		}
//	}
}

class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
	T start;
	T end;
	public Range(T start, T end){
		this.start = start;
		this.end = end;
	}
	public boolean inRange(T val){
		if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
			return true;
		}
		return false;
	}
	
	public boolean isCommon(Range<T> range){
		if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
			return true;
		}
		return false;
	}
	
	public Range<T> connect(Range<T> range){
		if(!isCommon(range)) return null;
		Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
				end.compareTo(range.end) >= 0 ? end : range.end);
		return res;
	}
	
	public boolean connectToThis(Range<T> range){
		if(!isCommon(range)) return false;
		start = start.compareTo(range.start) <= 0 ? start : range.start;
		end = end.compareTo(range.end) >= 0 ? end : range.end;
		return true;
	}
	@Override
	public int compareTo(Range<T> range) {
		int res = start.compareTo(range.start);
		if(res == 0) return end.compareTo(range.end);
		return res;
	}
	
	public String toString(){
		return "["+start+","+end+"]";
	}
}

class RangeSet<T extends Comparable<T>>{
	TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
	public void add(Range<T> range){
		Range<T> con = ranges.floor(range);
		if(con != null){
			if(con.connectToThis(range))
				range = con;
		}
		con = ranges.ceiling(range);
		while(con != null && range.connectToThis(con)){
			ranges.remove(con);
			con = ranges.ceiling(range);
		}
		ranges.add(range);
	}
	
	public String toString(){
		StringBuilder bld = new StringBuilder();
		for(Range<T> r: ranges){
			bld.append(r+"\n");
		}
		return bld.toString();
	}
}


class MyMath{
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}
0