結果

問題 No.483 マッチ並べ
ユーザー hiromi_ayase
提出日時 2017-02-10 23:03:17
言語 Java
(openjdk 23)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 4,553 bytes
コンパイル時間 3,722 ms
コンパイル使用メモリ 78,752 KB
実行使用メモリ 50,364 KB
最終ジャッジ日時 2024-12-29 08:20:41
合計ジャッジ時間 7,558 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 53
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.HashMap;
import java.util.Map;
import java.util.NoSuchElementException;
public class Main {
  private static int[] from;
  private static int[] to;
  private static int[] count;
  
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    
    from = new int[N];
    to = new int[N];
    Map<Integer, Integer> map = new HashMap<>();
    int vIdx = 0;
    for (int i = 0; i < N; i ++) {
      int r0 = sc.nextInt();
      int c0 = sc.nextInt();
      int r1 = sc.nextInt();
      int c1 = sc.nextInt();
      
      int v1 = r0 * 1000 + c0;
      int v2 = r1 * 1000 + c1;
      
      if (!map.containsKey(v1)) {
        map.put(v1, vIdx ++);
      }
      if (!map.containsKey(v2)) {
        map.put(v2, vIdx ++);
      }
      from[i] = map.get(v1);
      to[i] = map.get(v2);
    }
    count = new int[vIdx];
    boolean ret = dfs(0);
    System.out.println(ret ? "YES" : "NO");
  }
  private static boolean dfs(int now) {
    if (now == from.length) {
      return true;
    }
    if (count[from[now]] == 0 && count[to[now]] == 0) {
      count[to[now]] ++;
      if (dfs(now + 1)) {
        return true;
      }
      count[to[now]] --;
      count[from[now]] ++;
      if (dfs(now + 1)) {
        return true;
      }
      count[from[now]] --;
    } else if (count[from[now]] == 0) {
      count[from[now]] ++;
      if (dfs(now + 1)) {
        return true;
      }
      count[from[now]] --;
    } else if (count[to[now]] == 0) {
      count[to[now]] ++;
      if (dfs(now + 1)) {
        return true;
      }
      count[to[now]] --;
    }
    return false;
  }
  public static int[][] packU(int n, int[] from, int[] to)
  {
      int[][] g = new int[n][];
      int[] p = new int[n];
      for(int f : from)p[f]++;
      for(int t : to)p[t]++;
      for(int i = 0;i < n;i++)g[i] = new int[p[i]];
      for(int i = 0;i < from.length;i++){
          g[from[i]][--p[from[i]]] = to[i];
          g[to[i]][--p[to[i]]] = from[i];
      }
      return g;
  }
}
class FastScanner {
    public static String debug = null;
    private final InputStream in = System.in;
    private int ptr = 0;
    private int buflen = 0;
    private byte[] buffer = new byte[1024];
    private boolean eos = false;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                if (debug != null) {
                    buflen = debug.length();
                    buffer = debug.getBytes();
                    debug = "";
                    eos = true;
                } else {
                    buflen = in.read(buffer);
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen < 0) {
                eos = true;
                return false;
            } else 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 void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
    }
    public boolean isEOS() {
        return this.eos;
    }
    public 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();
    }
    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() {
        return (int) nextLong();
    }
    public long[] nextLongList(int n) {
        return nextLongTable(1, n)[0];
    }
    public int[] nextIntList(int n) {
        return nextIntTable(1, n)[0];
    }
    public long[][] nextLongTable(int n, int m) {
        long[][] ret = new long[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextLong();
            }
        }
        return ret;
    }
    public int[][] nextIntTable(int n, int m) {
        int[][] ret = new int[n][m];
        for (int i = 0; i < n; i ++) {
            for (int j = 0; j < m; j ++) {
                ret[i][j] = nextInt();
            }
        }
        return ret;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0