CSES - Putka Open 2015 – 1/6 - Results
Submission details
Task:Lähetit
Sender:
Submission time:2015-07-19 18:41:13 +0300
Language:C++
Status:READY
Result:12
Feedback
groupverdictscore
#1ACCEPTED12
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.09 s1details
#2ACCEPTED0.09 s1details
#3ACCEPTED0.08 s1details
#4ACCEPTED0.08 s1details
#5ACCEPTED0.08 s1details
#6ACCEPTED0.10 s2details
#7--2details
#8--2details
#9--2details
#10ACCEPTED0.33 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:58:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &k);
                           ^

Code

#include <stdio.h>

#define MIN(a,b) (((a) > (b)) ? (b) : (a))
#define MAX(a,b) (((a) < (b)) ? (b) : (a))
#define ABS(a) ((a < 0) ? -(a): (a))
#define N 100
#define K (N*N)
int n, k;
int D1[2*N] = {0};
int D2[2*N] = {0};
int D[2*N] = {0};
char B[N][N];

void plot() {
    int i, j;
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            printf("%c", B[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}


unsigned long f(int i, int left) {
    unsigned long ret;
    int d, x, y, j;


    if (!left) {
        /*plot();*/
        return 1;
    }

    ret = 0;
    for (j = 0; j <= MIN(i, 2*n-2 -i); j++) {
        x = (i < n) ?   j :   j + (i-n+1);
        y = (i < n) ? i-j : i-j - (i-n+1); 
        d = (n-1) - x + y;
        /*printf("i,j=(%d,%d) x,y=(%d,%d) d=%d left=%d\n", i, j, x, y, d, left);*/

        if (D[d] == 0) {
            D[d] = 1; B[x][y] = 'O';
            ret += f(i+1, left-1);
            D[d] = 0; B[x][y] = '_';
        }
    }

    if (left < 2*n-1 - i)
        ret += f(i+1, left);
    return ret % (1000000000+7);
}

int main(int argc, char *argv[])
{
    int i, j;
    scanf("%d %d", &n, &k);
    for (i = 0; i < n; i++)
    for (j = 0; j < n; j++)
        B[i][j] = '_';
    printf("%lu\n", f(0, k));
    return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
5 2

correct output
240

user output
240

Test 2

Group: 1

Verdict: ACCEPTED

input
5 4

correct output
2728

user output
2728

Test 3

Group: 1

Verdict: ACCEPTED

input
5 6

correct output
1960

user output
1960

Test 4

Group: 1

Verdict: ACCEPTED

input
5 8

correct output
32

user output
32

Test 5

Group: 1

Verdict: ACCEPTED

input
5 10

correct output
0

user output
0

Test 6

Group: 2

Verdict: ACCEPTED

input
10 4

correct output
1809464

user output
1809464

Test 7

Group: 2

Verdict:

input
10 8

correct output
209594075

user output
(empty)

Test 8

Group: 2

Verdict:

input
10 12

correct output
811277399

user output
(empty)

Test 9

Group: 2

Verdict:

input
10 16

correct output
17275136

user output
(empty)

Test 10

Group: 2

Verdict: ACCEPTED

input
10 20

correct output
0

user output
0

Test 11

Group: 3

Verdict:

input
100 40

correct output
126883191

user output
(empty)

Test 12

Group: 3

Verdict:

input
100 80

correct output
785497039

user output
(empty)

Test 13

Group: 3

Verdict:

input
100 120

correct output
324216296

user output
(empty)

Test 14

Group: 3

Verdict:

input
100 160

correct output
895190039

user output
(empty)

Test 15

Group: 3

Verdict:

input
100 200

correct output
0

user output
(empty)