#440309 (Java21) No.1004 サイコロの実装 (2)

• 問題: No.1004 サイコロの実装 (2)
• ユーザー: Oland
• 提出日時: 2020-03-07 00:06:36
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 80 ms / 2,000 ms
• コード長: 6,452 bytes
• コンパイル時間: 2,428 ms
• コンパイル使用メモリ: 81,040 KB
• 実行使用メモリ: 38,296 KB
• 最終ジャッジ日時: 2024-10-14 10:18:07
• 合計ジャッジ時間: 6,462 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	74 ms; 38,148 KB
testcase_01	AC	74 ms; 38,056 KB
testcase_02	AC	73 ms; 38,252 KB
testcase_03	AC	73 ms; 38,044 KB
testcase_04	AC	74 ms; 37,804 KB
testcase_05	AC	70 ms; 37,968 KB
testcase_06	AC	73 ms; 37,912 KB
testcase_07	AC	73 ms; 38,064 KB
testcase_08	AC	74 ms; 38,048 KB
testcase_09	AC	72 ms; 38,212 KB
testcase_10	AC	69 ms; 38,296 KB
testcase_11	AC	70 ms; 38,164 KB
testcase_12	AC	71 ms; 38,244 KB
testcase_13	AC	71 ms; 38,068 KB
testcase_14	AC	73 ms; 38,100 KB
testcase_15	AC	77 ms; 37,928 KB
testcase_16	AC	73 ms; 38,136 KB
testcase_17	AC	75 ms; 38,140 KB
testcase_18	AC	71 ms; 38,172 KB
testcase_19	AC	73 ms; 38,148 KB
testcase_20	AC	70 ms; 37,880 KB
testcase_21	AC	76 ms; 37,844 KB
testcase_22	AC	73 ms; 38,016 KB
testcase_23	AC	73 ms; 37,800 KB
testcase_24	AC	72 ms; 37,924 KB
testcase_25	AC	72 ms; 38,080 KB
testcase_26	AC	71 ms; 38,284 KB
testcase_27	AC	71 ms; 38,032 KB
testcase_28	AC	74 ms; 38,268 KB
testcase_29	AC	73 ms; 37,780 KB
testcase_30	AC	73 ms; 37,960 KB
testcase_31	AC	75 ms; 37,876 KB
testcase_32	AC	80 ms; 38,144 KB
testcase_33	AC	71 ms; 38,296 KB
testcase_34	AC	73 ms; 38,112 KB
testcase_35	AC	74 ms; 37,784 KB
testcase_36	AC	71 ms; 38,192 KB
testcase_37	AC	71 ms; 37,804 KB
testcase_38	AC	73 ms; 37,744 KB
testcase_39	AC	73 ms; 38,152 KB

ソースコード

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    final static long INF = Long.MAX_VALUE / 2;
    
    void solve(){
        int a = in.nextInt(), b = in.nextInt();
        long x0 = in.nextLong(), N = in.nextLong();
        if(x0 % 2 == 0) out.println("0 " + (N / 2));
        else out.println((N / 2) + " 0");
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}