結果

問題 No.387 ハンコ
ユーザー kenkooookenkoooo
提出日時 2016-07-02 03:11:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,063 ms / 5,000 ms
コード長 3,929 bytes
コンパイル時間 2,466 ms
コンパイル使用メモリ 80,116 KB
実行使用メモリ 59,320 KB
最終ジャッジ日時 2024-04-20 06:52:07
合計ジャッジ時間 11,722 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,063 ms
59,320 KB
testcase_01 AC 1,049 ms
58,828 KB
testcase_02 AC 792 ms
52,104 KB
testcase_03 AC 769 ms
51,812 KB
testcase_04 AC 411 ms
53,092 KB
testcase_05 AC 620 ms
53,328 KB
testcase_06 AC 878 ms
54,740 KB
testcase_07 AC 847 ms
52,128 KB
testcase_08 AC 898 ms
54,756 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.NoSuchElementException;

public class Main {
  private static class Task {
    void solve(FastScanner in, PrintWriter out) {
      int N = in.nextInt();
      int[] A = in.nextIntArray(N);
      int[] B = in.nextIntArray(N);
      ArrayList<Integer>[] buckets = new ArrayList[100001];
      for (int i = 0; i < buckets.length; i++) buckets[i] = new ArrayList<>();
      for (int i = 0; i < N; i++) buckets[A[i]].add(i);

      BitSet bitSet = new BitSet();
      for (int i = 0; i < N; i++) if (B[i] == 1) bitSet.set(i + N);

      BitSet ans = new BitSet();
      for (ArrayList<Integer> bucket : buckets) {
        if (bucket.isEmpty()) continue;
        BitSet bucketBit = new BitSet();
        for (int i : bucket) bucketBit.or(bitSet.get(N - i, bitSet.length()));
        ans.xor(bucketBit);
      }

      for (int i = 0; i < 2 * N - 1; i++) {
        if (ans.get(i)) out.println("ODD");
        else out.println("EVEN");
      }
    }

  }

  // Template
  public static void main(String[] args) {
    OutputStream outputStream = System.out;
    FastScanner in = new FastScanner();
    PrintWriter out = new PrintWriter(outputStream);
    Task solver = new Task();
    solver.solve(in, out);
    out.close();
  }
  private static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int bufferLength = 0;

    private boolean hasNextByte() {
      if (ptr < bufferLength) {
        return true;
      } else {
        ptr = 0;
        try {
          bufferLength = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (bufferLength <= 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 void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    boolean hasNext() {
      skipUnprintable();
      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();
    }

    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();
      }
    }

    double nextDouble() {
      return Double.parseDouble(next());
    }

    double[] nextDoubleArray(int n) {
      double[] array = new double[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextDouble();
      }
      return array;
    }

    double[][] nextDoubleMap(int n, int m) {
      double[][] map = new double[n][];
      for (int i = 0; i < n; i++) {
        map[i] = nextDoubleArray(m);
      }
      return map;
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int n) {
      int[] array = new int[n];
      for (int i = 0; i < n; i++) {
        array[i] = nextInt();
      }
      return array;
    }
  }
}
0