QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#755787#9627. 算术Rosmontis_L#WA 23ms3568kbC++201.6kb2024-11-16 18:02:302024-11-16 18:02:30

Judging History

你现在查看的是最新测评结果

  • [2024-11-16 18:02:30]
  • 评测
  • 测评结果:WA
  • 用时:23ms
  • 内存:3568kb
  • [2024-11-16 18:02:30]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
const int mod = 998244353;
void solve()
{
    multiset<ll> s;
    ll t, x;
    cin >> t;
    for (int i = 2; i <= 9; i++)
    {
        cin >> x;
        for (int j = 1; j <= x; j++)
            s.insert(i);
    }
    if(s.empty())
    {
        int cx = 0, cy = t / 3, cz = 0;
        if(t > 1)
        {
            t %= 3;
            if(t == 1)
                cy--, cz++;
            else if(t == 2)
                cx++;
        }
        ll res = 1;
        for (int i = 1; i <= cx; i++)
            res = res * 2 % mod;
        for (int i = 1; i <= cy; i++)
            res = res * 3 % mod;
        for (int i = 1; i <= cz; i++)
            res = res * 4 % mod;
        cout << res << '\n';
        return;
    }
    int ls = t;
    for (int i = 1; i <= ls; i++)
    {
        auto it = s.begin();
        int p = *it;
        if(p == 3)
            break;
        t--;
        s.erase(it);
        s.insert(p + 1);
    }
    int cx = 0, cy = t / 3, cz = 0;
  
    if(t > 1)
    {
        t %= 3;
        if(t == 1)
            cy--, cz++;
        else if(t == 2)
            cx++;
    }
    for (int i = 1; i <= cx; i++)
        s.insert(2);
    for (int i = 1; i <= cy; i++)
        s.insert(3);
    for (int i = 1; i <= cz; i++)
        s.insert(4);
    ll res = 1;
    for(auto i : s)
         res = res * i % mod;
    cout << res << endl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --){
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3556kb

input:

7
5 3 0 0 0 0 0 0 0
4 1 1 1 0 0 0 0 0
1 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1
1 0 0 0 0 0 0 0 2
99 88 77 66 55 44 33 22 11
100 90 80 70 60 50 40 30 20

output:

54
108
1
10
90
90553232
143532368

result:

ok 7 lines

Test #2:

score: -100
Wrong Answer
time: 23ms
memory: 3568kb

input:

1000
22 80 50 23 35 71 81 70 96
40 33 36 2 51 52 96 5 32
56 35 85 13 58 80 26 14 31
60 21 8 19 79 5 94 44 33
85 55 10 59 76 98 28 22 69
14 72 40 14 100 68 5 18 69
95 42 51 0 32 97 37 34 85
54 33 18 40 34 10 72 72 68
81 47 80 23 23 68 40 3 71
58 7 36 79 89 83 5 68 16
30 3 82 79 35 28 30 55 88
17 86 2...

output:

376701872
321820208
765709043
819408880
639261805
521201354
7172464
780360907
240853384
151457742
298466126
416189734
124742738
161566750
493291429
481038778
409158325
951979430
783007793
438976523
440485591
163247072
78098984
275527515
308024444
168349368
423889166
168234582
827159852
914298923
465...

result:

wrong answer 39th lines differ - expected: '183198908', found: '137399181'