QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#278658#6563. Four Squareucup-team191#AC ✓0ms3868kbC++141.4kb2023-12-07 19:04:072023-12-07 19:04:07

Judging History

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

  • [2023-12-07 19:04:07]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3868kb
  • [2023-12-07 19:04:07]
  • 提交

answer

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pi=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

int get_total_area (vector <pi> v) {
	int res = 0;
	for (auto pp : v) {
		res += pp.first * pp.second;
	}
	return res;
}

bool f (vector <pi> v, int h, int w) {
	if (v.size() == 1) {
		return (v[0].first == h && v[0].second == w) || (v[0].first == w && v[0].second == h);
	}
	int br = (int)v.size();
	for (int mask = 1; mask < (1 << (br - 1)); mask++) {
		vector <pi> a, b;
		for (int i = 0; i < br; i++) {
			if (mask & (1 << i)) {
				a.push_back(v[i]);
			} else {
				b.push_back(v[i]);
			}
		}
		int area_a = get_total_area(a);
		int area_b = get_total_area(b);
		if (area_a % h == 0 && area_b % h == 0) {
			if (f(a, h, area_a / h) && f(b, h, area_b / h)) return 1;
		}
		if (area_a % w == 0 && area_b % w == 0) {
			if (f(a, w, area_a / w) && f(b, w, area_b / w)) return 1;
		}
	}
	return 0;
}

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	vector <pi> v(4);
	for (int i = 0; i < 4; i++) {
		cin >> v[i].first >> v[i].second;
	}
	int total_area = get_total_area(v);
	int s = sqrt(total_area);
	if (s * s != total_area) {
		cout << 0 << endl;
		return 0;
	}
	cout << f(v, s, s) << endl;
	return 0;
}

详细

Test #1:

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

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

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

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

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

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

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

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

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

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

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

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

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

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

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

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

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

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

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

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

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

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'