結果
問題 | No.4 おもりと天秤 |
ユーザー | tutuz |
提出日時 | 2018-09-22 09:30:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 63 ms / 5,000 ms |
コード長 | 3,166 bytes |
コンパイル時間 | 2,023 ms |
コンパイル使用メモリ | 79,956 KB |
実行使用メモリ | 51,304 KB |
最終ジャッジ日時 | 2024-07-18 08:53:05 |
合計ジャッジ時間 | 4,416 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
51,032 KB |
testcase_01 | AC | 58 ms
50,264 KB |
testcase_02 | AC | 57 ms
50,868 KB |
testcase_03 | AC | 60 ms
51,240 KB |
testcase_04 | AC | 60 ms
50,924 KB |
testcase_05 | AC | 63 ms
50,756 KB |
testcase_06 | AC | 59 ms
50,952 KB |
testcase_07 | AC | 62 ms
50,736 KB |
testcase_08 | AC | 60 ms
50,500 KB |
testcase_09 | AC | 61 ms
50,728 KB |
testcase_10 | AC | 59 ms
50,840 KB |
testcase_11 | AC | 58 ms
50,616 KB |
testcase_12 | AC | 59 ms
50,196 KB |
testcase_13 | AC | 59 ms
50,264 KB |
testcase_14 | AC | 57 ms
50,372 KB |
testcase_15 | AC | 55 ms
50,984 KB |
testcase_16 | AC | 57 ms
50,520 KB |
testcase_17 | AC | 56 ms
50,200 KB |
testcase_18 | AC | 57 ms
50,508 KB |
testcase_19 | AC | 58 ms
50,772 KB |
testcase_20 | AC | 57 ms
50,668 KB |
testcase_21 | AC | 59 ms
51,304 KB |
testcase_22 | AC | 60 ms
51,144 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.math.BigInteger; import java.util.Arrays; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int[] a = in.nextIntArray(n); int tar = Arrays.stream(a).sum(); if (tar % 2 == 1) { out.println("impossible"); return; } tar /= 2; BigInteger bit = new BigInteger("1"); for (int i = 0; i < n; i++) { bit = bit.or(bit.shiftLeft(a[i])); } out.println(bit.testBit(tar) ? "possible" : "impossible"); } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }