QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #207848 | #6563. Four Square | Freeuni1# | AC ✓ | 1ms | 3860kb | C++14 | 1.7kb | 2023-10-08 21:29:25 | 2023-10-08 21:29:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int tot = 0;
vector<array<int, 2> > v;
int fit(vector<array<int, 2> > v, int s1, int s2, int bit) {
for (int i = 0; i < (1 << (int)(v.size())); i ++) {
if ((bit&i) != i) {
continue;
}
int s = s2;
for (int j = 0; j < v.size(); j ++) {
if ((i & (1 << j)) && v[j][0] == s1) {
s -= v[j][1];
} else if ((i & (1 << j)) && v[j][0] == s1) {
s -= v[j][0];
}
}
if (!s) return i;
s = s1;
for (int j = 0; j < v.size(); j ++) {
if ((i & (1 << j)) && v[j][1] == s2) {
s -= v[j][0];
} else if ((i & (1 << j)) && v[j][0] == s2) {
s -= v[j][1];
}
}
if (!s) return i;
}
return -1;
}
int ddi(vector<array<int, 2> > v, int s1, int s2, int bit) {
if (s1*s2 == 0) {
return 1;
}
for (int i = 1; i <= s1; i ++) {
int bb = fit(v, i, s2, bit);
if (bb != -1) {
if (ddi(v, s1 - i, s2, bb^bit)) {
return 1;
}
}
}
for (int i = 1; i <= s2; i ++) {
int bb = fit(v, s1, i, bit);
if (bb != -1) {
if (ddi(v, s1, s2 - i, bb^bit)) {
return 1;
}
}
}
return 0;
}
main() {
for (int i = 0; i < 4; i ++) {
int a, s;
cin >> a >> s;
v.push_back({a, s});
tot += a * s;
}
int a = sqrt(tot);
if (a*a != tot) {
cout << 0;
return 0;
}
cout << ddi(v, a, a, (1 << v.size()) - 1);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 1ms
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: 3508kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3660kb
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: 1ms
memory: 3860kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
1 3 3 3 3 3 4 7
output:
1
result:
ok single line: '1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
2 5 5 4 7 1 6 2
output:
1
result:
ok single line: '1'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
12 2 12 7 7 12 16 4
output:
1
result:
ok single line: '1'
Test #19:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
7 2 2 14 5 14 7 12
output:
1
result:
ok single line: '1'
Test #20:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
32 36 5 1 1 37 35 5
output:
1
result:
ok single line: '1'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
28 30 30 1 31 1 2 30
output:
1
result:
ok single line: '1'
Test #22:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
66 68 9 11 7 66 9 64
output:
1
result:
ok single line: '1'
Test #23:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
59 44 25 44 40 32 40 52
output:
1
result:
ok single line: '1'
Test #24:
score: 0
Accepted
time: 0ms
memory: 3860kb
input:
4 4 2 3 4 2 3 2
output:
1
result:
ok single line: '1'