QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#292693#7179. Fischer's Chess Guessing GameAlphaMale06TL 5ms7096kbC++142.3kb2023-12-28 11:20:382023-12-28 11:20:39

Judging History

你现在查看的是最新测评结果

  • [2023-12-28 11:20:39]
  • 评测
  • 测评结果:TL
  • 用时:5ms
  • 内存:7096kb
  • [2023-12-28 11:20:38]
  • 提交

answer

#include <bits/stdc++.h>

/*
	Oce nas,
	koji si na nebesima,
	da se sveti ime Tvoje,
	da dodje carstvo Tvoje,
	da bude volja Tvoja,
	i na zemlji, kao i na nebu.
	
	Hleb nas nasusni daj nam danas,
	i oprosti nam dugove nase,
	kao sto i mi oprastamo duznicima svojim,
	i ne uvedi nas u iskusenje,
	no izbavi nas od zloga.
	
	Jer je Tvoje Carstvo,
	i sila, i slava,
	u vekove vekova.
	
	Amin.
*/

using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) (x).begin(), (x).end()

vector<string> v;
vector<pair<int, int>> cur;
vector<pair<int, int>> ncur;
int gas[960][960];

bool checkvalid(string s){
	int indb1, indb2, indk;
	indb1=-1;
	for(int i=0; i< 8; i++){
		if(s[i]=='B'){
			if(indb1==-1){
				indb1=i;
			}
			else indb2=i;
		}
		if(s[i]=='K'){
			indk=i;
		}
	}
	if(indb1%2==indb2%2)return 0;
	int cnt=0;
	for(int i=0; i< indk; i++){
		if(s[i]=='R')cnt++;
	}
	if(cnt==1)return 1;
	return 0;
}

int inter(int i, int j){
	int ans=0;
	for(int k=0; k< 8; k++){
		if(v[i][k]==v[j][k])ans++;
	}
	return ans;
}

void calcbest(){
	for(auto p : cur){
		int cnt[9]={0};
		for(auto p2 : cur){
			cnt[gas[p.S][p2.S]]++;
		}
		int mx=0;
		for(int i=0; i< 9; i++)mx=max(mx, cnt[i]);
		ncur.pb({mx, p.S});
	}
	cur.clear();
	for(auto p : ncur){
		cur.pb(p);
	}
	ncur.clear();
}


void solve(){
	for(int i=0; i< 960; i++){
		cur.pb({0, i});
	}
	int ans=0;
	while(ans!=8){
		calcbest();
		string output= v[cur[0].S];
		cout << output << endl;
		cin >> ans;
		for(auto p : cur){
			if(gas[cur[0].S][p.S]==ans){
				ncur.pb({0, p.S});
			}
		}
		cur.clear();
		for(auto p : ncur){
			cur.pb(p);
		}
		ncur.clear();
	}
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	string s="RRKNNQBB";
	sort(all(s));
	while(next_permutation(all(s))){
		if(checkvalid(s))v.pb(s);
	}
	for(int i=0; i< 960; i++){
		for(int j=0; j< 960; j++){
			gas[i][j]=inter(i, j);
		}
	}
	string partija;
	cin >> partija;
	while(partija!="END"){
		int mrs;
		cin >> mrs;
		solve();
		cin >> partija;
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 5ms
memory: 7096kb

input:

GAME 1
0
1
2
2
8
END

output:

BBNNQRKR
NNBBRKRQ
NRKRBBQN
RKBRNNQB
RKRBBQNN

result:

ok (c) correct after 1 tests, max moves 5 (1 test case)

Test #2:

score: -100
Time Limit Exceeded

input:

GAME 1
0
1
2
2
8
GAME 2
6
4
6
8
GAME 3
6
4
8
GAME 4
5
2
8
GAME 5
6
4
6
8
GAME 6
6
4
8
GAME 7
3
1
2
1
8
GAME 8
6
4
5
6
8
GAME 9
6
4
4
8
GAME 10
5
3
2
5
8
GAME 11
6
4
5
6
8
GAME 12
6
4
4
8
GAME 13
3
2
1
1
8
GAME 14
6
4
5
6
8
GAME 15
6
4
4
8
GAME 16
5
3
3
5
8
GAME 17
6
4
5
6
8
GAME 18
6
4
4
8
GAME 19
2...

output:

BBNNQRKR
NNBBRKRQ
NRKRBBQN
RKBRNNQB
RKRBBQNN
RKRBBQNN
RKBBRQNN
RKRBBNNQ
RKRBBNQN
RKRBBNQN
RKBBRNQN
RKRBBNNQ
RKRBBNNQ
RBKRBNNQ
RKRBQNBN
RKRBQNBN
RKBBQNRN
RKRBNNBQ
RKRBNQBN
RKRBNQBN
RKBBNQRN
RKRBNNBQ
RKRBNNBQ
BBRKNNQR
NNRBBKRQ
NRKRNBBQ
RKRQBBNN
RKRQBBNN
RKBQRBNN
RKRBBQNN
RKRNBBNQ
RKRNBBQN
RKRNBBQN
RKB...

result: