QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #570091 | #6563. Four Square | UESTC_DECAYALI# | AC ✓ | 0ms | 3800kb | C++20 | 2.2kb | 2024-09-17 13:46:15 | 2024-09-17 13:46:20 |
Judging History
answer
#include <bits/stdc++.h>
struct R { int h, w; };
using vii = std::vector<R>;
#define run(i) ({ std::cout << i << "\n"; return 0; })
bool solve(int h, int w, vii v) {
// std::cerr << "solve(" << h << ", " << w << ")\n";
if(h > w) std::swap(h, w);
if(h < 0) return false;
if(h == 0) return true;
auto fres = [&v] (int i, int j) {
vii res;
for(int k = 0; k < v.size(); ++k) if(k != i && k != j) res.emplace_back(v[k]);
return res;
};
for(int i = 0; i < v.size(); ++i) {
if(v[i].w > w) return false;
}
for(int i = 0; i < v.size(); ++i) {
if(v[i].w == w && solve(h - v[i].h, w, fres(i, -1))) return true;
if(v[i].w == h && solve(w - v[i].h, h, fres(i, -1))) return true;
if(v[i].h == w && solve(h - v[i].w, w, fres(i, -1))) return true;
if(v[i].h == h && solve(w - v[i].w, h, fres(i, -1))) return true;
}
for(int i = 0; i < v.size(); ++i) for(int j = i + 1; j < v.size(); ++j) {
if(v[i].w == v[j].w && v[i].h + v[j].h == w && solve(h - v[i].w, w, fres(i, j))) return true;
if(v[i].h == v[j].h && v[i].w + v[j].w == w && solve(h - v[i].h, w, fres(i, j))) return true;
if(v[i].w == v[j].h && v[i].h + v[j].w == w && solve(h - v[i].w, w, fres(i, j))) return true;
if(v[i].h == v[j].w && v[i].w + v[j].h == w && solve(h - v[i].h, w, fres(i, j))) return true;
if(v[i].w == v[j].w && v[i].h + v[j].h == h && solve(w - v[i].w, h, fres(i, j))) return true;
if(v[i].h == v[j].h && v[i].w + v[j].w == h && solve(w - v[i].h, h, fres(i, j))) return true;
if(v[i].w == v[j].h && v[i].h + v[j].w == h && solve(w - v[i].w, h, fres(i, j))) return true;
if(v[i].h == v[j].w && v[i].w + v[j].h == h && solve(w - v[i].h, h, fres(i, j))) return true;
}
return false;
}
int main() {
std::ios::sync_with_stdio(false);
int ss = 0, t;
vii rect(4, {0, 0});
for(auto &[h, w]: rect) {
std::cin >> h >> w;
if(h > w) std::swap(h, w);
ss += h * w;
}
t = std::sqrt(ss);
if(t * t != ss) run(0);
std::cout << solve(t, t, rect) << char(10);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3796kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3576kb
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: 3576kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
2 5 5 4 7 1 6 2
output:
1
result:
ok single line: '1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
12 2 12 7 7 12 16 4
output:
1
result:
ok single line: '1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
7 2 2 14 5 14 7 12
output:
1
result:
ok single line: '1'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
32 36 5 1 1 37 35 5
output:
1
result:
ok single line: '1'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
28 30 30 1 31 1 2 30
output:
1
result:
ok single line: '1'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
66 68 9 11 7 66 9 64
output:
1
result:
ok single line: '1'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
59 44 25 44 40 32 40 52
output:
1
result:
ok single line: '1'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3728kb
input:
4 4 2 3 4 2 3 2
output:
1
result:
ok single line: '1'