QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#254194 | #7179. Fischer's Chess Guessing Game | sofija6 | TL | 0ms | 7076kb | C++23 | 2.6kb | 2023-11-18 04:12:18 | 2023-11-18 04:12:20 |
Judging History
answer
#include <bits/stdc++.h>
#define ll int
#define MAXN 970
using namespace std;
vector<string> v;
bitset<MAXN> ch;
ll same[MAXN][MAXN],ans;
ll Num_Of_Same(ll i,ll j)
{
ll cnt=0;
for (ll l=0;l<8;l++)
cnt+=v[i][l]==v[j][l];
return cnt;
}
void Solve(ll a)
{
for (ll i=0;i<v.size();i++)
{
if (same[ans][i]!=a)
ch[i]=false;
}
if (ch.count()==1)
{
for (ll i=0;i<v.size();i++)
{
if (ch[i])
ans=i;
}
return;
}
ll maxx[10];
for (ll i=0;i<9;i++)
maxx[i]=1e6;
for (ll i=0;i<v.size();i++)
{
if (!ch[i])
continue;
ll cnt[10]={0},m=-1;
for (ll j=0;j<v.size();j++)
{
if (!ch[j])
continue;
cnt[same[i][j]]++;
}
sort(cnt,cnt+9);
for (ll j=0;j<9;j++)
{
if (cnt[j]<maxx[j])
{
for (ll l=0;l<9;l++)
maxx[l]=cnt[l];
ans=i;
break;
}
}
}
}
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=0;j<v.size();j++)
{
ll cnt=Num_Of_Same(i,j);
same[i][j]=cnt;
}
}
while (true)
{
cin >> x;
if (x=="END")
return 0;
cin >> n;
ans=ans0;
for (ll i=0;i<v.size();i++)
ch[i]=1;
while (true)
{
cout << v[ans] << "\n";
cin >> a;
if (a==8)
break;
Solve(a);
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 7076kb
input:
GAME 1 1 1 2 8 END
output:
NRBBNKQR RQNNKBBR RNKRBNQB RKRBBQNN
result:
ok (c) correct after 1 tests, max moves 4 (1 test case)
Test #2:
score: -100
Time Limit Exceeded
input:
GAME 1 1 1 2 8 GAME 2 2 1 4 1 8 GAME 3 1 1 3 2 8 GAME 4 1 2 3 2 2 8 GAME 5 2 3 3 8 GAME 6 2 3 2 4 8 GAME 7 0 1 4 4 8 GAME 8 1 3 1 3 3 4
output:
NRBBNKQR RQNNKBBR RNKRBNQB RKRBBQNN NRBBNKQR RQNKNBBR RNQBBKRN RNBNQKRB RKRBBNQN NRBBNKQR RQNNKBBR RNKRBNQB RNBKRQNB RKRBBNNQ NRBBNKQR RQNNKBBR RQKBBRNN RQBKRNNB RNKQNRBB RKRBQNBN NRBBNKQR RQNKNBBR RQNBBKRN RKRBNQBN NRBBNKQR RQNKNBBR RQNBBKRN RNQBKNBR RKRBNNBQ NRBBNKQR RQNNKRBB RNQKBBRN RBKQBNRN RKR...