結果

問題 No.518 ローマ数字の和
ユーザー yuya178yuya178
提出日時 2017-06-11 23:26:20
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,039 bytes
コンパイル時間 2,576 ms
コンパイル使用メモリ 84,624 KB
実行使用メモリ 56,244 KB
最終ジャッジ日時 2023-10-24 21:25:36
合計ジャッジ時間 5,017 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 88 ms
56,184 KB
testcase_04 AC 87 ms
56,208 KB
testcase_05 AC 85 ms
54,728 KB
testcase_06 AC 85 ms
54,488 KB
testcase_07 WA -
testcase_08 AC 101 ms
56,100 KB
testcase_09 WA -
testcase_10 AC 85 ms
55,768 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 87 ms
56,128 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 98 ms
56,116 KB
testcase_18 WA -
testcase_19 AC 90 ms
53,888 KB
testcase_20 WA -
testcase_21 AC 53 ms
52,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170528;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.regex.Pattern;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        int n = ni();
        int sum = 0;
        for(int i = 0;i < n;i++){
            sum += romanToNumber(ns());
        }
        if(sum > 3999){
            out.println("ERROR");
        }else{
            out.println(numberToRoman(sum));
        }
    }
    
    public static String[] IS = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
    public static String[] XS = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
    public static String[] CS = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
    public static String[] MS = {"", "M", "MM", "MMM"};
    
    public static Pattern patternRoman = Pattern.compile("M{0,3}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})");
    
    public static int romanToNumber(String roman)
    {
        int pos = 0;
        int ret = 0;
        int d = 1000;
        for(String[] u : new String[][]{MS, CS, XS, IS}){
            for(int i = u.length-1;i >= 1;i--){
                if(roman.startsWith(u[i])){
                    ret += i*d;
                    pos += u[i].length();
                    break;
                }
            }
            d/=10;
        }
        return ret;
    }
    
    public static String numberToRoman(int n)
    {
        if(n >= 4000 || n <= 0)return "";
        return MS[n/1000]+CS[n/100%10]+XS[n/10%10]+IS[n%10];
    }
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//      Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//          @Override
//          public void run() {
//              long s = System.currentTimeMillis();
//              solve();
//              out.flush();
//              if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//          }
//      };
//      t.start();
//      t.join();
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;
    
    private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private 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 int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private long[] nal(int n)
    {
        long[] a = new long[n];
        for(int i = 0;i < n;i++)a[i] = nl();
        return a;
    }
    
    private 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 int[][] nmi(int n, int m) {
        int[][] map = new int[n][];
        for(int i = 0;i < n;i++)map[i] = na(m);
        return map;
    }
    
    private int ni() { return (int)nl(); }
    
    private 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) { System.out.println(Arrays.deepToString(o)); }
}
0