#504716 (C++17) No.518 ローマ数字の和

• 問題: No.518 ローマ数字の和
• ユーザー: tanimani364
• 提出日時: 2020-06-29 16:11:41
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,132 bytes
• コンパイル時間: 2,401 ms
• コンパイル使用メモリ: 218,604 KB
• 最終ジャッジ日時: 2025-01-11 13:30:31
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 19

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
ll gcd(ll n, ll m)
{
    ll tmp;
    while (m != 0)
    {
        tmp = n % m;
        n = m;
        m = tmp;
    }
    return n;
}
ll lcm(ll n, ll m)
{
    return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
void solve()
{
    int n;
    cin>>n;
    vector<string>r(n);
    rep(i,n)cin>>r[i];
    map<string,int>mp;
    mp["I"]=1;mp["V"]=5;mp["X"]=10;mp["L"]=50;mp["C"]=100;mp["D"]=500;mp["M"]=1000;
    mp["IV"]=4;mp["IX"]=9;mp["XL"]=40;mp["XC"]=90;mp["CD"]=400;mp["CM"]=900;
    int ans=0;
    rep(i,n){
        rep(j,r[i].size()){
            if(j<r[i].size()-1&&mp[string{r[i][j]}]<mp[string{r[i][j+1]}]){
                string t=string{r[i][j]}+string{r[i][j+1]};
                ans+=mp[t];
                ++j;
            }
            else{
                ans+=mp[string{r[i][j]}];
            }
        }
    }
    if(ans>3999){
        cout<<"ERROR\n";
    }
    else{
        map<int,string>mp2;
        for(auto z:mp){
            mp2[z.second]=z.first;
        }
        string s="";
        int mul=1;
        if(ans>=1000)mul=1000;
        else if(ans>=100)mul=100;
        else if(ans>=10)mul=10;
        while(ans>0){
            int x=ans/mul;
            //cout<<ans<<endl;
            if(x==9){
                s+=mp2[x*mul];
                ans-=x*mul;
                mul/=10;
            }
            else if(x>=5){
                s+=mp2[5*mul];
                ans-=5*mul;
                if(x==5) mul/=10;
            }
            else if(x==4){
                s+=mp2[x*mul];
                ans-=x*mul;
                mul/=10;
            }
            else if(x>0){
                rep(i,x){
                    s+=mp2[mul];
                }
                ans-=x*mul;
                mul/=10;
            }
            else mul/=10;
        }
        cout<<s<<"\n";
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX