QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #114066 | #6563. Four Square | UFRJ# | WA | 1ms | 3544kb | C++20 | 2.0kb | 2023-06-20 20:34:51 | 2023-06-20 20:34:55 |
Judging History
answer
#include "bits/stdc++.h"
using lint = int64_t;
using namespace std;
void yes(){
cout<<"1\n";
exit(0);
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n = 4;
vector<array<int, 2>> org(n);
for(int i = 0;i<n; i++){
cin>>org[i][0]>>org[i][1];
}
vector<int> ids(n);
iota(ids.begin(), ids.end(), 0);
do{
for(int m = 0; m < (1<<n); m++){
vector<array<int, 2>> v;
for(int i = 0; i<n; i++){
auto cur = org[ids[i]];
if(m & (1<<i))
swap(cur[0], cur[1]);
v.push_back(cur);
}
const int h = 0, w = 1;
{// [][][][]
int lado = v[0][h];
bool ok = true;
ok &= (v[0][h] == lado);
ok &= (v[1][h] == lado);
ok &= (v[2][h] == lado);
ok &= (v[3][h] == lado);
ok &= ((v[0][w] + v[1][w] + v[2][w]+ v[3][w]) == lado);
if(ok) yes();
}
{
/*
[ ]
[][][]
*/
int l = v[0][w];
bool ok = true;
ok &= (l == (v[1][w] + v[2][w] + v[3][w]));
ok &= l == (v[0][h] + v[1][h]);
ok &= l == (v[0][h] + v[2][h]);
ok &= l == (v[0][h] + v[3][h]);
if(ok) yes();
}
{
/*
[][]
[][]
*/
int l = (v[0][w] + v[1][w]);
bool ok = true;
ok &= l == (v[2][w] + v[3][w]);
ok &= l == (v[0][h] + v[2][h]);
ok &= l == (v[1][h] + v[3][h]);
if(ok) yes();
}
}
} while(next_permutation(ids.begin(), ids.end()));
cout<<"0\n";
return 0;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3440kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3440kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 1ms
memory: 3440kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 1ms
memory: 3448kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 1ms
memory: 3452kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 1ms
memory: 3544kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 1ms
memory: 3468kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 1ms
memory: 3440kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 1ms
memory: 3468kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: -100
Wrong Answer
time: 1ms
memory: 3468kb
input:
2 5 5 4 7 1 6 2
output:
0
result:
wrong answer 1st lines differ - expected: '1', found: '0'