CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Ruudukko
Sender:	Nanohenry
Submission time:	2018-10-13 18:48:58 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	TIME LIMIT EXCEEDED	0
#3	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1	details
#2	WRONG ANSWER	0.02 s	1	details
#3	WRONG ANSWER	0.01 s	1	details
#4	ACCEPTED	0.02 s	1	details
#5	ACCEPTED	0.02 s	1	details
#6	ACCEPTED	0.02 s	1	details
#7	WRONG ANSWER	0.01 s	1	details
#8	WRONG ANSWER	0.03 s	1	details
#9	ACCEPTED	0.01 s	1	details
#10	WRONG ANSWER	0.02 s	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	RUNTIME ERROR	0.34 s	3	details
#22	RUNTIME ERROR	0.34 s	3	details
#23	WRONG ANSWER	0.03 s	3	details
#24	WRONG ANSWER	0.04 s	3	details
#25	WRONG ANSWER	0.02 s	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	RUNTIME ERROR	0.35 s	3	details
#28	WRONG ANSWER	0.03 s	3	details
#29	WRONG ANSWER	0.02 s	3	details
#30	WRONG ANSWER	0.03 s	3	details

Code

#include <iostream>
#include <string>

#define MOD 1000000007

using namespace std;

struct uint512_t {
    uint64_t hhh, hhl, hlh, hll, lhh, lhl, llh, lll;
    uint512_t() : hhh(0), hhl(0), hlh(0), hll(0), lhh(0), lhl(0), llh(0), lll(0) {}
    uint512_t(uint64_t a) : hhh(0), hhl(0), hlh(0), hll(0), lhh(0), lhl(0), llh(0), lll(a) {}
    uint512_t(uint64_t a, uint64_t b, uint64_t c, uint64_t d, uint64_t e, uint64_t f, uint64_t g, uint64_t h) : hhh(a), hhl(b), hlh(c), hll(d), lhh(e), lhl(f), llh(g), lll(h) {}
    inline void operator=(const uint512_t &o) {
        hhh = o.hhh;
        hhl = o.hhl;
        hlh = o.hlh;
        hll = o.hll;
        lhh = o.lhh;
        lhl = o.lhl;
        llh = o.llh;
        lll = o.lll;
    }
    inline void set(long i) {
        if (i < 64) {
            lll |= 1 << (i % 64);
        } else if (i < 64 * 2) {
            llh |= 1 << (i % 64);
        } else if (i < 64 * 3) {
            lhl |= 1 << (i % 64);
        } else if (i < 64 * 4) {
            lhh |= 1 << (i % 64);
        } else if (i < 64 * 5) {
            hll |= 1 << (i % 64);
        } else if (i < 64 * 6) {
            hlh |= 1 << (i % 64);
        } else if (i < 64 * 7) {
            hhl |= 1 << (i % 64);
        } else {
            hhh |= 1 << (i % 64);
        }
    }
    inline bool operator==(const uint512_t &o) {
        return hhh == o.hhh && hhl == o.hhl && hlh == o.hlh && hll == o.hll && lhh == o.lhh && lhh == o.lhh && lhl == o.lhl && llh == o.llh && lll == o.lll;
    }
    inline uint512_t operator~() {
        return uint512_t(~hhh, ~hhl, ~hlh, ~hll, ~lhh, ~lhl, ~llh, ~lll);
    }
    inline uint512_t operator-() {
        uint64_t a = ~lll + 1ULL;
        uint64_t b = ~llh + (a == 0);
        uint64_t c = ~llh + (b == 0);
        uint64_t d = ~llh + (c == 0);
        uint64_t e = ~llh + (d == 0);
        uint64_t f = ~llh + (e == 0);
        uint64_t g = ~llh + (f == 0);
        uint64_t h = ~llh + (g == 0);
        return uint512_t(h, g, f, e, d, c, b, a);
    }
    inline uint512_t operator&(const uint512_t &o) {
        return uint512_t(hhh & o.hhh, hhl & o.hhl, hlh & o.hlh, hll & o.hll, lhh & o.lhh, lhl & o.lhl, llh & o.llh, lll & o.lll);
    }
    inline uint512_t operator|(const uint512_t &o) {
        return uint512_t(hhh | o.hhh, hhl | o.hhl, hlh | o.hlh, hll | o.hll, lhh | o.lhh, lhl | o.lhl, llh | o.llh, lll | o.lll);
    }
    inline operator bool() {
        return hhh | hhl | hlh | hll | lhh | lhl | llh | lll;
    }
    inline long popcount() {
        return __builtin_popcount(lll) + __builtin_popcount(llh) + __builtin_popcount(lhl) + __builtin_popcount(lhh) + __builtin_popcount(hll) + __builtin_popcount(hlh) + __builtin_popcount(hhl) + __builtin_popcount(hhh);
    }
    inline operator string() {
        string res = "";
        for (long i = 63; i >= 0; i--) {
            if (lll & (1ULL << i)) {
                res += '1';
            } else {
                res += '0';
            }
        }
        return res;
    }
};

long n, r;
string t[500];
uint512_t m;
uint64_t g[8];

void search(uint512_t a, uint512_t b) {
    //cout << string(a) << '\t' << string(b) << '\n';
    if (a == m && b == m) {
        r = (r + 1) % MOD;
        return;
    }
    if (a.popcount() == 1 && b.popcount() == 1 && a == b) {
        return;
    }
    uint512_t p1 = ~a & m;
    while (p1) {
        uint512_t b1 = p1 & -p1;
        p1 = p1 & ~b1;
        uint512_t p2 = ~(b | b1) & m;
        while (p2) {
            uint512_t b2 = p2 & -p2;
            p2 = p2 & ~b2;
            search(a | b1, b | b2);
        }
    }
}

int main() {
    cin >> n;
    for (long i = 0; i < n; i++) {
        cin >> t[i];
    }
    g[n / 64] = (1 << (n % 64)) - 1;
    for (long i = n / 64 - 1; i >= 0; i--) {
        g[i] = ~g[i];
    }
    m = uint512_t(g[7], g[6], g[5], g[4], g[3], g[2], g[1], g[0]);
    uint512_t a, b;
    for (long i = 0; i < n; i++) {
        for (long j = 0; j < n; j++) {
            if (t[i][j] == 'A') {
                a.set(j);
            } else if (t[i][j] == 'B') {
                b.set(j);
            }
        }
    }
    search(a, b);
    cout << r << '\n';
    //system("pause");
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2 .. ..` view save

correct output
`2` view save

user output
`2` view save

Test 2

Group: 1

Verdict: WRONG ANSWER

input
`2 .. A.` view save

correct output
`1` view save

user output
`0` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`2 B. .A` view save

correct output
`0` view save

user output
`1` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`3 ... ... ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`4 .... .... .... ....` view save

correct output
`216` view save

user output
`216` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`5 ..... ..... ..... ..... ...` view save

correct output
`5280` view save

user output
`5280` view save

Test 7

Group: 1

Verdict: WRONG ANSWER

input
`5 ....A ..... ..... ..... ...` view save

correct output
`264` view save

user output
`0` view save

Test 8

Group: 1

Verdict: WRONG ANSWER

input
`5 B.... ..... ..... .A.B. ...` view save

correct output
`22` view save

user output
`0` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`5 B.A.. ....A ..... A.B.. ...` view save

correct output
`2` view save

user output
`2` view save

Test 10

Group: 1

Verdict: WRONG ANSWER

input
`5 A.B.. BA... .B.A. ...BA ...` view save

correct output
`1` view save

user output
`0` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`10 .......... .......... .......... .......... ...` view save

correct output
`306442892` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`50 .................................` view save

correct output
`694861480` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`111 .................................` view save

correct output
`555319110` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`222 .................................` view save

correct output
`108372237` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`333 .................................` view save

correct output
`259107857` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`444 .................................` view save

correct output
`19906314` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`497 .................................` view save

correct output
`224313667` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`498 .................................` view save

correct output
`929574601` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`499 .................................` view save

correct output
`600226043` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 .................................` view save

correct output
`198353194` view save

user output
(empty)

Test 21

Group: 3

Verdict: RUNTIME ERROR

input
`499 .................................` view save

correct output
`840243733` view save

user output
(empty)

Test 22

Group: 3

Verdict: RUNTIME ERROR

input
`499 ........................A........` view save

correct output
`4146290` view save

user output
(empty)

Test 23

Group: 3

Verdict: WRONG ANSWER

input
`499 B.........A......................` view save

correct output
`173518884` view save

user output
`0` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`499 ...A....B........................` view save

correct output
`20044800` view save

user output
`0` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`499 AB...............................` view save

correct output
`2` view save

user output
`0` view save

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`500 .................................` view save

correct output
`121064146` view save

user output
(empty)

Test 27

Group: 3

Verdict: RUNTIME ERROR

input
`500 .................................` view save

correct output
`848435259` view save

user output
(empty)

Test 28

Group: 3

Verdict: WRONG ANSWER

input
`500 .....B........A..................` view save

correct output
`296240911` view save

user output
`0` view save

Test 29

Group: 3

Verdict: WRONG ANSWER

input
`500 .A......B........................` view save

correct output
`2196` view save

user output
`0` view save

Test 30

Group: 3

Verdict: WRONG ANSWER

input
`500 ...AB............................` view save

correct output
`1` view save

user output
`0` view save

Datatähti 2019 alku

Ruudukko

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (Nanohenry)