#562437 (Java) No.360 増加門松列

• 問題: No.360 増加門松列
• ユーザー: chocorusk
• 提出日時: 2020-10-04 10:47:54
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 138 ms / 2,000 ms
• コード長: 2,996 bytes
• コンパイル時間: 2,568 ms
• コンパイル使用メモリ: 78,928 KB
• 実行使用メモリ: 54,128 KB
• 最終ジャッジ日時: 2024-07-19 06:59:38
• 合計ジャッジ時間: 5,686 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
public class Main {
    static boolean ans=false;
    public static boolean is_inc_kadomatsu(int a, int b, int c) {
        if(a<b && b>c && a<c) return true;
        if(a>b && b<c && a<c) return true;
        return false;
    }
    public static void dfs(int[] d, int[] ord, boolean[] used, int k) {
        if(k==7) {
            //for(int x:ord) System.out.print(x+" ");
            //System.out.println();
            for(int i=0; i<5; i++) {
                if(!is_inc_kadomatsu(d[ord[i]], d[ord[i+1]], d[ord[i+2]])) {
                    return;
                }
            }
            ans=true;
            return;
        }
        for(int i=0; i<7; i++) {
            if(used[i]) continue;
            used[i]=true;
            ord[k]=i;
            dfs(d, ord, used, k+1);
            ord[k]=-1;
            used[i]=false;
        }
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        //FastScanner scanner=new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        int[] d=new int[7];
        for(int i=0; i<7; i++) d[i]=scanner.nextInt();
        int[] ord=new int[7];
        Arrays.fill(ord, -1);
        boolean[] used=new boolean[7];
        dfs(d, ord, used, 0);
        if(ans) out.println("YES");
        else out.println("NO");
        out.close();
        scanner.close();
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            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;
    }
    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        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() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX