QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #348979 | #6563. Four Square | realcomplex0# | AC ✓ | 1ms | 3764kb | C++20 | 1.9kb | 2024-03-09 22:46:37 | 2024-03-09 22:46:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
int main(){
vector<pii> a(4);
for(int i = 0 ; i < 4; i ++ ){
cin >> a[i].fi >> a[i].se;
}
sort(a.begin(), a.end());
do{
for(int m = 0 ; m < (1 << 4); m ++ ){
vector<pii> b = a;
for(int i = 0 ;i < 4; i ++ ){
if((m & (1 << i))){
swap(b[i].fi, b[i].se);
}
}
if(b[0].fi + b[1].fi == b[1].se && b[1].se == b[0].se + b[3].se && b[2].se == b[3].se && b[0].fi == b[2].fi + b[3].fi){
cout << "1\n";
return 0;
}
if(b[1].se + b[2].se == b[0].se + b[3].se && b[1].fi == b[2].fi && b[0].fi == b[3].fi && b[2].fi + b[3].fi == b[1].se + b[2].se){
cout << "1\n";
return 0;
}
if(b[0].se + b[1].se == b[3].se && b[0].fi == b[1].fi && b[2].fi == b[1].fi + b[3].fi && b[2].fi == b[2].se + b[3].se){
cout << "1\n";
return 0;
}
if(b[0].fi + b[1].fi + b[3].fi == b[2].se + b[3].se && b[0].se == b[1].se && b[1].se == b[2].se + b[3].se && b[2].fi == b[3].fi){
cout << "1\n";
return 0;
}
if(b[0].fi + b[1].fi + b[2].fi + b[3].fi == b[0].se && b[0].se == b[1].se && b[1].se == b[2].se && b[2].se == b[3].se){
cout << "1\n";
return 0;
}
if(b[0].fi + b[3].fi == b[1].se + b[2].se + b[3].se && b[1].fi == b[2].fi && b[2].fi == b[3].fi && b[0].se == b[1].se + b[2].se + b[3].se){
cout << "1\n";
return 0;
}
}
}while(next_permutation(a.begin(), a.end()));
cout << "0\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3764kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3480kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3516kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3488kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3756kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3580kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 1ms
memory: 3552kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3492kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 1ms
memory: 3472kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
2 5 5 4 7 1 6 2
output:
1
result:
ok single line: '1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
12 2 12 7 7 12 16 4
output:
1
result:
ok single line: '1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
7 2 2 14 5 14 7 12
output:
1
result:
ok single line: '1'
Test #20:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
32 36 5 1 1 37 35 5
output:
1
result:
ok single line: '1'
Test #21:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
28 30 30 1 31 1 2 30
output:
1
result:
ok single line: '1'
Test #22:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
66 68 9 11 7 66 9 64
output:
1
result:
ok single line: '1'
Test #23:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
59 44 25 44 40 32 40 52
output:
1
result:
ok single line: '1'
Test #24:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
4 4 2 3 4 2 3 2
output:
1
result:
ok single line: '1'