QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#254170 | #7179. Fischer's Chess Guessing Game | sofija6 | TL | 3ms | 7048kb | C++17 | 2.5kb | 2023-11-18 03:04:58 | 2023-11-18 03:04:59 |
Judging History
answer
#include <bits/stdc++.h>
#define ll int
#define MAXN 970
using namespace std;
vector<string> v;
vector<ll> startt[10],d[10],cur;
ll same[MAXN][MAXN];
ll ans;
void Solve(ll a)
{
cur=d[a];
ll maxx=INT_MAX;
for (ll i : cur)
{
ll cnt[10]={0},m=0;
for (ll j : cur)
{
cnt[same[i][j]]++;
m=max(m,cnt[same[i][j]]);
}
if (m<maxx)
{
maxx=m;
ans=i;
}
}
for (ll i=0;i<9;i++)
d[i].clear();
for (ll i : cur)
d[same[ans][i]].push_back(i);
}
ll b,p,k,n,q,r,prevv;
string s;
void Create()
{
if ((ll)s.size()==8)
{
v.push_back(s);
return;
}
if (!b || (b==1 && p!=s.size()%2))
{
b++;
prevv=p;
p=s.size()%2;
s+='B';
Create();
p=prevv;
b--;
s.pop_back();
}
if (!k && r==1)
{
s+='K';
k++;
Create();
k--;
s.pop_back();
}
if (n!=2)
{
s+='N';
n++;
Create();
n--;
s.pop_back();
}
if (!q)
{
s+='Q';
q++;
Create();
q--;
s.pop_back();
}
if (!r || (r==1 && k==1))
{
s+='R';
r++;
Create();
r--;
s.pop_back();
}
return;
}
int main()
{
string x="";
ll ans0,a;
Create();
for (ll i=0;i<v.size();i++)
{
if (v[i]=="NRBBNKQR")
ans0=i;
}
for (ll i=0;i<v.size();i++)
{
for (ll j=i+1;j<v.size();j++)
{
ll cnt=0;
for (ll p=0;p<8;p++)
cnt+=(v[i][p]==v[j][p]);
same[i][j]=cnt;
same[j][i]=cnt;
}
}
for (ll i=0;i<v.size();i++)
{
if (i==ans0)
continue;
ll cnt=0;
for (ll j=0;j<8;j++)
cnt+=(v[ans0][j]==v[i][j]);
startt[cnt].push_back(i);
}
while (true)
{
if (x=="")
cin >> x;
cin >> n;
ans=ans0;
while (true)
{
cout << v[ans] << "\n";
cin >> a;
if (ans==ans0)
d[a]=startt[a];
if (a==8)
{
cin >> x;
if (x=="END")
return 0;
break;
}
Solve(a);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 7048kb
input:
GAME 1 1 2 2 1 2 8 END
output:
NRBBNKQR BNRKQBNR RNBQKRNB BRNQKBRN QNRNBKRB RKRBBQNN
result:
ok (c) correct after 1 tests, max moves 6 (1 test case)
Test #2:
score: -100
Time Limit Exceeded
input:
GAME 1 1 2 2 1 2 8 GAME 2 2 1 0 1 8 GAME 3 1 2 2 0 3 8 GAME 4 1 2 1 1 3 8 GAME 5 2 2 1 1 4 8 GAME 6 2 1 2 1 3 8 GAME 7 0 2 3 4 3 8 GAME 8 1 2 1 0 3 8 GAME 9 0 3 1 2 8 GAME 10 0 3 3 2 8 GAME 11 0 5 3 2 8 GAME 12 1 1 1 4 8 GAME 13 1 2 2 3 4 8 GAME 14 0 4 3 4 8 GAME 15 1 2 1 0 1 8 GAME 16 1 1 3 2 2 8 G...
output:
NRBBNKQR BNRKQBNR RNBQKRNB BRNQKBRN QNRNBKRB RKRBBQNN NRBBNKQR RBBNKQNR QRKNNRBB NNQRBBKR RKRBBNQN NRBBNKQR BNRKQBNR RNBQKRNB BRNQKBRN RBKNBQNR RKRBBNNQ NRBBNKQR BNRKQBNR RNBQKRNB BBNQRNKR QBRKNRBN RKRBQNBN NRBBNKQR RBBNKQNR RNNKBBQR NRKNBQRB RKBBQNRN RKRBNQBN NRBBNKQR RBBNKQNR QRKNNRBB NRKRBBNQ NQR...