結果

問題 No.518 ローマ数字の和
ユーザー uwiuwi
提出日時 2017-05-28 21:29:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 108 ms / 2,000 ms
コード長 4,142 bytes
コンパイル時間 3,601 ms
コンパイル使用メモリ 92,120 KB
実行使用メモリ 40,184 KB
最終ジャッジ日時 2024-09-21 15:17:07
合計ジャッジ時間 6,203 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 95 ms
39,932 KB
testcase_01 AC 88 ms
39,896 KB
testcase_02 AC 79 ms
39,820 KB
testcase_03 AC 79 ms
38,664 KB
testcase_04 AC 85 ms
40,096 KB
testcase_05 AC 82 ms
40,012 KB
testcase_06 AC 82 ms
38,692 KB
testcase_07 AC 51 ms
37,200 KB
testcase_08 AC 108 ms
39,840 KB
testcase_09 AC 97 ms
39,856 KB
testcase_10 AC 93 ms
39,916 KB
testcase_11 AC 77 ms
39,884 KB
testcase_12 AC 91 ms
39,708 KB
testcase_13 AC 95 ms
39,884 KB
testcase_14 AC 51 ms
37,312 KB
testcase_15 AC 82 ms
40,048 KB
testcase_16 AC 80 ms
39,920 KB
testcase_17 AC 83 ms
40,180 KB
testcase_18 AC 97 ms
40,020 KB
testcase_19 AC 81 ms
40,184 KB
testcase_20 AC 80 ms
39,860 KB
testcase_21 AC 51 ms
37,040 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 C {
	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], pos)){
					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 C().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