Submission #1778052


Source Code Expand

import java.util.*;
import java.io.*;

public class Main {
	private static IO io = new IO();

	public static void main(String[] args) {
		int k = io.nextInt();
		int m = io.nextInt();
		long A[][] = new long[k][1];
		long M[][] = new long[k][k];
		for (int i = 0; i < k; i++) A[k-1-i][0] = io.nextLong();
		for (int i = 0; i < k; i++) M[0][i] = io.nextLong();
		for (int i = 1; i < k; i++) M[i][i-1] = Long.MAX_VALUE;

		System.out.println(mul(pow(M, m-1), A)[k-1][0]);
	}

	// A*B
	private static long[][] mul(long A[][], long B[][]) {
		long C[][] = new long[A.length][B[0].length];
		for (int i = 0; i < A.length; i++) {
			for (int k = 0; k < B.length; k++) {
				for (int j = 0; j < B[0].length; j++) {
					C[i][j] ^= A[i][k]&B[k][j];
				}
			}
		}
		return C;
	}

	// A^n
	private static long[][] pow(long A[][], long n){
		long B[][] = new long[A.length][A.length];
		for (int i=0; i<A.length; i++) B[i][i] = Long.MAX_VALUE;
		while (n>0) {
			if ((n&1)!=0) B = mul(B,A);
			A = mul(A, A);
			n >>= 1;
		}
		return B;
	}

	private static class IO extends PrintWriter {
		private final InputStream in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		public IO() { this(System.in);}
		public IO(InputStream source) { super(System.out); this.in = source;}
		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;}
		private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
		private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
		private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
		public boolean hasNext() { skipUnprintable(); return hasNextByte();}
		public boolean hasNextLine() { skipNewLine(); 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 char[] nextCharArray(int len) {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			char[] s = new char[len];
			int i = 0;
			int b = readByte();
			while(isPrintableChar(b)) {
				if (i == len) {
					throw new InputMismatchException();
				}
				s[i++] = (char) b;
				b = readByte();
			}
			return s;
		}
		public String nextLine() {
			if (!hasNextLine()) {
				throw new NoSuchElementException();
			}
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while(!isNewLine(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 char nextChar() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			return (char) readByte();
		}
		public double nextDouble() { return Double.parseDouble(next());}
		public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
		public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
		public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
		public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
		public int[][] matrixInt(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
		public char[][] charMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
		public void close() {
			super.close();
			try {
				in.close();
			} catch (IOException ignored) {}
		}
	}
}

Submission Info

Submission Time
Task D - 漸化式
User creep04
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 4910 Byte
Status AC
Exec Time 163 ms
Memory 26196 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 20
Set Name Test Cases
All random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, sample_1.txt, sample_2.txt, sample_3.txt, small_1.txt, small_2.txt
Case Name Status Exec Time Memory
random_01.txt AC 70 ms 20052 KB
random_02.txt AC 69 ms 19284 KB
random_03.txt AC 72 ms 20692 KB
random_04.txt AC 71 ms 21076 KB
random_05.txt AC 72 ms 17364 KB
random_06.txt AC 73 ms 21072 KB
random_07.txt AC 98 ms 21972 KB
random_08.txt AC 97 ms 21716 KB
random_09.txt AC 145 ms 25044 KB
random_10.txt AC 145 ms 22356 KB
random_11.txt AC 163 ms 24404 KB
random_12.txt AC 146 ms 24788 KB
random_13.txt AC 148 ms 25044 KB
random_14.txt AC 146 ms 24148 KB
random_15.txt AC 140 ms 26196 KB
sample_1.txt AC 71 ms 20692 KB
sample_2.txt AC 69 ms 15828 KB
sample_3.txt AC 95 ms 20692 KB
small_1.txt AC 70 ms 19924 KB
small_2.txt AC 72 ms 20692 KB