QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#292696#7179. Fischer's Chess Guessing GameAlphaMale06TL 83ms7164kbC++142.3kb2023-12-28 11:24:492023-12-28 11:24:49

Judging History

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

  • [2023-12-28 11:24:49]
  • 评测
  • 测评结果:TL
  • 用时:83ms
  • 内存:7164kb
  • [2023-12-28 11:24:49]
  • 提交

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();
		sort(all(cur));
		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: 6ms
memory: 7164kb

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: 0
Accepted
time: 83ms
memory: 7152kb

input:

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

output:

NRBBNKQR
BNRKQBNR
RNBQKRNB
BRNQKBRN
QNRNBKRB
RKRBBQNN
RQKBBNRN
RKNBBQRN
RBKNBQRN
RKBBQNRN
RKRBBNQN
NRNBBKQR
RBQNBNKR
NBBRNQKR
RKRNBBQN
RKQBBRNN
RKRBBNNQ
RQKBBNRN
RQKNBRNB
BQNBRKRN
RNBBKNRQ
RKRBQNBN
RQKBBNRN
NRBBQKRN
RKNBQNBR
QRNBBNKR
RKQBNRBN
RKRBNQBN
RQKBBNRN
NRBBQKRN
RKNRBBQN
RBKNRQBN
RKQBNNBR
RKR...

result:

ok (c) correct after 96 tests, max moves 6 (96 test cases)

Test #3:

score: 0
Accepted
time: 76ms
memory: 7144kb

input:

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

output:

NRBBNKQR
RBBNKQNR
RKBNNBRQ
BRKNQBNR
RBKQNNBR
RKQBBNNR
NRNBBKQR
BNRBNKQR
NRBBKQNR
RKNBBQNR
NRNBBKQR
BNNBRKQR
QRNBNKBR
RBNNBKQR
RKNBBNQR
NRBBNKQR
NRBQKBRN
RBNNBKQR
BNRBQKNR
RKQBNNBR
NRBBNKQR
RBBNKQNR
NBNQBRKR
BRNNKRQB
NNQRKBBR
RKNBQNBR
NRNBBKQR
NRKQBBRN
BNRBQKNR
RBBNNKQR
BBNRKNQR
RKNBNQBR
NRBBNKQR
BNR...

result:

ok (c) correct after 96 tests, max moves 6 (96 test cases)

Test #4:

score: -100
Time Limit Exceeded

input:

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

output:

NRBBNKQR
BNRKQBNR
RNBQKRNB
BBNQRNKR
QRKRBBNN
RQKBBNRN
NRBBQKRN
NRKBBQNR
NRKBRNBQ
NRKRBBQN
NRBBNKQR
RBBNKQNR
QRKNNRBB
NRKRBBNQ
NRNBBKQR
RBQNBNKR
NBRKNQBR
RKNQBBRN
QRKNBRNB
QRKRBNNB
RQKBBNRN
RKBBNQNR
RNKNRQBB
RKNQRBBN
NRKRBQNB
NRNBBKQR
BNRBNKQR
NRKNBRQB
NRKRBNQB
NRBBNKQR
RBBNKQNR
NRKQRBBN
BRKQNBRN
QRK...

result: