QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #204810 | #6644. Red Black Grid | Geospiza# | WA | 18ms | 3756kb | C++20 | 3.5kb | 2023-10-07 14:01:32 | 2023-10-07 14:01:32 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005
#define mod 998244353
#define N 1005
#define pb push_back
using namespace std;
ll inf=1e18;
ll n,m,k,kk;
ll f[N][N];
struct node{
ll x,y;
};
vector <node> v[5];
ll cnt[5];
void sol()
{
cin>>n>>kk;
k=kk;
if (k==1)
{
printf("Impossible\n");
return;
}
for (ll j=0;j<5;j++)
v[j].clear(),cnt[j]=0;
for (ll i=0;i<n;i++)
for (ll j=0;j<n;j++)
{
if ((i+j+1)&1)
{
ll w=4;
if (i==0||i==n-1)
w--;
if (j==0||j==n-1)
w--;
cnt[w]++;
v[w].pb({i,j});
}
f[i][j]=0;
}
if ((k&1)&&cnt[3])
{
k-=3;
cnt[3]--;
node x=v[3].back();
v[3].pop_back();
f[x.x][x.y]=1;
}
while (k>=6&&cnt[3]>=2)
{
k-=6;
cnt[3]-=2;
for (ll j=0;j<2;j++){
node x=v[3].back();
v[3].pop_back();
f[x.x][x.y]=1;
}
}
while (k>=4&&cnt[4])
{
k-=4;
cnt[4]--;
for (ll j=0;j<1;j++){
node x=v[4].back();
v[4].pop_back();
f[x.x][x.y]=1;
}
}
while (k>=2&&cnt[2])
{
k-=2;
cnt[2]--;
for (ll j=0;j<1;j++){
node x=v[2].back();
v[2].pop_back();
f[x.x][x.y]=1;
}
}
if (k==0)
{
printf("Possible\n");
for (ll i=0;i<n;i++)
{
for (ll j=0;j<n;j++)
{
if (f[i][j]) printf("R");
else printf("B");
}
printf("\n");
}
return;
}
k=kk;
for (ll j=0;j<5;j++)
v[j].clear(),cnt[j]=0;
for (ll i=0;i<n;i++)
for (ll j=0;j<n;j++)
{
if ((i+j)&1)
{
ll w=4;
if (i==0||i==n-1)
w--;
if (j==0||j==n-1)
w--;
cnt[w]++;
v[w].pb({i,j});
}
f[i][j]=0;
}
if ((k&1)&&cnt[3])
{
k-=3;
cnt[3]--;
node x=v[3].back();
v[3].pop_back();
f[x.x][x.y]=1;
}
while (k>=6&&cnt[3]>=2)
{
k-=6;
cnt[3]-=2;
for (ll j=0;j<2;j++){
node x=v[3].back();
v[3].pop_back();
f[x.x][x.y]=1;
}
}
while (k>=4&&cnt[4])
{
k-=4;
cnt[4]--;
for (ll j=0;j<1;j++){
node x=v[4].back();
v[4].pop_back();
f[x.x][x.y]=1;
}
}
while (k>=2&&cnt[2])
{
k-=2;
cnt[2]--;
for (ll j=0;j<1;j++){
node x=v[2].back();
v[2].pop_back();
f[x.x][x.y]=1;
}
}
if (k==0)
{
printf("Possible\n");
for (ll i=0;i<n;i++)
{
for (ll j=0;j<n;j++)
{
if (f[i][j]) printf("R");
else printf("B");
}
printf("\n");
}
return;
}
printf("Impossible\n");
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
ll tt=1;
cin>>tt;
while (tt--)
sol();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3756kb
input:
2 3 6 3 1
output:
Possible BBB BRB BBR Impossible
result:
ok correct! (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 18ms
memory: 3544kb
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 RB BR Impossible Possible BB BR Impossible Possible BB BB Possible RBR BRB RBR Impossible Possible BBR BRB RBR Possible BBB RBR BRB Possible BBB BRB RBR Impossible Possible BBB BRB BBR Impossible Possible BBB BRB BBB Possible BBB BBB BRB Possible BBB BBB BBR Impossible Possible B...
result:
wrong answer Condition failed: "A == B" (test case 12)