QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#876378#10022. Jumping GameasdfsdfWA 35ms3712kbC++231.3kb2025-01-30 20:25:032025-01-30 20:25:04

Judging History

This is the latest submission verdict.

  • [2025-01-30 20:25:04]
  • Judged
  • Verdict: WA
  • Time: 35ms
  • Memory: 3712kb
  • [2025-01-30 20:25:03]
  • Submitted

answer

#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double ld;
#define MAX 569
#define MAXS 20
#define BMAX 35
#define MOD 998244353
#define INF 1'000'100'000
#define TC 1
#define ln '\n'
#define bb ' '
void solve() {
	int H, W, r, c;
	cin >> H >> W >> r >> c;
	if (H > W) {
		swap(H, W);
		swap(r, c);
	}
	if (H == 1) {
		cout << "Brahma" << ln;
		return;
	}
	if (H == 2) {
		int l = (c - 1) / 2;
		int r = (W - c) / 2;
		if ((l & 1) || (r & 1)) cout << "Annapurna" << ln;
		else cout << "Brahma" << ln;
		return;
	}
	if (H == 3 && W == 3) {
		if (r == 2 && c == 2) cout << "Brahma" << ln;
		else cout << "Annapurna" << ln;
		return;
	}
	if (H == 3 && W == 5) {
		int c1, c2;
		c1 = r == 1 || r == H;
		c2 = c == 1 || c == W;
		if (c1 && c2) cout << "Brahma" << ln;
		else cout << "Annapurna" << ln;
		return;
	}
	if ((H & 1) && (W & 1)) cout << "Brahma" << ln;
	else cout << "Annapurna" << ln;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int T;
	cin >> T;
	while (T--) solve();
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3712kb

input:

2
6 6 6 6
7 19 7 3

output:

Annapurna
Brahma

result:

ok 2 tokens

Test #2:

score: -100
Wrong Answer
time: 35ms
memory: 3712kb

input:

200000
652695136 300894239 597885661 210561036
360959967 978016924 93079366 526744440
466252780 624092439 424175327 115453901
16 16 10 10
14 19 12 2
281314939 780709721 243391639 329443634
22 15 9 3
17 19 5 10
19 25 17 1
715105073 886209327 453295637 441337663
18 23 5 2
7 21 3 20
25 23 7 1
21 23 10 ...

output:

Annapurna
Annapurna
Annapurna
Annapurna
Annapurna
Brahma
Annapurna
Brahma
Brahma
Brahma
Annapurna
Brahma
Brahma
Brahma
Annapurna
Brahma
Annapurna
Annapurna
Brahma
Annapurna
Annapurna
Brahma
Brahma
Annapurna
Annapurna
Annapurna
Annapurna
Annapurna
Annapurna
Brahma
Annapurna
Annapurna
Annapurna
Annapu...

result:

wrong answer 6th words differ - expected: 'Annapurna', found: 'Brahma'