結果

問題 No.959 tree and fire
ユーザー OlandOland
提出日時 2019-12-22 13:21:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 50 ms / 2,000 ms
コード長 6,943 bytes
コンパイル時間 5,027 ms
コンパイル使用メモリ 75,388 KB
実行使用メモリ 49,948 KB
最終ジャッジ日時 2023-10-12 05:26:43
合計ジャッジ時間 6,848 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
49,356 KB
testcase_01 AC 45 ms
49,388 KB
testcase_02 AC 45 ms
49,396 KB
testcase_03 AC 46 ms
49,316 KB
testcase_04 AC 45 ms
49,252 KB
testcase_05 AC 45 ms
49,332 KB
testcase_06 AC 45 ms
49,252 KB
testcase_07 AC 45 ms
47,280 KB
testcase_08 AC 45 ms
49,328 KB
testcase_09 AC 44 ms
49,324 KB
testcase_10 AC 44 ms
47,308 KB
testcase_11 AC 45 ms
49,260 KB
testcase_12 AC 45 ms
49,376 KB
testcase_13 AC 45 ms
49,588 KB
testcase_14 AC 45 ms
49,396 KB
testcase_15 AC 45 ms
49,376 KB
testcase_16 AC 44 ms
49,812 KB
testcase_17 AC 45 ms
49,444 KB
testcase_18 AC 45 ms
49,948 KB
testcase_19 AC 50 ms
49,492 KB
testcase_20 AC 47 ms
49,332 KB
testcase_21 AC 45 ms
49,500 KB
testcase_22 AC 47 ms
49,860 KB
testcase_23 AC 45 ms
49,396 KB
testcase_24 AC 45 ms
49,388 KB
testcase_25 AC 45 ms
49,392 KB
testcase_26 AC 45 ms
49,292 KB
testcase_27 AC 45 ms
47,536 KB
testcase_28 AC 45 ms
49,380 KB
testcase_29 AC 45 ms
49,580 KB
testcase_30 AC 44 ms
49,204 KB
testcase_31 AC 45 ms
49,452 KB
testcase_32 AC 44 ms
49,916 KB
testcase_33 AC 45 ms
49,368 KB
testcase_34 AC 45 ms
49,264 KB
testcase_35 AC 44 ms
49,640 KB
testcase_36 AC 45 ms
49,476 KB
testcase_37 AC 44 ms
49,668 KB
testcase_38 AC 43 ms
49,356 KB
testcase_39 AC 45 ms
49,248 KB
testcase_40 AC 44 ms
49,696 KB
testcase_41 AC 45 ms
49,432 KB
testcase_42 AC 45 ms
49,576 KB
testcase_43 AC 46 ms
49,572 KB
testcase_44 AC 46 ms
49,380 KB
testcase_45 AC 46 ms
49,388 KB
testcase_46 AC 45 ms
49,680 KB
testcase_47 AC 46 ms
49,428 KB
testcase_48 AC 45 ms
49,352 KB
testcase_49 AC 44 ms
49,320 KB
testcase_50 AC 44 ms
49,356 KB
testcase_51 AC 45 ms
49,804 KB
testcase_52 AC 44 ms
49,320 KB
testcase_53 AC 44 ms
49,392 KB
testcase_54 AC 44 ms
49,332 KB
testcase_55 AC 44 ms
49,608 KB
testcase_56 AC 43 ms
49,388 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve() {
        long n = in.nextLong(), m = in.nextLong();
        double p = in.nextDouble(), ans = 0;
        if(n == 1 && m == 1){
            ans = p;
        }else if(n == 1){
            ans = Math.pow(p, 2) * 2 + Math.pow(p, 3) * (m - 2);
        }else if(m == 1){
            ans = Math.pow(p, 2) * 2 + Math.pow(p, 3) * (n - 2);
        }else{
            long corner = 4, side = 2 * n + 2 * m - 2 * corner, center = n * m - side - corner;
            ans = Math.pow(p, 3) * corner + Math.pow(p, 4) * side + Math.pow(p, 5) * center;
        }
        out.println(ans);
    }
    
    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 = "output.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;
        }
    }
}
0