QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #227613 | #6563. Four Square | Nerovix# | WA | 0ms | 3692kb | C++20 | 1.7kb | 2023-10-27 19:43:36 | 2023-10-27 19:43:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
pii a[4];
signed main() {
for(int i = 0; i < 4; i++)
cin >> a[i].fi >> a[i].se;
sort(a,a+4);
do {
for(int s = 0; s < 1 << 4; s++) {
pii b[4];
for(int i = 0; i < 4; i++) {
b[i] = a[i];
if(s >> i & 1) swap(b[i].fi, b[i].se);
}
if(b[0].fi == b[1].se + b[2].se && b[1].fi == b[2].fi &&
b[0].se + b[1].fi == b[3].fi && b[3].fi == b[0].fi + b[0].se) {
cout << "1\n";
return 0;
} else if(b[0].fi == b[1].fi + b[2].fi && b[1].se == b[2].se &&
b[0].fi == b[3].fi && b[0].fi == b[0].se + b[1].se + b[3].se) {
cout << "1\n";
return 0;
} else if(b[0].fi + b[1].fi == b[2].fi + b[3].fi && b[0].se == b[1].se &&
b[0].se + b[2].se == b[0].fi + b[1].fi && b[2].se == b[3].se) {
cout << "1\n";
return 0;
} else if(b[0].fi == b[1].fi && b[1].fi == b[2].fi && b[2].fi == b[3].fi &&
b[0].se + b[1].se + b[2].se + b[3].se == b[0].fi) {
cout << "1\n";
return 0;
} else if(b[0].fi == b[1].fi && b[1].fi == b[2].fi &&
b[0].se + b[1].se + b[2].se == b[3].fi && b[3].fi == b[3].se + b[0].fi) {
cout << "1\n";
return 0;
}
}
} while(next_permutation(a, a + 4));
cout << "0\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3500kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3500kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3496kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3496kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: -100
Wrong Answer
time: 0ms
memory: 3548kb
input:
2 5 5 4 7 1 6 2
output:
0
result:
wrong answer 1st lines differ - expected: '1', found: '0'