結果
問題 | No.3090 Knapsack Function |
ユーザー | Yu_212 |
提出日時 | 2022-04-01 21:46:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 347 ms / 2,000 ms |
コード長 | 6,356 bytes |
コンパイル時間 | 2,904 ms |
コンパイル使用メモリ | 93,888 KB |
実行使用メモリ | 59,032 KB |
最終ジャッジ日時 | 2024-04-30 13:37:15 |
合計ジャッジ時間 | 6,753 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
51,376 KB |
testcase_01 | AC | 72 ms
51,048 KB |
testcase_02 | AC | 72 ms
51,268 KB |
testcase_03 | AC | 72 ms
51,328 KB |
testcase_04 | AC | 70 ms
50,824 KB |
testcase_05 | AC | 72 ms
51,300 KB |
testcase_06 | AC | 74 ms
51,328 KB |
testcase_07 | AC | 73 ms
51,248 KB |
testcase_08 | AC | 75 ms
51,128 KB |
testcase_09 | AC | 73 ms
51,064 KB |
testcase_10 | AC | 74 ms
51,040 KB |
testcase_11 | AC | 73 ms
51,260 KB |
testcase_12 | AC | 73 ms
50,932 KB |
testcase_13 | AC | 73 ms
51,124 KB |
testcase_14 | AC | 75 ms
51,408 KB |
testcase_15 | AC | 75 ms
51,428 KB |
testcase_16 | AC | 331 ms
58,456 KB |
testcase_17 | AC | 336 ms
58,464 KB |
testcase_18 | AC | 347 ms
59,032 KB |
testcase_19 | AC | 332 ms
58,720 KB |
testcase_20 | AC | 334 ms
58,576 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.*; import java.util.function.IntUnaryOperator; import java.util.function.LongUnaryOperator; import java.util.stream.Collectors; public class Main { static In in = new In(); static Out out = new Out(); static final long inf = 0x1fffffffffffffffL; static final int iinf = 0x3fffffff; static final double eps = 1e-9; static long mod = 1000000007; void solve() { int n = in.nextInt(); boolean has1 = false; for (int i = 0; i < n; i++) { long v = in.nextLong(); long w = in.nextLong(); has1 |= w == 1; } out.println(has1 ? "Yes" : "No"); } public static void main(String... args) { new Main().solve(); out.flush(); } } class LongPair implements Comparable<LongPair> { long first; long second; LongPair(long first, long second) { this.first = first; this.second = second; } @Override public boolean equals(Object o) { if (!(o instanceof LongPair)) { return false; } LongPair that = (LongPair)o; return first == that.first && second == that.second; } @Override public int hashCode() { return Long.hashCode(first) * 31 + Long.hashCode(second); } @Override public int compareTo(LongPair o) { return first == o.first ? Long.compare(second, o.second) : Long.compare(first, o.first); } @Override public String toString() { return String.format("[%d, %d]", first, second); } } class In { private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000); private StringTokenizer tokenizer; String next() { try { while (tokenizer == null || !tokenizer.hasMoreTokens()) { tokenizer = new StringTokenizer(reader.readLine()); } } catch (IOException ignored) { } return tokenizer.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } char[] nextCharArray() { return next().toCharArray(); } String[] nextStringArray(int n) { String[] s = new String[n]; for (int i = 0; i < n; i++) { s[i] = next(); } return s; } char[][] nextCharGrid(int n, int m) { char[][] a = new char[n][m]; for (int i = 0; i < n; i++) { a[i] = next().toCharArray(); } return a; } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = nextInt(); } return a; } int[] nextIntArray(int n, IntUnaryOperator op) { int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = op.applyAsInt(nextInt()); } return a; } int[][] nextIntMatrix(int h, int w) { int[][] a = new int[h][w]; for (int i = 0; i < h; i++) { a[i] = nextIntArray(w); } return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = nextLong(); } return a; } long[] nextLongArray(int n, LongUnaryOperator op) { long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = op.applyAsLong(nextLong()); } return a; } long[][] nextLongMatrix(int h, int w) { long[][] a = new long[h][w]; for (int i = 0; i < h; i++) { a[i] = nextLongArray(w); } return a; } List<List<Integer>> nextEdges(int n, int m, boolean directed) { List<List<Integer>> res = new ArrayList<>(); for (int i = 0; i < n; i++) { res.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { int u = nextInt() - 1; int v = nextInt() - 1; res.get(u).add(v); if (!directed) { res.get(v).add(u); } } return res; } } class Out { private final PrintWriter out = new PrintWriter(System.out); boolean autoFlush = false; void println(Object... args) { if (args == null || args.getClass() != Object[].class) { args = new Object[] {args}; } out.println(Arrays.stream(args).map(obj -> { Class<?> clazz = obj == null ? null : obj.getClass(); return clazz == Double.class ? String.format("%.10f", obj) : clazz == byte[].class ? Arrays.toString((byte[])obj) : clazz == short[].class ? Arrays.toString((short[])obj) : clazz == int[].class ? Arrays.toString((int[])obj) : clazz == long[].class ? Arrays.toString((long[])obj) : clazz == char[].class ? Arrays.toString((char[])obj) : clazz == float[].class ? Arrays.toString((float[])obj) : clazz == double[].class ? Arrays.toString((double[])obj) : clazz == boolean[].class ? Arrays.toString((boolean[])obj) : obj instanceof Object[] ? Arrays.deepToString((Object[])obj) : String.valueOf(obj); }).collect(Collectors.joining(" "))); if (autoFlush) { out.flush(); } } void println(char[] s) { out.println(String.valueOf(s)); if (autoFlush) { out.flush(); } } void println(int[] a) { StringJoiner joiner = new StringJoiner(" "); for (int i : a) { joiner.add(Integer.toString(i)); } out.println(joiner); if (autoFlush) { out.flush(); } } void println(long[] a) { StringJoiner joiner = new StringJoiner(" "); for (long i : a) { joiner.add(Long.toString(i)); } out.println(joiner); if (autoFlush) { out.flush(); } } void flush() { out.flush(); } }