Task: | Lähetit |
Sender: | |
Submission time: | 2015-07-19 18:41:13 +0300 |
Language: | C++ |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.09 s | 1 | details |
#2 | ACCEPTED | 0.09 s | 1 | details |
#3 | ACCEPTED | 0.08 s | 1 | details |
#4 | ACCEPTED | 0.08 s | 1 | details |
#5 | ACCEPTED | 0.08 s | 1 | details |
#6 | ACCEPTED | 0.10 s | 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | ACCEPTED | 0.33 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | TIME LIMIT EXCEEDED | -- | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
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: TIME LIMIT EXCEEDED
input |
---|
10 8 |
correct output |
---|
209594075 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
10 12 |
correct output |
---|
811277399 |
user output |
---|
(empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
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: TIME LIMIT EXCEEDED
input |
---|
100 40 |
correct output |
---|
126883191 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 80 |
correct output |
---|
785497039 |
user output |
---|
(empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 120 |
correct output |
---|
324216296 |
user output |
---|
(empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 160 |
correct output |
---|
895190039 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 200 |
correct output |
---|
0 |
user output |
---|
(empty) |