結果

問題 No.1801 Segment Game
ユーザー shojin_proshojin_pro
提出日時 2022-01-07 22:37:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 355 ms / 2,000 ms
コード長 3,699 bytes
コンパイル時間 2,654 ms
コンパイル使用メモリ 75,164 KB
実行使用メモリ 59,412 KB
最終ジャッジ日時 2023-08-09 06:04:31
合計ジャッジ時間 7,221 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,676 KB
testcase_01 AC 354 ms
59,024 KB
testcase_02 AC 336 ms
58,848 KB
testcase_03 AC 341 ms
56,648 KB
testcase_04 AC 355 ms
58,836 KB
testcase_05 AC 353 ms
59,292 KB
testcase_06 AC 347 ms
59,412 KB
testcase_07 AC 348 ms
59,108 KB
testcase_08 AC 345 ms
58,968 KB
testcase_09 AC 349 ms
59,168 KB
testcase_10 AC 46 ms
49,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;

    public static void main(String[] args) throws Exception {
        int t = sc.nextInt();
        for(int i = 0; i < t; i++) solve();
        pw.flush();
    }

    public static void solve() {
        long h = sc.nextInt();
        long w = sc.nextInt();
        long d = sc.nextInt();
        if(h % 2 == 0 && w <= d){
            pw.println("N");
        }else if(w % 2 == 0 && h <= d){
            pw.println("N");
        }else if(h % 2 == 1 && w*w+1 <= d*d){
            pw.println("N");
        }else if(w % 2 == 1 && h*h+1 <= d*d){
            pw.println("N");
        }else{
            pw.println("S");
        }
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

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

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

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

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
0