QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#143112#6563. Four SquareUrgantTeam#AC ✓1ms3580kbC++232.5kb2023-08-20 16:55:272023-08-20 16:55:29

Judging History

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

  • [2023-08-20 16:55:29]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3580kb
  • [2023-08-20 16:55:27]
  • 提交

answer

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long double ld;
typedef long long ll;

int width[7], height[7];

vector <int> comb(int a, int b, int side)
{
	vector <int> res;
	if (height[a] == height[b] && width[a] + width[b] == side) res.pb(height[a]);
	if (height[a] == width[b] && width[a] + height[b] == side) res.pb(height[a]);
	if (width[a] == height[b] && height[a] + width[b] == side) res.pb(width[a]);
	if (width[a] == width[b] && height[a] + height[b] == side) res.pb(width[a]);
	return res; 	
}

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);

	int s = 0;
	for (int i = 1; i <= 4; i++)
	{
	 	int w, h;
	 	cin >> w >> h;
	 	if (w < h) swap(w, h);

	 	width[i] = w, height[i] = h;
	 	s += w * h;
	}

	int side = sqrt(s);
	while (side * side > s) side--;
	while ((side + 1) * (side + 1) <= s) side++;

	if (side * side != s) cout << "0\n", exit(0);

	int other = side;
	for (int i = 1; i <= 4; i++)
	{
	 	if (width[i] > side) cout << "0\n", exit(0);
	 	if (width[i] == side) other -= height[i];
	}
	if (other == 0) cout << "1\n", exit(0);
	
	if (other != side)
	{
    	int kol = 0;
    	for (int i = 1; i <= 4; i++)
    	{
    	 	if (width[i] != side) kol++;
    	}

    	int sum = 0;
    	for (int i = 1; i <= 4; i++)
    	{
    	 	if (width[i] == side) continue;
    	 	
    	 	if (height[i] == other) sum += width[i];
    	 	else if (width[i] == other) sum += height[i];
    	 	else if (kol != 3) cout << "0\n", exit(0);
    	}
    	if (sum == side) cout << "1\n", exit(0);
    	else if (kol != 3) cout << "0\n", exit(0);

    	int len = 0;
    	for (int i = 1; i <= 4; i++)
    	{
    	 	if (width[i] == side) continue;
    	 	if (width[i] == other || height[i] == other) continue;
    	 	if (height[i] == side - sum) len += width[i];
    	 	else if (width[i] == side - sum) len += height[i];
    	 	else cout << "0\n", exit(0);
    	}
    	if (len == other) cout << "1\n", exit(0);
    	else cout << "0\n", exit(0);
    }

	for (int i = 2; i <= 4; i++)
	{
		vector <int> A = comb(1, i, side);

		int x = -1, y = -1;
		for (int j = 2; j <= 4; j++)
			if (j != i) x = y, y = j;

		vector <int> B = comb(x, y, side);

	 	for (int p : A)
	 		for (int q : B)
	 			if (p + q == side) cout << "1\n", exit(0);
	}
	cout << "0\n";
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

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

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

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

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

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

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

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

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

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

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

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

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

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

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

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

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

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

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

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

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'