Submission #435237


Source Code Expand

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class Main {

    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";

    final int INF = Integer.MAX_VALUE;
    final int MIN = Integer.MIN_VALUE;

    static void solve() {
        float deg = (float) ni() / 10;
        float dis = (float) Math.round((float) ni() / 6) / 10.0f;
        String dire = toDireciton(deg);
        int W = toWind(dis);
        if (W == 0) {
            System.out.println("C 0");
            return;
        }
        System.out.println(dire + " " + W);
    }

    static String toDireciton(float deg) {
        String[] lib = "N,NNE,NE,ENE,E,ESE,SE,SSE,S,SSW,SW,WSW,W,WNW,NW,NNW".split(",");
        float t = 22.5f; // (360 / 16);
        return lib[(int) ((deg + 11.25f) / t) % 16];
    }

    static int toWind(float p) {
        float[] lib = {0.2f, 1.5f, 3.3f, 5.4f, 7.9f, 10.7f, 13.8f, 17.1f, 20.7f, 24.4f, 28.4f, 32.6f};
        for (int i = 0, l = lib.length; i < l; i++) {
            if (p <= lib[i]) {
                return i;
            }
        }
        return 12;
    }

    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));
    }
}

Submission Info

Submission Time
Task C - 風力観測
User elzup
Language Java (OpenJDK 1.7.0)
Score 100
Code Size 5238 Byte
Status AC
Exec Time 323 ms
Memory 20892 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 66
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 00_sample_06.txt, 00_sample_07.txt, 00_sample_08.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 308 ms 20764 KB
00_sample_02.txt AC 290 ms 20832 KB
00_sample_03.txt AC 305 ms 20820 KB
00_sample_04.txt AC 293 ms 20756 KB
00_sample_05.txt AC 289 ms 20884 KB
00_sample_06.txt AC 289 ms 20728 KB
00_sample_07.txt AC 290 ms 20648 KB
00_sample_08.txt AC 291 ms 20776 KB
test_01.txt AC 296 ms 20736 KB
test_02.txt AC 288 ms 20828 KB
test_03.txt AC 289 ms 20836 KB
test_04.txt AC 288 ms 20832 KB
test_05.txt AC 287 ms 20776 KB
test_06.txt AC 287 ms 20828 KB
test_07.txt AC 288 ms 20832 KB
test_08.txt AC 288 ms 20816 KB
test_09.txt AC 289 ms 20828 KB
test_10.txt AC 323 ms 20884 KB
test_11.txt AC 289 ms 20764 KB
test_12.txt AC 287 ms 20840 KB
test_13.txt AC 289 ms 20808 KB
test_14.txt AC 289 ms 20748 KB
test_15.txt AC 297 ms 20812 KB
test_16.txt AC 288 ms 20840 KB
test_17.txt AC 287 ms 20884 KB
test_18.txt AC 288 ms 20876 KB
test_19.txt AC 288 ms 20768 KB
test_20.txt AC 292 ms 20828 KB
test_21.txt AC 292 ms 20844 KB
test_22.txt AC 307 ms 20772 KB
test_23.txt AC 295 ms 20760 KB
test_24.txt AC 296 ms 20828 KB
test_25.txt AC 295 ms 20836 KB
test_26.txt AC 296 ms 20764 KB
test_27.txt AC 294 ms 20736 KB
test_28.txt AC 293 ms 20820 KB
test_29.txt AC 301 ms 20884 KB
test_30.txt AC 292 ms 20764 KB
test_31.txt AC 293 ms 20888 KB
test_32.txt AC 297 ms 20832 KB
test_33.txt AC 296 ms 20764 KB
test_34.txt AC 293 ms 20832 KB
test_35.txt AC 304 ms 20856 KB
test_36.txt AC 299 ms 20832 KB
test_37.txt AC 302 ms 20760 KB
test_38.txt AC 303 ms 20836 KB
test_39.txt AC 299 ms 20764 KB
test_40.txt AC 300 ms 20836 KB
test_41.txt AC 299 ms 20764 KB
test_42.txt AC 299 ms 20760 KB
test_43.txt AC 299 ms 20652 KB
test_44.txt AC 299 ms 20836 KB
test_45.txt AC 294 ms 20828 KB
test_46.txt AC 295 ms 20828 KB
test_47.txt AC 291 ms 20780 KB
test_48.txt AC 293 ms 20764 KB
test_49.txt AC 293 ms 20764 KB
test_50.txt AC 290 ms 20892 KB
test_51.txt AC 291 ms 20836 KB
test_52.txt AC 291 ms 20836 KB
test_53.txt AC 292 ms 20840 KB
test_54.txt AC 292 ms 20760 KB
test_55.txt AC 291 ms 20784 KB
test_56.txt AC 290 ms 20828 KB
test_57.txt AC 295 ms 20836 KB
test_58.txt AC 294 ms 20836 KB