QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #485188 | #6644. Red Black Grid | ucup-team1525# | AC ✓ | 6ms | 3836kb | C++20 | 4.7kb | 2024-07-20 14:47:08 | 2024-07-20 14:47:08 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int t;
int n,m;
int a[10];
// int dp[1000005];
void solve()
{
scanf("%d%d",&n,&m);
if (n==3&&m==5)
{
puts("Possible");puts("BBB");puts("RRR");puts("BRR");
return;
}
if (n==3&&m==7)
{
puts("Possible");puts("BBB");puts("RRR");puts("BRB");
return;
}
int all=n*(n-1)*2;
if (m==1||m==all-1)
{
puts("Impossible");
return;
}
a[2]=a[3]=a[4]=0;
m=all-m;
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
{
if ((i+j)%2==1)
continue;
int tmp=2;
if (i!=1&&i!=n)++tmp;
if (j!=1&&j!=n)++tmp;
++a[tmp];
}
for (int i=0;i<=a[2];++i)
for (int j=0;j<=a[3];++j)
if (2*i+3*j<=m&&(m-2*i-3*j)%4==0&&(m-2*i-3*j)/4<=a[4])
{
int k=(m-2*i-3*j)/4;
puts("Possible");
for (int x=1;x<=n;++x)
{
for (int y=1;y<=n;++y)
{
if ((x+y)%2==1)
{
putchar('R');
}
else
{
int tmp=2;
if (x!=1&&x!=n)++tmp;
if (y!=1&&y!=n)++tmp;
if (tmp==2&&i!=0)
{
--i;
putchar('R');
continue;
}
if (tmp==3&&j!=0)
{
--j;
putchar('R');
continue;
}
if (tmp==4&&k!=0)
{
--k;
putchar('R');
continue;
}
putchar('B');
}
}
puts("");
}
return;
}
a[2]=a[3]=a[4]=0;
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
{
if ((i+j)%2==0)
continue;
int tmp=2;
if (i!=1&&i!=n)++tmp;
if (j!=1&&j!=n)++tmp;
++a[tmp];
}
for (int i=0;i<=a[2];++i)
for (int j=0;j<=a[3];++j)
if (2*i+3*j<=m&&(m-2*i-3*j)%4==0&&(m-2*i-3*j)/4<=a[4])
{
int k=(m-2*i-3*j)/4;
puts("Possible");
for (int x=1;x<=n;++x)
{
for (int y=1;y<=n;++y)
{
if ((x+y)%2==0)
{
putchar('R');
}
else
{
int tmp=2;
if (x!=1&&x!=n)++tmp;
if (y!=1&&y!=n)++tmp;
if (tmp==2&&i!=0)
{
--i;
putchar('R');
continue;
}
if (tmp==3&&j!=0)
{
--j;
putchar('R');
continue;
}
if (tmp==4&&k!=0)
{
--k;
putchar('R');
continue;
}
putchar('B');
}
}
puts("");
}
return;
}
}
int main()
{
scanf("%d",&t);
while (t--)
solve();
// int n;
// scanf("%d",&n);
// dp[0]=1;
// for (int i=1;i<=n;++i)
// for (int j=1;j<=n;++j)
// {
// if ((i+j)%2==1)
// continue;
// int tmp=2;
// if (i!=1&&i!=n)++tmp;
// if (j!=1&&j!=n)++tmp;
// for (int k=2*n*(n-1);k>=tmp;--k)
// dp[k]|=dp[k-tmp];
// }
// for (int i=0;i<=2*n*(n-1);++i)
// printf("%d",dp[i]);
// puts("");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
2 3 6 3 1
output:
Possible RRB RRR BRB Impossible
result:
ok correct! (2 test cases)
Test #2:
score: 0
Accepted
time: 3ms
memory: 3832kb
input:
4424 1 0 2 4 2 3 2 2 2 1 2 0 3 12 3 11 3 10 3 9 3 8 3 7 3 6 3 5 3 4 3 3 3 2 3 1 3 0 4 24 4 23 4 22 4 21 4 20 4 19 4 18 4 17 4 16 4 15 4 14 4 13 4 12 4 11 4 10 4 9 4 8 4 7 4 6 4 5 4 4 4 3 4 2 4 1 4 0 5 40 5 39 5 38 5 37 5 36 5 35 5 34 5 33 5 32 5 31 5 30 5 29 5 28 5 27 5 26 5 25 5 24 5 23 5 22 5 21 5...
output:
Possible B Possible BR RB Impossible Possible RR RB Impossible Possible RR RR Possible BRB RBR BRB Impossible Possible RRB RBR BRB Possible RRR BRB RBR Possible BRB RRR BRB Possible BBB RRR BRB Possible RRB RRR BRB Possible BBB RRR BRR Possible RRR RRR BRB Possible RRR RRR RBR Possible RRR RRR RRB I...
result:
ok correct! (4424 test cases)
Test #3:
score: 0
Accepted
time: 5ms
memory: 3824kb
input:
1 1000 0
output:
Possible RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
result:
ok correct! (1 test case)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
1 1000 1
output:
Impossible
result:
ok correct! (1 test case)
Test #5:
score: 0
Accepted
time: 6ms
memory: 3628kb
input:
1 1000 1998000
output:
Possible BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #6:
score: 0
Accepted
time: 0ms
memory: 3720kb
input:
1 1000 1997999
output:
Impossible
result:
ok correct! (1 test case)
Test #7:
score: 0
Accepted
time: 6ms
memory: 3764kb
input:
1 1000 1638091
output:
Possible BRRRRRRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #8:
score: 0
Accepted
time: 5ms
memory: 3784kb
input:
1 1000 726743
output:
Possible BRRRRRRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #9:
score: 0
Accepted
time: 5ms
memory: 3584kb
input:
1 1000 1159802
output:
Possible BRRRRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #10:
score: 0
Accepted
time: 5ms
memory: 3576kb
input:
1 1000 1824691
output:
Possible BRRRRRRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #11:
score: 0
Accepted
time: 6ms
memory: 3824kb
input:
1 1000 1606348
output:
Possible BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (1 test case)
Test #12:
score: 0
Accepted
time: 5ms
memory: 3820kb
input:
100 100 3588 100 16278 100 14222 100 3818 100 16278 100 2672 100 7447 100 5705 100 9385 100 19205 100 16362 100 14175 100 327 100 18201 100 3519 100 14923 100 5358 100 17389 100 8773 100 7611 100 2185 100 3314 100 2358 100 18271 100 9499 100 12584 100 8079 100 16954 100 12620 100 16333 100 7148 100 ...
output:
Possible BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRB BRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR...
result:
ok correct! (100 test cases)
Test #13:
score: 0
Accepted
time: 5ms
memory: 3836kb
input:
10 280 56983 468 47999 111 964 346 192134 60 3108 348 98521 421 57292 24 310 29 1080 484 17366
output:
Possible BRRRRRRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RRRRRRRRRR...
result:
ok correct! (10 test cases)
Test #14:
score: 0
Accepted
time: 2ms
memory: 3636kb
input:
13 44 3612 468 9437 171 34192 174 33316 121 15295 249 1231 84 9464 170 56598 358 183525 369 42656 29 595 226 74474 296 34671
output:
Possible BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRB BRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR RRRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBR RBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB BRBRBRBRBRBRBRBRBRBRB...
result:
ok correct! (13 test cases)
Test #15:
score: 0
Accepted
time: 6ms
memory: 3760kb
input:
792 43 1432 33 1687 39 1872 49 906 41 27 49 1140 41 2730 39 1350 33 1625 26 986 26 1079 29 377 50 2930 24 536 28 874 44 1659 36 46 26 1199 46 1289 50 1662 48 59 20 90 37 2025 40 1971 31 443 31 511 36 1940 29 1515 21 104 24 432 23 337 38 2222 36 1016 24 786 23 737 50 1728 45 2032 22 183 50 416 44 375...
output:
Possible BRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRBRB RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR BRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRB RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR BRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRB RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR BRRRRRRRRRRRRRRRRRRRRRRRRRR...
result:
ok correct! (792 test cases)