QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#545847#8776. Not Another Constructive!Djangle162857#TL 760ms425444kbC++234.9kb2024-09-03 17:41:002024-09-03 17:41:00

Judging History

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

  • [2024-09-03 17:41:00]
  • 评测
  • 测评结果:TL
  • 用时:760ms
  • 内存:425444kb
  • [2024-09-03 17:41:00]
  • 提交

answer

#include <bits/stdc++.h>
#define fir first
#define sec second
#define FINISH cout << "FINISH" << endl;
#define debug(x) cerr << #x << " : = " << endl;
typedef long long ll;
const int inf = 0x7fffffff;
using namespace std;
bool dp[42][2500][410][42];
struct las
{
    short i, j, k;
};
void solve()
{
    short n, kk;
    cin >> n >> kk;
    string ss, s;
    cin >> ss;
    ss = " " + ss;
    s = ss;
    for (int i = 1; i <= n; i++)
    {
        if (s[i] != '?' && s[i] != 'N' && s[i] != 'A' && s[i] != 'C')
            s[i] = 'B';
    }
    dp[0][0][0][0] = 1;
    for (short i = 0; i < n; i++)
    {
        // 位
        for (short r = 0; r <= i; r++)
        {
            // N
            for (short k = 0; k <= (i / 2 + 1) * (i / 2); k++)
            {
                // NA
                for (short j = 0; j <= (i / 3 + 1) * (i / 3 + 1) * (i / 3); j++)
                {
                    // NAC
                    if (!dp[i][j][k][r])
                        continue;
                    // cout << "! " << i << " " << j << " " << k  << " " << r << endl;
                    // 加一个N

                    switch(s[i+1]) {
                        case '?':
                            dp[i + 1][j][k][r + 1] =
                            dp[i + 1][j][k + r][r] =
                            dp[i + 1][j][k][r] =
                            dp[i + 1][j + k][k][r] = 1;
                            break;
                        case 'A':
                            dp[i + 1][j][k + r][r]  = 1;
                            break;
                        case 'B':
                            dp[i + 1][j][k][r] = 1;
                            break;
                        case 'C':
                            dp[i + 1][j + k][k][r] = 1;
                            break;
                        case 'N':
                            dp[i + 1][j][k][r + 1]  = 1;
                            break;
                    }
                    // if (s[i + 1] == '?' || s[i + 1] == 'N') {
                    //     // cout << "!N" << endl;
                    //     dp[i + 1][j][k][r + 1] |= dp[i][j][k][r];

                    // }
                    // // 加一个A
                    // if (s[i + 1] == '?' || s[i + 1] == 'A') {
                    //     // cout << "!A" << endl;
                    //     dp[i + 1][j][k + r][r] |= dp[i][j][k][r];
                    // }
                    // // 加一个B
                    // if (s[i + 1] == '?' || s[i + 1] == 'B') {
                    //     // cout << "!B" << endl;
                    //     dp[i + 1][j][k][r] |= dp[i][j][k][r];
                    // }
                    // // 加一个C
                    // if (s[i + 1] == '?' || s[i + 1] == 'C') {
                    //     // cout << "!C" << endl;
                    //     dp[i + 1][j + k][k][r] |= dp[i][j][k][r];
                    // }
                }
            }
        }
    }
    string ans = " ";
    short nowi = -1, nowj = -1, nowk = -1;
    for (short j = 0; j <= 400; j++)
    {
        for (short k = 0; k <= 40; k++)
        {
            if (dp[n][kk][j][k])
            {
                nowi = kk, nowj = j, nowk = k;
                break;
            }
        }
        if (nowi != -1)
            break;
    }
    if (nowi == -1)
    {
        cout << "-1" << endl;
        return;
    }
    // cout << s << endl;
    for (short i = n; i >= 1; i--)
    {
        if (s[i] == '?')
        {
            if (dp[i - 1][nowi][nowj][nowk])
            {
                ans.push_back('B');
            }
            else if (dp[i - 1][nowi][nowj][nowk - 1])
            {
                ans.push_back('N');
                nowk--;
            }
            else if (dp[i - 1][nowi][nowj - nowk][nowk])
            {
                ans.push_back('A');
                nowj -= nowk;
            }
            else if (dp[i - 1][nowi - nowj][nowj][nowk])
            {
                ans.push_back('C');
                nowi -= nowj;
            }
        }
        if (s[i] == 'A')
        {
            ans.push_back('A');
            nowj -= nowk;
        }
        if (s[i] == 'B')
        {
            ans.push_back('B');
        }
        if (s[i] == 'C')
        {
            ans.push_back('C');
            nowi -= nowj;
        }
        if (s[i] == 'N')
        {
            ans.push_back('N');
            nowk--;
        }
    }
    string res;
    for (short i = n; i >= 1; i--) {
        res.push_back(ans[i]);
    }
    for (short i = 1; i <= n; i++) {
        if (ss[i] != '?')
            res[i - 1] = ss[i];
    }
    cout << res << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--)
    {
        solve();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 7ms
memory: 85524kb

input:

22 2
N??A??????C???????????

output:

NBBACBBBBBCBBBBBBBBBBB

result:

ok correct

Test #2:

score: 0
Accepted
time: 0ms
memory: 40692kb

input:

18 0
COUNTINGSATELLITES

output:

COUNTINGSATELLITES

result:

ok correct

Test #3:

score: 0
Accepted
time: 1ms
memory: 7668kb

input:

2 1
??

output:

-1

result:

ok correct

Test #4:

score: 0
Accepted
time: 1ms
memory: 5920kb

input:

1 0
?

output:

B

result:

ok correct

Test #5:

score: 0
Accepted
time: 1ms
memory: 5648kb

input:

1 0
N

output:

N

result:

ok correct

Test #6:

score: 0
Accepted
time: 1ms
memory: 5676kb

input:

1 0
X

output:

X

result:

ok correct

Test #7:

score: 0
Accepted
time: 1ms
memory: 5788kb

input:

1 1
?

output:

-1

result:

ok correct

Test #8:

score: 0
Accepted
time: 1ms
memory: 5684kb

input:

1 1
N

output:

-1

result:

ok correct

Test #9:

score: 0
Accepted
time: 1ms
memory: 5876kb

input:

1 1
X

output:

-1

result:

ok correct

Test #10:

score: 0
Accepted
time: 1ms
memory: 7960kb

input:

2 0
??

output:

BB

result:

ok correct

Test #11:

score: 0
Accepted
time: 1ms
memory: 7724kb

input:

2 0
N?

output:

NB

result:

ok correct

Test #12:

score: 0
Accepted
time: 0ms
memory: 7760kb

input:

2 0
?C

output:

BC

result:

ok correct

Test #13:

score: 0
Accepted
time: 0ms
memory: 7660kb

input:

2 1
N?

output:

-1

result:

ok correct

Test #14:

score: 0
Accepted
time: 1ms
memory: 7720kb

input:

2 1
?C

output:

-1

result:

ok correct

Test #15:

score: 0
Accepted
time: 2ms
memory: 9660kb

input:

3 1
???

output:

NAC

result:

ok correct

Test #16:

score: 0
Accepted
time: 0ms
memory: 9768kb

input:

3 1
N??

output:

NAC

result:

ok correct

Test #17:

score: 0
Accepted
time: 0ms
memory: 9780kb

input:

3 1
?A?

output:

NAC

result:

ok correct

Test #18:

score: 0
Accepted
time: 0ms
memory: 10004kb

input:

3 1
??C

output:

NAC

result:

ok correct

Test #19:

score: 0
Accepted
time: 1ms
memory: 9712kb

input:

3 1
NA?

output:

NAC

result:

ok correct

Test #20:

score: 0
Accepted
time: 1ms
memory: 9704kb

input:

3 1
N?C

output:

NAC

result:

ok correct

Test #21:

score: 0
Accepted
time: 1ms
memory: 9704kb

input:

3 1
?AC

output:

NAC

result:

ok correct

Test #22:

score: 0
Accepted
time: 0ms
memory: 11704kb

input:

4 1
????

output:

NACB

result:

ok correct

Test #23:

score: 0
Accepted
time: 2ms
memory: 11820kb

input:

4 1
X???

output:

XNAC

result:

ok correct

Test #24:

score: 0
Accepted
time: 2ms
memory: 11856kb

input:

4 1
???Z

output:

NACZ

result:

ok correct

Test #25:

score: 0
Accepted
time: 0ms
memory: 11760kb

input:

4 1
?AA?

output:

-1

result:

ok correct

Test #26:

score: 0
Accepted
time: 2ms
memory: 12024kb

input:

4 1
N???

output:

NACB

result:

ok correct

Test #27:

score: 0
Accepted
time: 2ms
memory: 12052kb

input:

4 1
?N??

output:

BNAC

result:

ok correct

Test #28:

score: 0
Accepted
time: 0ms
memory: 11708kb

input:

4 1
??N?

output:

NANC

result:

ok correct

Test #29:

score: 0
Accepted
time: 2ms
memory: 12056kb

input:

4 1
???N

output:

NACN

result:

ok correct

Test #30:

score: 0
Accepted
time: 2ms
memory: 11984kb

input:

4 1
A???

output:

ANAC

result:

ok correct

Test #31:

score: 0
Accepted
time: 1ms
memory: 11760kb

input:

4 1
?A??

output:

NACB

result:

ok correct

Test #32:

score: 0
Accepted
time: 2ms
memory: 12056kb

input:

4 1
??A?

output:

NBAC

result:

ok correct

Test #33:

score: 0
Accepted
time: 0ms
memory: 11820kb

input:

4 1
???A

output:

NACA

result:

ok correct

Test #34:

score: 0
Accepted
time: 0ms
memory: 11816kb

input:

4 1
C???

output:

CNAC

result:

ok correct

Test #35:

score: 0
Accepted
time: 2ms
memory: 11768kb

input:

4 1
?C??

output:

NCAC

result:

ok correct

Test #36:

score: 0
Accepted
time: 1ms
memory: 12048kb

input:

4 1
??C?

output:

NACB

result:

ok correct

Test #37:

score: 0
Accepted
time: 1ms
memory: 11752kb

input:

4 1
???C

output:

NABC

result:

ok correct

Test #38:

score: 0
Accepted
time: 0ms
memory: 14096kb

input:

5 4
?????

output:

NAACC

result:

ok correct

Test #39:

score: 0
Accepted
time: 0ms
memory: 15812kb

input:

6 14
??????

output:

-1

result:

ok correct

Test #40:

score: 0
Accepted
time: 2ms
memory: 17964kb

input:

7 14
???????

output:

-1

result:

ok correct

Test #41:

score: 0
Accepted
time: 0ms
memory: 20004kb

input:

8 43
????????

output:

-1

result:

ok correct

Test #42:

score: 0
Accepted
time: 0ms
memory: 24048kb

input:

9 55
?????????

output:

-1

result:

ok correct

Test #43:

score: 0
Accepted
time: 0ms
memory: 28212kb

input:

10 112
??????????

output:

-1

result:

ok correct

Test #44:

score: 0
Accepted
time: 0ms
memory: 28244kb

input:

11 110
???????????

output:

-1

result:

ok correct

Test #45:

score: 0
Accepted
time: 0ms
memory: 34344kb

input:

12 4
????????????

output:

NACCCCBBBBBB

result:

ok correct

Test #46:

score: 0
Accepted
time: 0ms
memory: 34288kb

input:

13 193
?????????????

output:

-1

result:

ok correct

Test #47:

score: 0
Accepted
time: 3ms
memory: 38644kb

input:

14 91
??????????????

output:

NNNANAAACACCCC

result:

ok correct

Test #48:

score: 0
Accepted
time: 0ms
memory: 44560kb

input:

15 15
???????????????

output:

NACACCCCCCCBBBB

result:

ok correct

Test #49:

score: 0
Accepted
time: 4ms
memory: 46580kb

input:

16 261
????????????????

output:

-1

result:

ok correct

Test #50:

score: 0
Accepted
time: 3ms
memory: 54764kb

input:

17 514
?????????????????

output:

-1

result:

ok correct

Test #51:

score: 0
Accepted
time: 3ms
memory: 60864kb

input:

18 678
??????????????????

output:

-1

result:

ok correct

Test #52:

score: 0
Accepted
time: 3ms
memory: 67344kb

input:

19 40
???????????????????

output:

NAACCACCCCCCCCCCCCB

result:

ok correct

Test #53:

score: 0
Accepted
time: 0ms
memory: 69052kb

input:

20 1019
????????????????????

output:

-1

result:

ok correct

Test #54:

score: 0
Accepted
time: 11ms
memory: 79440kb

input:

21 1218
?????????????????????

output:

-1

result:

ok correct

Test #55:

score: 0
Accepted
time: 7ms
memory: 87564kb

input:

22 1348
??????????????????????

output:

-1

result:

ok correct

Test #56:

score: 0
Accepted
time: 7ms
memory: 100044kb

input:

23 476
???????????????????????

output:

-1

result:

ok correct

Test #57:

score: 0
Accepted
time: 17ms
memory: 108316kb

input:

24 1445
????????????????????????

output:

-1

result:

ok correct

Test #58:

score: 0
Accepted
time: 16ms
memory: 122408kb

input:

25 1331
?????????????????????????

output:

-1

result:

ok correct

Test #59:

score: 0
Accepted
time: 30ms
memory: 132628kb

input:

26 459
??????????????????????????

output:

NNNNNNNNNAAACACCCCCCCCCCCC

result:

ok correct

Test #60:

score: 0
Accepted
time: 28ms
memory: 153068kb

input:

27 398
???????????????????????????

output:

NNNNANAAACCACCCCCCCCCCCCCCC

result:

ok correct

Test #61:

score: 0
Accepted
time: 52ms
memory: 161332kb

input:

28 274
????????????????????????????

output:

NNANAAACCACCCCCCCCCCCCCCCCCC

result:

ok correct

Test #62:

score: 0
Accepted
time: 67ms
memory: 177592kb

input:

29 1624
?????????????????????????????

output:

-1

result:

ok correct

Test #63:

score: 0
Accepted
time: 91ms
memory: 196136kb

input:

30 2079
??????????????????????????????

output:

-1

result:

ok correct

Test #64:

score: 0
Accepted
time: 123ms
memory: 220916kb

input:

31 2067
???????????????????????????????

output:

-1

result:

ok correct

Test #65:

score: 0
Accepted
time: 151ms
memory: 245520kb

input:

32 1267
????????????????????????????????

output:

-1

result:

ok correct

Test #66:

score: 0
Accepted
time: 202ms
memory: 269908kb

input:

33 928
?????????????????????????????????

output:

NNNNNNNAAAANAACACCCCCCCCCCCCCCCCC

result:

ok correct

Test #67:

score: 0
Accepted
time: 349ms
memory: 300528kb

input:

34 298
??????????????????????????????????

output:

NNAAAAACACCCCCCCCCCCCCCCCCCCCCCCCB

result:

ok correct

Test #68:

score: 0
Accepted
time: 361ms
memory: 325108kb

input:

35 2361
???????????????????????????????????

output:

-1

result:

ok correct

Test #69:

score: 0
Accepted
time: 464ms
memory: 353848kb

input:

36 489
????????????????????????????????????

output:

NNNANAAACCCCCCACCCCCCCCCCCCCCCCCCCCC

result:

ok correct

Test #70:

score: 0
Accepted
time: 585ms
memory: 390676kb

input:

37 294
?????????????????????????????????????

output:

NNAAAACCCACCCCCCCCCCCCCCCCCCCCCCCCCCC

result:

ok correct

Test #71:

score: 0
Accepted
time: 760ms
memory: 425444kb

input:

38 1558
??????????????????????????????????????

output:

NNNNNNAANAAAAAAAAAACCCCCCCCCCCCCCCCCCC

result:

ok correct

Test #72:

score: -100
Time Limit Exceeded

input:

39 1319
???????????????????????????????????????

output:

NNNNNNNAAACAANAAACCCCCCCCCCCCCCCCCCCCCC

result: