QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#719519	#516. Roman Holidays	kevinyang^#	AC ✓	1ms	4000kb	C++20	2.1kb	2024-11-07 02:50:45	2024-11-07 02:50:45

Judging History

This is the latest submission verdict.

[2024-11-07 02:50:45]
Judged

Verdict: AC
Time: 1ms
Memory: 4000kb

Show

[2024-11-07 02:50:45]
Submitted

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long

string make(vector<char> c, int amt){
    string ans = "";
    if(amt == 1)ans.push_back(c[0]);
    else if(amt == 2)ans.push_back(c[0]),ans.push_back(c[0]);
    else if(amt == 3)ans.push_back(c[0]),ans.push_back(c[0]),ans.push_back(c[0]);
    else if(amt == 4)ans.push_back(c[0]),ans.push_back(c[1]);
    else if(amt == 5)ans.push_back(c[1]);
    else if(amt == 6)ans.push_back(c[1]),ans.push_back(c[0]);
    else if(amt == 7)ans.push_back(c[1]),ans.push_back(c[0]),ans.push_back(c[0]);
    else if(amt == 8)ans.push_back(c[1]),ans.push_back(c[0]),ans.push_back(c[0]),ans.push_back(c[0]);
    else if(amt == 9)ans.push_back(c[0]),ans.push_back(c[2]);
    return ans;
}

string roman(int x){
    vector<vector<char>>mp = {
        {'I','V','X'},
        {'X','L','C'},
        {'C','D','M'}
    };
    if(x == 1000)return "M";
    int h = x/100;
    int t = (x%100)/10;
    int o = (x%10);
    string ans = make(mp[2],h) + make(mp[1],t) + make(mp[0],o);
    return ans;
}
//955 1910 2865 2956
map<int,int>bad;
map<int,int>good;

int ibad;
int igood;

void gen(){
    vector<pair<string,int>>arr;
    map<int,int>hm;
    for(int i = 1; i<=1000; i++){
        arr.push_back({roman(i),i});
    }
    sort(arr.begin(),arr.end());
    for(int i = 0; i<1000; i++){
        hm[arr[i].second] = i+1;
    }
    //cout << hm[1000];
    for(int i = hm[1000]; i<1000; i++){
        bad[arr[i].second] = 1000 - i;
        //cout << arr[i].first << ' ' << arr[i].second << '\n';
    }
    for(int i = 0; i<hm[1000]; i++){
        good[arr[i].second] = i+1;
    }
    igood = hm[1000];
    ibad = 1000 - hm[1000];
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin >> t;
    gen();
    while(t--){
        
        int x;
        cin >> x;
        int extra = x/1000;
        x%=1000;
        if(bad.count(x)){
            cout << "-" << extra * ibad + bad[x] << '\n';
        }
        else{
            cout << extra * igood + good[x] << '\n';
        }
    }
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3716kb

input:

output:

result:

ok 100 lines

Test #2:

score: 0

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok 100 lines

Test #3:

score: 0

Accepted

time: 1ms

memory: 3728kb

input:

output:

result:

ok 100 lines

Test #4:

score: 0

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok 100 lines

Test #5:

score: 0

Accepted

time: 1ms

memory: 4000kb

input:

output:

result:

ok 100 lines

Test #6:

score: 0

Accepted

time: 1ms

memory: 3940kb

input:

output:

result:

ok 100 lines

Test #7:

score: 0

Accepted

time: 1ms

memory: 3716kb

input:

output:

result:

ok 100 lines

Test #8:

score: 0

Accepted

time: 1ms

memory: 4000kb

input:

output:

result:

ok 100 lines

Test #9:

score: 0

Accepted

time: 1ms

memory: 3804kb

input:

output:

result:

ok 100 lines

Test #10:

score: 0

Accepted

time: 1ms

memory: 3716kb

input:

output:

result:

ok 100 lines

Test #11:

score: 0

Accepted

time: 1ms

memory: 3940kb

input:

output:

result:

ok 13 lines

Test #12:

score: 0

Accepted

time: 0ms

memory: 3732kb

input:

output:

result:

ok 50 lines