QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#593116	#7635. Fairy Chess	wkr	AC ✓	441ms	3728kb	C++20	2.8kb	2024-09-27 11:41:06	2024-09-27 11:41:07

Judging History

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

[2024-09-27 11:41:07]
评测

测评结果：AC
用时：441ms
内存：3728kb

查看

[2024-09-27 11:41:06]
提交

answer

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

#define int long long
#define endl '\n'
#define close ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
typedef unsigned long long ull;
const string t = "RBQCAM";
array<array<ull, 64>, 6> hit;
string s;
array<int, 12> a;
inline bool Alice(int nums, ull vis, ull used);
inline bool Bob(int nums, ull vis, ull used);

inline int pos(int x, int y)
{
    return 8 * x + y;
}

inline bool Alice(int nums, ull vis, ull used)
{
    if (nums == 12)
    {
        return 0;
    }
    for (int i = 0; i < 64; i++)
    {
        if ((1ull << i) & used)
        {
            continue;
        }
        ull who = hit[a[nums]][i];
        if (vis & who)
        {
            continue;
        }
        if (Bob(nums + 1, vis | (1ull << i), used | who))
        {
            return 1;
        }
    }
    return 0;
}

inline bool Bob(int nums, ull vis, ull used)
{
    for (int i = 0; i < 64; i++)
    {
        if ((1ull << i) & used)
        {
            continue;
        }
        ull who = hit[a[nums]][i];
        if (vis & who)
        {
            continue;
        }
        if (!Alice(nums + 1, vis | (1ull << i), used | who))
        {
            return 0;
        }
    }
    return 1;
}

void solved()
{
    cin >> s;
    for (int i = 0; i < 12; i++)
    {
        a[i] = t.find(s[i]);
    }
    for (int i = 0; i < 8; i++)
    {
        for (int j = 0; j < 8; j++)
        {
            ull p = 0;
            int idx = pos(i, j);
            for (int k = 0; k < 8; k++)
            {
                hit[0][idx] |= 1ull << pos(i, k);
                hit[0][idx] |= 1ull << pos(k, j);
            }
            for (int x = 0; x < 8; x++)
            {
                for (int y = 0; y < 8; y++)
                {
                    if (x + y == i + j || x - y == i - j)
                    {
                        hit[1][idx] |= 1ull << pos(x, y);
                    }
                }
            }
            hit[2][idx] = hit[0][idx] | hit[1][idx];
            for (int x = 0; x < 8; x++)
            {
                for (int y = 0; y < 8; y++)
                {
                    int dx = i - x;
                    int dy = j - y;
                    if (dx * dx + dy * dy == 5)
                    {
                        p |= 1ull << pos(x, y);
                    }
                }
            }
            for (int k = 3; k <= 5; k++)
            {
                hit[k][idx] = p | hit[k - 3][idx];
            }
        }
    }
    if (Alice(0, 0, 0))
    {
        cout << "Alice" << endl;
    }
    else
    {
        cout << "Bob" << endl;
    }
}

signed main()
{
    close;
    solved();
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 41ms

memory: 3572kb

input:

BBAARRCCQQMM

output:

Bob

result:

ok single line: 'Bob'

Test #2:

score: 0

Accepted

time: 3ms

memory: 3648kb

input:

BAMBAMQQRCCR

output:

Alice

result:

ok single line: 'Alice'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

QQRAACMRMCBB

output:

Alice

result:

ok single line: 'Alice'

Test #4:

score: 0

Accepted

time: 6ms

memory: 3668kb

input:

MBBARQRMACQC

output:

Alice

result:

ok single line: 'Alice'

Test #5:

score: 0

Accepted

time: 2ms

memory: 3672kb

input:

ACQCMQRBBRMA

output:

Alice

result:

ok single line: 'Alice'

Test #6:

score: 0

Accepted

time: 3ms

memory: 3728kb

input:

MRCMABRQCQAB

output:

Alice

result:

ok single line: 'Alice'

Test #7:

score: 0

Accepted

time: 6ms

memory: 3588kb

input:

BBRCMMQAAQRC

output:

Alice

result:

ok single line: 'Alice'

Test #8:

score: 0

Accepted

time: 5ms

memory: 3644kb

input:

RRMCQMACABQB

output:

Alice

result:

ok single line: 'Alice'

Test #9:

score: 0

Accepted

time: 4ms

memory: 3724kb

input:

QMQBMRBACACR

output:

Alice

result:

ok single line: 'Alice'

Test #10:

score: 0

Accepted

time: 2ms

memory: 3676kb

input:

CMRQAQCBBRAM

output:

Alice

result:

ok single line: 'Alice'

Test #11:

score: 0

Accepted

time: 7ms

memory: 3728kb

input:

CABCRQMMRQAB

output:

Alice

result:

ok single line: 'Alice'

Test #12:

score: 0

Accepted

time: 20ms

memory: 3588kb

input:

ARCBBCMQRAQM

output:

Alice

result:

ok single line: 'Alice'

Test #13:

score: 0

Accepted

time: 1ms

memory: 3648kb

input:

ARCMCARMQBBQ

output:

Alice

result:

ok single line: 'Alice'

Test #14:

score: 0

Accepted

time: 12ms

memory: 3588kb

input:

AQABMCQCMRRB

output:

Bob

result:

ok single line: 'Bob'

Test #15:

score: 0

Accepted

time: 3ms

memory: 3708kb

input:

ACMRABRQMCBQ

output:

Alice

result:

ok single line: 'Alice'

Test #16:

score: 0

Accepted

time: 13ms

memory: 3672kb

input:

CBARMBCQMQAR

output:

Bob

result:

ok single line: 'Bob'

Test #17:

score: 0

Accepted

time: 18ms

memory: 3668kb

input:

RBABRQMCAMQC

output:

Bob

result:

ok single line: 'Bob'

Test #18:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

MBCQBQARRMCA

output:

Alice

result:

ok single line: 'Alice'

Test #19:

score: 0

Accepted

time: 9ms

memory: 3672kb

input:

AMBQRBCQACMR

output:

Bob

result:

ok single line: 'Bob'

Test #20:

score: 0

Accepted

time: 1ms

memory: 3612kb

input:

QRAMQMBBCRAC

output:

Alice

result:

ok single line: 'Alice'

Test #21:

score: 0

Accepted

time: 2ms

memory: 3648kb

input:

ARBCQMMBARQC

output:

Alice

result:

ok single line: 'Alice'

Test #22:

score: 0

Accepted

time: 27ms

memory: 3588kb

input:

CACAMBRQQRBM

output:

Bob

result:

ok single line: 'Bob'

Test #23:

score: 0

Accepted

time: 11ms

memory: 3644kb

input:

CQRRMMBQABCA

output:

Bob

result:

ok single line: 'Bob'

Test #24:

score: 0

Accepted

time: 12ms

memory: 3584kb

input:

ABABCQRMMCRQ

output:

Alice

result:

ok single line: 'Alice'

Test #25:

score: 0

Accepted

time: 6ms

memory: 3720kb

input:

CMBRAAQRQMBC

output:

Bob

result:

ok single line: 'Bob'

Test #26:

score: 0

Accepted

time: 1ms

memory: 3620kb

input:

AQBMRMQRBACC

output:

Alice

result:

ok single line: 'Alice'

Test #27:

score: 0

Accepted

time: 8ms

memory: 3672kb

input:

BRACQQMCAMBR

output:

Bob

result:

ok single line: 'Bob'

Test #28:

score: 0

Accepted

time: 2ms

memory: 3588kb

input:

MCCAQBMQRABR

output:

Bob

result:

ok single line: 'Bob'

Test #29:

score: 0

Accepted

time: 12ms

memory: 3672kb

input:

RBQBCRAACMQM

output:

Bob

result:

ok single line: 'Bob'

Test #30:

score: 0

Accepted

time: 2ms

memory: 3624kb

input:

ACRQARMBBQMC

output:

Bob

result:

ok single line: 'Bob'

Test #31:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

MRCQBCBQRMAA

output:

Alice

result:

ok single line: 'Alice'

Test #32:

score: 0

Accepted

time: 5ms

memory: 3668kb

input:

ACRQQCMMBBAR

output:

Bob

result:

ok single line: 'Bob'

Test #33:

score: 0

Accepted

time: 3ms

memory: 3648kb

input:

MMACQBRQABRC

output:

Bob

result:

ok single line: 'Bob'

Test #34:

score: 0

Accepted

time: 1ms

memory: 3644kb

input:

QACMQABRMCBR

output:

Alice

result:

ok single line: 'Alice'

Test #35:

score: 0

Accepted

time: 5ms

memory: 3596kb

input:

ACAQRCMRMBQB

output:

Alice

result:

ok single line: 'Alice'

Test #36:

score: 0

Accepted

time: 8ms

memory: 3648kb

input:

RABQCQMCABMR

output:

Bob

result:

ok single line: 'Bob'

Test #37:

score: 0

Accepted

time: 4ms

memory: 3588kb

input:

QQBARCRBMMAC

output:

Alice

result:

ok single line: 'Alice'

Test #38:

score: 0

Accepted

time: 1ms

memory: 3572kb

input:

RQMRQABCABCM

output:

Alice

result:

ok single line: 'Alice'

Test #39:

score: 0

Accepted

time: 2ms

memory: 3560kb

input:

RQAMBRQCCBMA

output:

Alice

result:

ok single line: 'Alice'

Test #40:

score: 0

Accepted

time: 1ms

memory: 3556kb

input:

QQBACMARMRBC

output:

Alice

result:

ok single line: 'Alice'

Test #41:

score: 0

Accepted

time: 5ms

memory: 3572kb

input:

QAQCRRAMMCBB

output:

Alice

result:

ok single line: 'Alice'

Test #42:

score: 0

Accepted

time: 4ms

memory: 3572kb

input:

QQBMCBRARMAC

output:

Bob

result:

ok single line: 'Bob'

Test #43:

score: 0

Accepted

time: 53ms

memory: 3580kb

input:

BABARRCCQQMM

output:

Bob

result:

ok single line: 'Bob'

Test #44:

score: 0

Accepted

time: 252ms

memory: 3716kb

input:

BBARARCCQQMM

output:

Alice

result:

ok single line: 'Alice'

Test #45:

score: 0

Accepted

time: 21ms

memory: 3676kb

input:

BBAARCRCQQMM

output:

Alice

result:

ok single line: 'Alice'

Test #46:

score: 0

Accepted

time: 65ms

memory: 3600kb

input:

BBAARRCQCQMM

output:

Bob

result:

ok single line: 'Bob'

Test #47:

score: 0

Accepted

time: 41ms

memory: 3672kb

input:

BBAARRCCQMQM

output:

Bob

result:

ok single line: 'Bob'

Test #48:

score: 0

Accepted

time: 145ms

memory: 3708kb

input:

BBAACCRQMQRM

output:

Bob

result:

ok single line: 'Bob'

Test #49:

score: 0

Accepted

time: 148ms

memory: 3672kb

input:

BACBACQRRQMM

output:

Bob

result:

ok single line: 'Bob'

Test #50:

score: 0

Accepted

time: 441ms

memory: 3588kb

input:

RAABBRCCQQMM

output:

Bob

result:

ok single line: 'Bob'

Test #51:

score: 0

Accepted

time: 30ms

memory: 3648kb

input:

RABRBQMCACQM

output:

Bob

result:

ok single line: 'Bob'

Test #52:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

CMMQQABCRABR

output:

Alice

result:

ok single line: 'Alice'

Test #53:

score: 0

Accepted

time: 83ms

memory: 3648kb

input:

RBAABRCCQQMM

output:

Alice

result:

ok single line: 'Alice'

Extra Test:

score: 0

Extra Test Passed