結果
| 問題 | No.474 色塗り２ |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-12-24 00:44:22 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,570 ms / 2,000 ms |
| コード長 | 5,905 bytes |
| コンパイル時間 | 2,338 ms |
| コンパイル使用メモリ | 78,812 KB |
| 実行使用メモリ | 61,892 KB |
| 最終ジャッジ日時 | 2024-05-08 12:59:45 |
| 合計ジャッジ時間 | 9,484 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,017 ms
55,520 KB |
| testcase_01 | AC | 1,020 ms
55,608 KB |
| testcase_02 | AC | 1,025 ms
55,228 KB |
| testcase_03 | AC | 1,570 ms
61,892 KB |
| testcase_04 | AC | 1,014 ms
55,548 KB |
ソースコード
package no474;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static IO io = new IO();
static int MAX = 1000000;
static int MAXBIT = 21;
static int MAX2POW = 1 << MAXBIT;
static int[] fact;
static int[] ifact;
public static void main(String[] args) {
int[][] ff = makeFF(2,MAXBIT);
fact = ff[0];
ifact = ff[1];
int t = io.nextInt();
for(int i=0;i<t;i++) {
solve();
}
io.flush();
}
public static void solve() {
long a = io.nextLong();
long b = io.nextLong();
long c = io.nextLong();
long h1 = c;
long h2mod2pow = c * C(h1+b-1,b,2,MAXBIT,fact,ifact) % MAX2POW;
long h3mod2 = c * comb2(h2mod2pow+a-1, a) % 2;
io.println(h3mod2);
}
public static long f(long c,long x,long y) {
return c * comb2(x+y-1,y) % 2;
}
public static long comb2(long a,long b) {
return (~a & b) > 0 ? 0 : 1;
}
// 😇コピペしました😇 (2度目)
// uwicoder - nCr mod mの求め方
// https://www37.atwiki.jp/uwicoder/pages/2118.html#id_6779f709
public static long C(long n, long r, int p, int q, int[] fact, int[] ifact)
{
if(n < 0 || r < 0 || r > n)return 0;
int P = 1;
for(int i = 0;i < q;i++)P*=p;
long z = n - r;
int e0 = 0;
for(long u = n/p;u > 0;u /= p)e0 += u;
for(long u = r/p;u > 0;u /= p)e0 -= u;
for(long u = z/p;u > 0;u /= p)e0 -= u;
int em = 0;
for(long u = n/P;u > 0;u /= p)em += u;
for(long u = r/P;u > 0;u /= p)em -= u;
for(long u = z/P;u > 0;u /= p)em -= u;
long ret = 1;
while(n > 0){
ret = ret * fact[(int)(n%P)] % P * ifact[(int)(r%P)] % P * ifact[(int)(z%P)] % P;
n /= p; r /= p; z /= p;
}
for(int i = 0;i < e0;i++)ret = ret * p % P;
if(!(p == 2 && q >= 3) && (em&1)==1)ret = (P-ret) % P;
return ret;
}
public static int[][] makeFF(int p, int q)
{
int P = 1;
for(int i = 0;i < q;i++)P*=p;
int[] fact = new int[P+1];
int[] ifact = new int[P+1];
fact[0] = 1;
for(int i = 1;i <= P;i++){
if(i % p == 0){
fact[i] = fact[i-1];
}else{
fact[i] = fact[i-1] * i % P;
}
}
for(int i = 0;i <= P;i++){
long ret = 1;
long mul = fact[i];
for(long n = P/p*(p-1)-1;n > 0;n >>>= 1){
if((n&1)==1){
ret = (ret * mul) % P;
}
mul = (mul * mul) % P;
}
ifact[i] = (int)ret;
}
return new int[][]{fact, ifact};
}
}
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';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 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[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(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[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(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 e) {}}
}