結果
| 問題 |
No.3070 Collecting Coins Speedrun 2
|
| コンテスト | |
| ユーザー |
tenten
|
| 提出日時 | 2025-03-27 17:00:13 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 3,952 bytes |
| コンパイル時間 | 2,772 ms |
| コンパイル使用メモリ | 80,724 KB |
| 実行使用メモリ | 52,388 KB |
| 最終ジャッジ日時 | 2025-03-27 17:00:21 |
| 合計ジャッジ時間 | 7,932 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 31 WA * 1 |
ソースコード
import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
public class Main {
static final int MOD = 998244353;
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner();
int n = sc.nextInt();
int plus = 0;
int minus = 0;
int zero = 0;
for (int i = 0; i < n; i++) {
int x = sc.nextInt();
if (x > 0) {
plus++;
} else if (x < 0) {
minus++;
} else {
zero++;
}
}
long ans = 1;
if (plus > 0) {
ans *= pow(2, plus - 1);
ans %= MOD;
}
if (minus > 0) {
ans *= pow(2, minus - 1);
ans %= MOD;
}
if (plus > 0 && minus > 0) {
ans *= 2;
ans %= MOD;
if (zero > 0) {
ans *= 3;
ans %= MOD;
}
} else {
if (zero > 0) {
ans *= 2;
ans %= MOD;
}
}
System.out.println(ans);
}
static long pow(long x, int p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
return pow(x * x % MOD, p / 2);
} else {
return pow(x, p - 1) * x % MOD;
}
}
}
class FastScanner {
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト
public FastScanner() {
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
private byte read() {
try {
if (bufferPointer == bytesRead) {
bytesRead = din.read(buffer, 0, BUFFER_SIZE);
if (bytesRead == -1) return -1;
bufferPointer = 0;
}
return buffer[bufferPointer++];
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public String next() {
byte b = read();
// 空白文字を読み飛ばす
while (isSpaceChar(b)) {
b = read();
}
StringBuilder sb = new StringBuilder();
while (!isSpaceChar(b)) {
sb.append((char) b);
b = read();
}
return sb.toString();
}
public int nextInt() {
int ret = 0;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (!isSpaceChar(c));
return neg ? -ret : ret;
}
public long nextLong() {
long ret = 0;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10L + c - '0';
c = read();
} while (!isSpaceChar(c));
return neg ? -ret : ret;
}
public double nextDouble() {
double ret = 0, div = 1;
byte c = read();
while (isSpaceChar(c)) c = read();
boolean neg = (c == '-');
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (!isSpaceChar(c) && c != '.');
if (c == '.') {
while (!isSpaceChar(c = read())) {
ret += (c - '0') / (div *= 10);
}
}
return neg ? -ret : ret;
}
private boolean isSpaceChar(byte c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public void close() {
try {
if (din != null) din.close();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
}
tenten