QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#178696#6563. Four Squareneko_nyaaWA 1ms3556kbC++201.4kb2023-09-14 11:16:032023-09-14 11:16:03

Judging History

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

  • [2023-09-14 11:16:03]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3556kb
  • [2023-09-14 11:16:03]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define int long long

int get_height(vector<pair<int, int>> a, int side) {
	int ans1 = 0, ans2 = 0;
	for (auto [x, y]: a) {
		if (x == a[0].first) {
			ans1 += y;
		} else if (y == a[0].first) {
			ans1 += x;
		} 

		if (x == a[0].second) {
			ans2 += y;
		} else if (y == a[0].second) {
			ans2 += x;
		}
	}

	if (ans1 == side) return a[0].first;
	if (ans2 == side) return a[0].second;
	return -1;
}

void dfs(int msk, vector<pair<int, int>> a, int s1, int s2) {
	if (msk == 15) {
		cout << "1\n";
		exit(0);
	}

	for (int i = 0; i < 15; i++) {
		if ((msk & i) != 0) continue;

		vector<pair<int, int>> pp;
		for (int j = 0; j < 4; j++) {
			if (i & (1 << j)) pp.push_back(a[j]);
		}

		int h1 = get_height(pp, s1);
		if (h1 != -1) {
			dfs(msk | i, a, s1, s2-h1);
		}

		int h2 = get_height(pp, s2);
		if (h2 != -1) {
			dfs(msk | i, a, s1-h2, s2);
		}
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	vector<pair<int, int>> a(4);
	for (int i = 0; i < 4; i++) {
		cin >> a[i].first >> a[i].second;
	}

	int area = 0;
	for (auto [x, y]: a) {
		area += x*y;
	}

	int side = sqrtl(area);
	if (side*side != area) {
		cout << "0\n";
		return 0;
	}

	for (auto [x, y]: a) {
		if (x > side || y > side) {
			cout << "0\n";
			return 0;
		}
	}

	dfs(0, a, side, side);
	cout << "0\n";

	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3436kb

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3436kb

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3444kb

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3544kb

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 1ms
memory: 3508kb

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3428kb

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3432kb

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3476kb

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3436kb

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

score: -100
Wrong Answer
time: 0ms
memory: 3556kb

input:

3 2
4 3
3 1
1 4

output:

1

result:

wrong answer 1st lines differ - expected: '0', found: '1'