結果

問題 No.479 頂点は要らない
ユーザー yuya178yuya178
提出日時 2017-09-30 15:59:06
言語 Java21
(openjdk 21)
結果
MLE  
実行時間 -
コード長 5,191 bytes
コンパイル時間 2,694 ms
コンパイル使用メモリ 86,756 KB
実行使用メモリ 741,012 KB
最終ジャッジ日時 2023-08-09 22:37:46
合計ジャッジ時間 19,335 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
50,564 KB
testcase_01 AC 61 ms
50,756 KB
testcase_02 AC 63 ms
50,428 KB
testcase_03 AC 63 ms
50,616 KB
testcase_04 AC 64 ms
50,804 KB
testcase_05 AC 64 ms
50,504 KB
testcase_06 AC 63 ms
50,388 KB
testcase_07 AC 64 ms
50,492 KB
testcase_08 AC 64 ms
50,428 KB
testcase_09 AC 62 ms
50,532 KB
testcase_10 AC 64 ms
50,512 KB
testcase_11 AC 71 ms
50,636 KB
testcase_12 AC 63 ms
50,604 KB
testcase_13 AC 62 ms
50,524 KB
testcase_14 AC 63 ms
50,224 KB
testcase_15 AC 65 ms
50,340 KB
testcase_16 AC 64 ms
50,432 KB
testcase_17 AC 65 ms
50,524 KB
testcase_18 AC 68 ms
50,208 KB
testcase_19 AC 96 ms
52,740 KB
testcase_20 AC 97 ms
52,240 KB
testcase_21 AC 66 ms
50,588 KB
testcase_22 AC 98 ms
52,988 KB
testcase_23 AC 88 ms
52,412 KB
testcase_24 AC 87 ms
50,624 KB
testcase_25 AC 97 ms
52,384 KB
testcase_26 MLE -
testcase_27 MLE -
testcase_28 MLE -
testcase_29 MLE -
testcase_30 MLE -
testcase_31 MLE -
testcase_32 MLE -
testcase_33 MLE -
testcase_34 MLE -
testcase_35 AC 1,259 ms
472,664 KB
testcase_36 AC 241 ms
77,288 KB
testcase_37 MLE -
testcase_38 MLE -
testcase_39 MLE -
testcase_40 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int n = ni();
        int m = ni();
        boolean[][] v = new boolean[n][n];
        boolean[] ans = new boolean[n];
        for(int i = 0; i < m; i++){
            int a = ni();
            int b = ni();
            v[a][b] = v[b][a] = true;
        }
        for(int i = n-1; i >= 0; i--){
            for(int j = 0; j < n; j++){
                if(v[i][j]){
                    ans[j] = true;
                    v[i][j] = v[j][i] = false;
                    int tmp = j;
                    for(int k = 0; k < n; k++){
                        if(v[tmp][k]){
                            v[tmp][k] = v[k][tmp] = false;
                        }
                    }
                }
            }
        }
        int flag = 0;
        for(int i = n-1; i >= 0; i--){
            if(!ans[i] && flag == 0){
                continue;
            }
            if(ans[i] && flag == 0){
                flag = 1;
            }
            out.print(ans[i] ? 1 : 0);
        }
        out.println();

    }

   

    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }


    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0