QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #208005 | #6563. Four Square | Thallium54# | AC ✓ | 0ms | 3880kb | C++20 | 2.1kb | 2023-10-09 03:17:22 | 2023-10-09 03:17:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
vector<array<int, 2>> a(4);
int area = 0;
for (auto &[x, y] : a) {
cin >> x >> y;
area += x * y;
}
int sq = sqrt(area) + 5;
while (sq * sq > area)
sq--;
if (sq * sq != area) {
cout << "0\n";
return 0;
}
auto check = [sq](vector<array<int, 2>> a) {
sort(begin(a), end(a));
do {
if (a[0][1] == sq && a[1][1] == sq && a[2][1] == sq && a[3][1] == sq && a[0][0] + a[1][0] + a[2][0] + a[3][0] == sq) {
return true;
}
if (a[2][1] == sq && a[3][1] == sq && a[1][0] == a[0][0] &&
a[1][1] + a[0][1] == sq && a[0][0] + a[2][0] + a[3][0] == sq) {
return true;
}
if (a[0][0] == a[2][0] && a[1][0] == a[3][0] && a[0][0] + a[1][0] == sq &&
a[0][1] + a[2][1] == sq && a[1][1] + a[3][1] == sq) {
return true;
}
if (a[3][1] == sq && a[3][0] + a[2][0] == sq &&
a[0][0] + a[1][0] == a[2][0] && a[0][1] == a[1][1] &&
a[0][1] + a[2][1] == sq) {
return true;
}
if (a[3][1] == sq && a[0][0] == a[1][0] && a[0][0] == a[2][0] &&
a[0][0] + a[3][0] == sq && a[0][1] + a[1][1] + a[2][1] == sq) {
return true;
}
} while (next_permutation(begin(a), end(a)));
return false;
};
for (int msk = 0; msk < (1 << 4); msk++) {
for (int b = 0; b < 4; b++) {
if (msk >> b & 1) {
swap(a[b][0], a[b][1]);
}
}
if (check(a)) {
cout << "1\n";
return 0;
}
for (int b = 0; b < 4; b++) {
if (msk >> b & 1) {
swap(a[b][0], a[b][1]);
}
}
}
cout << 0 << endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3472kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
2 5 5 4 7 1 6 2
output:
1
result:
ok single line: '1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
12 2 12 7 7 12 16 4
output:
1
result:
ok single line: '1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
7 2 2 14 5 14 7 12
output:
1
result:
ok single line: '1'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
32 36 5 1 1 37 35 5
output:
1
result:
ok single line: '1'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
28 30 30 1 31 1 2 30
output:
1
result:
ok single line: '1'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
66 68 9 11 7 66 9 64
output:
1
result:
ok single line: '1'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
59 44 25 44 40 32 40 52
output:
1
result:
ok single line: '1'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
4 4 2 3 4 2 3 2
output:
1
result:
ok single line: '1'