結果
問題 | No.74 貯金箱の退屈 |
ユーザー | uwi |
提出日時 | 2014-11-20 23:28:33 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 70 ms / 5,000 ms |
コード長 | 5,290 bytes |
コンパイル時間 | 2,361 ms |
コンパイル使用メモリ | 89,208 KB |
実行使用メモリ | 51,040 KB |
最終ジャッジ日時 | 2023-08-30 21:56:15 |
合計ジャッジ時間 | 5,697 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
50,360 KB |
testcase_01 | AC | 58 ms
50,592 KB |
testcase_02 | AC | 59 ms
50,360 KB |
testcase_03 | AC | 60 ms
50,512 KB |
testcase_04 | AC | 59 ms
50,616 KB |
testcase_05 | AC | 65 ms
50,620 KB |
testcase_06 | AC | 59 ms
50,364 KB |
testcase_07 | AC | 57 ms
48,628 KB |
testcase_08 | AC | 57 ms
48,672 KB |
testcase_09 | AC | 57 ms
50,524 KB |
testcase_10 | AC | 60 ms
50,736 KB |
testcase_11 | AC | 58 ms
50,428 KB |
testcase_12 | AC | 70 ms
50,620 KB |
testcase_13 | AC | 62 ms
50,724 KB |
testcase_14 | AC | 60 ms
50,536 KB |
testcase_15 | AC | 62 ms
50,656 KB |
testcase_16 | AC | 61 ms
50,592 KB |
testcase_17 | AC | 59 ms
50,504 KB |
testcase_18 | AC | 60 ms
50,592 KB |
testcase_19 | AC | 58 ms
50,528 KB |
testcase_20 | AC | 60 ms
50,292 KB |
testcase_21 | AC | 59 ms
50,272 KB |
testcase_22 | AC | 60 ms
50,488 KB |
testcase_23 | AC | 60 ms
51,040 KB |
testcase_24 | AC | 58 ms
50,744 KB |
testcase_25 | AC | 59 ms
50,760 KB |
testcase_26 | AC | 61 ms
50,416 KB |
testcase_27 | AC | 62 ms
50,408 KB |
testcase_28 | AC | 61 ms
50,504 KB |
testcase_29 | AC | 64 ms
50,400 KB |
testcase_30 | AC | 63 ms
50,516 KB |
testcase_31 | AC | 69 ms
49,008 KB |
testcase_32 | AC | 64 ms
50,508 KB |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Main { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int n = ni(); int[] d = na(n); int[] w = na(n); boolean[] v = new boolean[n]; boolean[][] m = new boolean[n][n]; for(int i = 0;i < n;i++){ m[(i+d[i])%n][i] = m[(i+n*1000-d[i])%n][i] = true; v[i] = w[i] == 0; } Result res = gaussElimination(m, v); out.println(res.exists ? "Yes" : "No"); } public static Result gaussElimination(boolean[][] M, boolean[] v) { int n = M.length, m = M[0].length; int[] head = new int[n]; // Forward Elimination int row = 0; for(int col = 0;col < m;col++){ // select pivot boolean pivotFound = false; out: for(int prow = row;prow < n;prow++){ if(M[prow][col]){ // pivot found if(prow != row){ // swap rows for(int k = 0;k < m;k++){ boolean u = M[prow][k]; M[prow][k] = M[row][k]; M[row][k] = u; } boolean dum = v[prow]; v[prow] = v[row]; v[row] = dum; } pivotFound = true; break out; } } if(!pivotFound)continue; head[row] = col; for(int j = row+1;j < n;j++){ if(M[j][col]){ for(int k = col;k < m;k++){ M[j][k] ^= M[row][k]; } v[j] ^= v[row]; } } row++; } Result ret = new Result(); ret.mat = M; for(int i = row;i < n;i++){ if(v[i]){ ret.rank = row; ret.exists = false; return ret; } } for(int i = row-1;i >= 0;i--){ for(int j = i-1;j >= 0;j--){ if(M[j][head[i]]){ for(int k = head[i];k < m;k++){ M[j][k] ^= M[i][k]; } v[j] ^= v[i]; } } } boolean[] retv = new boolean[n]; for(int i = 0;i < row;i++){ retv[head[i]] = v[i]; } ret.sol = retv; ret.rank = row; ret.exists = true; return ret; } public static class Result { public boolean[][] mat; public boolean[] sol; public int rank; public boolean exists; } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private static char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }