結果
問題 | No.883 ぬりえ |
ユーザー | kitakitalily |
提出日時 | 2019-09-16 22:42:01 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,087 bytes |
コンパイル時間 | 1,951 ms |
コンパイル使用メモリ | 78,784 KB |
実行使用メモリ | 59,768 KB |
最終ジャッジ日時 | 2024-07-07 02:34:40 |
合計ジャッジ時間 | 7,140 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
50,016 KB |
testcase_01 | AC | 47 ms
49,540 KB |
testcase_02 | AC | 47 ms
49,868 KB |
testcase_03 | AC | 47 ms
49,808 KB |
testcase_04 | AC | 47 ms
49,816 KB |
testcase_05 | AC | 49 ms
49,660 KB |
testcase_06 | AC | 47 ms
49,548 KB |
testcase_07 | WA | - |
testcase_08 | AC | 47 ms
50,088 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 50 ms
50,140 KB |
testcase_12 | WA | - |
testcase_13 | AC | 48 ms
49,920 KB |
testcase_14 | AC | 104 ms
51,480 KB |
testcase_15 | AC | 1,714 ms
59,768 KB |
testcase_16 | AC | 669 ms
57,756 KB |
testcase_17 | WA | - |
testcase_18 | AC | 85 ms
50,856 KB |
testcase_19 | AC | 71 ms
50,420 KB |
testcase_20 | WA | - |
ソースコード
import java.util.*; import java.io.*; public class Main { static int mod = 1000000007; public static void main(String[] args){ FastScanner scanner = new FastScanner(); int n = scanner.nextInt(); int k = scanner.nextInt(); int size = 0; if(n > k*k){ size = n/k; }else{ size = (int)Math.ceil(Math.sqrt(n)); } char[][] a = new char[size][size]; System.out.println(size); int now = 0; while(now <= size){ for(int i = now; i < now+k; i++){ for(int j = now; j < now+k; j++){ if(n == 0) continue; if(i >= size || j >= size) continue; if(n > 0){ a[i][j] = '#'; n--; } } } now += k; } for(int i = 0; i < size; i++){ for(int j = 0; j < size; j++){ if(a[i][j] != '#'){ a[i][j] = '.'; } System.out.print(a[i][j]); } System.out.println(); } //System.out.println(size); } static class UnionFind { int[] parent; public UnionFind(int size) { parent = new int[size]; Arrays.fill(parent, -1); } public boolean unite(int x, int y) { x = root(x); y = root(y); if (x != y) { if (parent[y] < parent[x]) { int tmp = y; y = x; x = tmp; } parent[x] += parent[y]; parent[y] = x; return true; } return false; } public boolean same(int x, int y) { return root(x) == root(y); } public int root(int x) { return parent[x] < 0 ? x : (parent[x] = root(parent[x])); } public int size(int x) { return -parent[root(x)]; } } static class Pair implements Comparable<Pair>{ int first, second; Pair(int a, int b){ first = a; second = b; } @Override public boolean equals(Object o){ if (this == o) return true; if (!(o instanceof Pair)) return false; Pair p = (Pair) o; return first == p.first && second == p.second; } @Override public int compareTo(Pair p){ //return first == p.first ? second - p.second : first - p.first; //firstで昇順にソート //return (first == p.first ? second - p.second : first - p.first) * -1; //firstで降順にソート //return second == p.second ? first - p.first : second - p.second;//secondで昇順にソート //return (second == p.second ? first - p.first : second - p.second)*-1;//secondで降順にソート //return first * 1.0 / second > p.first * 1.0 / p.second ? 1 : -1; // first/secondの昇順にソート //return first * 1.0 / second < p.first * 1.0 / p.second ? 1 : -1; // first/secondの降順にソート //return second * 1.0 / first > p.second * 1.0 / p.first ? 1 : -1; // second/firstの昇順にソート //return second * 1.0 / first < p.second * 1.0 / p.first ? 1 : -1; // second/firstの降順にソート //return Math.atan2(second, first) > Math.atan2(p.second, p.first) ? 1 : -1; // second/firstの昇順にソート //return first + second > p.first + p.second ? 1 : -1; //first+secondの昇順にソート return first + second < p.first + p.second ? 1 : -1; //first+secondの降順にソート //return first - second < p.first - p.second ? 1 : -1; //first+secondの降順にソート } } private static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} } }