QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#44444#4638. XiangqiQingyuWA 132ms3700kbC++202.5kb2022-08-17 14:36:002022-08-17 14:50:02

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-08-17 14:50:02]
  • 评测
  • 测评结果：WA
  • 用时：132ms
  • 内存：3700kb
查看
  • [2022-08-17 14:36:00]
  • 提交

answer

#include <bits/stdc++.h>


typedef long long ll;
ll go(ll x, ll y) {
	if (!y && (x == 1 || x == -1))
		return 3;
	if (!x && (y == 1 || y == -1))
		return 3;
	if ((x == 2 || x == -2) && (y == 2 || y == -2))
		return 4;
	ll ans = std::max(std::max((x + 1) / 2, (y + 1) / 2), (x + y + 2) / 3);
	if (ans % 2 != (x ^ y) % 2)
		++ans;
	return ans;
}

ll solve(ll xh, ll yh, ll xc, ll yc) {
	if (xh < 0) xh = -xh, xc = -xc;
	if (yh < 0) yh = -yh, yc = -yc;
	ll ans = go(xh, yh);
	for (int _ = 0; _ < 2; _++) {
		if (xh == yh * 2 && xc > 0 && xc < xh && yc == (xc + 1) / 2) {
			ans += 1;
		}
		std::swap(xh, yh);
		std::swap(xc, yc);
	}
	for (int _ = 0; _ < 2; _++) {
		ll z = (xh + 1) / 2;
		ll dy = xh / 2;
		if (xh == 0 && yh > yc && yh - yc <= 3) {
			if (ans > 3) {
				fprintf(stderr, "ans was %lld\n", ans);
				ans = 3;
			}
		}
		if (xh == 1 && yh == 0 && xc == 0 && std::abs(yc) > 2) {
			if (ans > 2) {
				fprintf(stderr, "ans was %lld\n", ans);
				ans = 2;
			}
		}
		if (xh == 2 && yh == 2 && xc == 0 && std::abs(yc) > 2) {
			if (ans > 3) {
				fprintf(stderr, "ans was %lld\n", ans);
				ans = 3;
			}
		}
		if (xh & 1) dy += 2;
		if (dy < yh) {
			ll ny = yh - dy;
			if (xc == 0 && yc > ny) {
				ans = std::min(ans, z + 1);
			}
			else if (yc > ny) {
				ans = std::min(ans, z + 2);
			}
			else if (xc == 0 && yc > 0 && xh != 0) {
				ans = std::min(ans, z + 2);
			}
			else if (xc != 0) {
				ans = std::min(ans, z + 3);
			}
			else {
				ans = std::min(ans, z + 4);
			}
		}
		std::swap(xh, yh);
		std::swap(xc, yc);
	}
	for (int _ = 0; _ < 2; ++_) {
		if (xh == 4 && yh == 0 && xc == 3 && yc == 0)
			return ans + 1;
		std::swap(xh, yh);
		std::swap(xc, yc);
	}
	if (xc == 1 && yc == 1) {
		for (int _ = 0; _ < 2; ++_) {
			if (xh == 3 && yh == 3)
				return ans + 1;
			if (xh == 4 && yh == 4)
				return ans;
			if (xh == 5 && yh == 5)
				return ans;
			if (xh == 6 && yh == 6)
				return ans + 1;	
			if (xh == 9 && yh == 9)
				return ans + 1;
			if (xh == 12 && yh == 12)
				return ans + 1;
			if (xh == 15 && yh == 15)
				return ans + 1;
			if (xh == 4 && yh == 5)
				return ans + 1;
			std::swap(xh, yh);
			std::swap(xc, yc);
		}
	}	
	return ans;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	int T;
	std::cin >> T;
	while (T--) {
		int x1, y1, x2, y2;
		std::cin >> x1 >> y1 >> x2 >> y2;
		std::cout << solve(x1, y1, x2, y2) << '\n';
	}
	return 0;
}
源文件, 语言: C++20

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3556kb

input:

5
-2 1 5 5
5 0 6 0
2 1 1 1
100 2 -1 0
4 2 1 1

output:

1
1
2
5
3

result:

ok 5 lines

Test #2:

score: -100
Wrong Answer
time: 132ms
memory: 3700kb

input:

388752
-12 -12 -12 -11
-12 -12 -12 -10
-12 -12 -12 -9
-12 -12 -12 -8
-12 -12 -12 -7
-12 -12 -12 -6
-12 -12 -12 -5
-12 -12 -12 -4
-12 -12 -12 -3
-12 -12 -12 -2
-12 -12 -12 -1
-12 -12 -12 0
-12 -12 -12 1
-12 -12 -12 2
-12 -12 -12 3
-12 -12 -12 4
-12 -12 -12 5
-12 -12 -12 6
-12 -12 -12 7
-12 -12 -12 8
...

output:

8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
7
8
8
8
8
8
8
8
8
8
8
8
8
8
...

result:

wrong answer 2155th lines differ - expected: '8', found: '7'
English 繁體中文 简体中文

伺服器時間: 2024-12-02 12:38:41 | 開源專案