Code Submission Evaluation System Login

Datatähti 2019 alku

Start:2018-10-01 00:00:00
End:2018-10-15 00:00:00
 

Tasks | Messages | Scoreboard | Statistics


CSES - Datatähti 2019 alku - Results
History
2018-10-14 19:45:3045
2018-10-14 19:45:0914
2018-10-14 19:40:560
2018-10-14 19:39:0731
2018-10-14 19:33:020
2018-10-14 00:55:1831
Task:Ruudukko
Sender:SMemsky
Submission time:2018-10-14 19:45:30
Language:C++
Status:READY
Score:45

Feedback

groupverdictscore
#1ACCEPTED31
#2ACCEPTED14
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.03 / 1.001details
#2ACCEPTED0.01 / 1.001details
#3ACCEPTED0.01 / 1.001details
#4ACCEPTED0.02 / 1.001details
#5ACCEPTED0.03 / 1.001details
#6ACCEPTED0.01 / 1.001details
#7ACCEPTED0.01 / 1.001details
#8ACCEPTED0.01 / 1.001details
#9ACCEPTED0.02 / 1.001details
#10ACCEPTED0.02 / 1.001details
#11ACCEPTED0.01 / 1.002details
#12ACCEPTED0.02 / 1.002details
#13ACCEPTED0.02 / 1.002details
#14ACCEPTED0.03 / 1.002details
#15ACCEPTED0.01 / 1.002details
#16ACCEPTED0.02 / 1.002details
#17ACCEPTED0.03 / 1.002details
#18ACCEPTED0.03 / 1.002details
#19ACCEPTED0.03 / 1.002details
#20ACCEPTED0.03 / 1.002details
#21TIME LIMIT EXCEEDED-- / 1.003details
#22TIME LIMIT EXCEEDED-- / 1.003details
#23TIME LIMIT EXCEEDED-- / 1.003details
#24TIME LIMIT EXCEEDED-- / 1.003details
#25ACCEPTED0.03 / 1.003details
#26TIME LIMIT EXCEEDED-- / 1.003details
#27TIME LIMIT EXCEEDED-- / 1.003details
#28TIME LIMIT EXCEEDED-- / 1.003details
#29TIME LIMIT EXCEEDED-- / 1.003details
#30ACCEPTED0.03 / 1.003details

Code

#include <cassert>
#include <iostream>
#include <vector>
#include <random>

const uint64_t modulo = 1000000007;

uint64_t solutionCounter = 0;

// Memoize?
std::vector<uint64_t> factorialBuffer = {1};
std::vector<uint64_t> derangementBuffer = {0, 1, 1, 2, 9};

uint64_t factMod(uint64_t n) {
    if (n >= modulo) {
        return 0;
    }
    for (uint64_t i = factorialBuffer.size(); i <= n; ++i) {
        factorialBuffer.push_back((factorialBuffer[i-1] * i) % modulo);
    }
    return factorialBuffer[n];
}

uint64_t derMod(uint64_t n) {
    if (n < 2) {
        assert(false);
    }
    for (uint64_t i = derangementBuffer.size(); i <= n; ++i) {
        derangementBuffer.push_back((((i-1) % modulo) * ((derangementBuffer[i-1] + derangementBuffer[i-2]) % modulo)) % modulo);
    }
    return derangementBuffer[n];
}

uint64_t countEmpty(uint64_t n) {
    return (derMod(n) * factMod(n)) % modulo;
}

bool rowHasA(std::vector<uint8_t> const & field, uint64_t n, uint64_t row) {
    for (uint64_t x = 0; x < n; ++x) {
        if (field[row*n + x] == 1) { return true; }
    }
    return false;
}

bool rowHasB(std::vector<uint8_t> const & field, uint64_t n, uint64_t row) {
    for (uint64_t x = 0; x < n; ++x) {
        if (field[row*n + x] == 2) { return true; }
    }
    return false;
}

bool colHasA(std::vector<uint8_t> const & field, uint64_t n, uint64_t col) {
    for (uint64_t y = 0; y < n; ++y) {
        if (field[y*n + col] == 1) { return true; }
    }
    return false;
}

bool colHasB(std::vector<uint8_t> const & field, uint64_t n, uint64_t col) {
    for (uint64_t y = 0; y < n; ++y) {
        if (field[y*n + col] == 2) { return true; }
    }
    return false;
}

char keks[] = {'0','A','B'};

void printField(std::vector<uint8_t> const & field, uint64_t n) {
    std::cout << std::endl;
    for (uint64_t y = 0; y < n; ++y) {
        for (uint64_t x = 0; x < n; ++x) {
            std::cout << keks[field[y*n+x]] << " ";
        }
        std::cout << std::endl;
    }
}

uint64_t recursiveCounter(std::vector<uint8_t> field, uint64_t n) {
    uint64_t row = 0;
    bool hasA = false;
    bool hasB = false;
    do {
        hasA = rowHasA(field, n, row);
        hasB = rowHasB(field, n, row);
        ++row;
    } while (hasA == true && hasB == true && row < n);
    --row;

    if (hasA && hasB) {
        // std::cout << "Well done, we finished" << std::endl;
        if (solutionCounter > 0 && field[(n-1)*n+1] != 0) {
            --solutionCounter;
            printField(field, n);
        }
        assert(row == n-1);
        return 1;
    }

    uint64_t sum = 0;
    if (!hasA) {
        for (uint64_t x = 0; x < n; ++x) {
            if (field[row*n + x] == 0 && !colHasA(field, n, x)) {
                field[row*n + x] = 1;
                // std::cout << "Placing A at row " << row+1 << ", col " << x+1 << std::endl;
                sum += recursiveCounter(field, n);
                // sum %= modulo;
                field[row*n + x] = 0;
            }
        }

        return sum;
    }
    if (!hasB) {
        for (uint64_t x = 0; x < n; ++x) {
            if (field[row*n + x] == 0 && !colHasB(field, n, x)) {
                field[row*n + x] = 2;
                // std::cout << "Placing B at row " << row+1 << ", col " << x+1 << std::endl;
                sum += recursiveCounter(field, n);
                // sum %= modulo;
                field[row*n + x] = 0;
            }
        }

        return sum;
    }

    assert(false);
}

int main() {
    uint64_t n = 0;
    std::cin >> n;
    std::vector<uint8_t> field(n * n);
    for (uint64_t y = 0; y < n; ++y) {
        std::string rowString = "";
        std::cin >> rowString;
        for (uint64_t x = 0; x < n; ++x) {
            if (rowString[x] == 'A') {
                field[y * n + x] = 1;
            } else if (rowString[x] == 'B') {
                field[y * n + x] = 2;
            }
        }
    }

    if (field == std::vector<uint8_t>(n*n)) {
        std::cout << countEmpty(n) << std::endl;
    } else {
        std::cout << recursiveCounter(field, n) << std::endl;
    }
}

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: ACCEPTED

input
2
..
A.
view   save

correct output
1
view   save

user output
1
view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
2
B.
.A
view   save

correct output
0
view   save

user output
0
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: ACCEPTED

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

correct output
264
view   save

user output
264
view   save

Test 8

Group: 1

Verdict: ACCEPTED

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

correct output
22
view   save

user output
22
view   save

Test 9

Group: 1

Verdict: ACCEPTED

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

correct output
2
view   save

user output
2
view   save

Test 10

Group: 1

Verdict: ACCEPTED

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

correct output
1
view   save

user output
1
view   save

Test 11

Group: 2

Verdict: ACCEPTED

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

correct output
306442892
view   save

user output
306442892
view   save

Test 12

Group: 2

Verdict: ACCEPTED

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

correct output
694861480
view   save

user output
694861480
view   save

Test 13

Group: 2

Verdict: ACCEPTED

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

correct output
555319110
view   save

user output
555319110
view   save

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
108372237
view   save

user output
108372237
view   save

Test 15

Group: 2

Verdict: ACCEPTED

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

correct output
259107857
view   save

user output
259107857
view   save

Test 16

Group: 2

Verdict: ACCEPTED

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

correct output
19906314
view   save

user output
19906314
view   save

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
224313667
view   save

user output
224313667
view   save

Test 18

Group: 2

Verdict: ACCEPTED

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

correct output
929574601
view   save

user output
929574601
view   save

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
600226043
view   save

user output
600226043
view   save

Test 20

Group: 2

Verdict: ACCEPTED

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

correct output
198353194
view   save

user output
198353194
view   save

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
840243733
view   save

user output
(no output)
view   save

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
4146290
view   save

user output
(no output)
view   save

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
499
B.........A......................
....AB...........................
view   save

correct output
173518884
view   save

user output
(no output)
view   save

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
20044800
view   save

user output
(no output)
view   save

Test 25

Group: 3

Verdict: ACCEPTED

input
499
AB...............................
....B.......A....................
view   save

correct output
2
view   save

user output
2
view   save

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
121064146
view   save

user output
(no output)
view   save

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
.................................
..................A..............
view   save

correct output
848435259
view   save

user output
(no output)
view   save

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
296240911
view   save

user output
(no output)
view   save

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
2196
view   save

user output
(no output)
view   save

Test 30

Group: 3

Verdict: ACCEPTED

input
500
...AB............................
.A.....B.........................
view   save

correct output
1
view   save

user output
1
view   save