QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#111022#6563. Four SquareTobo#AC ✓2ms3496kbC++201.7kb2023-06-05 14:41:072023-06-05 14:41:12

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-05 14:41:12]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3496kb
  • [2023-06-05 14:41:07]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 2005

int x[4], y[4], sum;
bool dfs(int sta, int a, int b)
{
    if (a * b == 0 && !sta)
        return true;
    if (a * b == 0 || !sta)
        return false;
    for (int i = 0; i < 4; i++)
    {
        if (!(sta >> i & 1))
            continue;
        if (x[i] <= a && y[i] <= b)
        {
            int newsta = sta ^ (1 << i);
            for (int s = newsta;; s = (s - 1) & newsta)
            {
                if (dfs(s, a - x[i], b) && dfs(newsta ^ s, x[i], b - y[i]))
                    return 1;
                if (dfs(s, a - x[i], y[i]) && dfs(newsta ^ s, a, b - y[i]))
                    return 1;
                if (!s)
                    break;
            }
        }
        if (x[i] <= b && y[i] <= a)
        {
            int newsta = sta ^ (1 << i);
            for (int s = newsta;; s = (s - 1) & newsta)
            {
                if (dfs(s, a - y[i], b) && dfs(newsta ^ s, y[i], b - x[i]))
                    return 1;
                if (dfs(s, a - y[i], x[i]) && dfs(newsta ^ s, a, b - x[i]))
                    return 1;
                if (!s)
                    break;
            }
        }
    }
    return 0;
}
void solve()
{
    for (int i = 0; i < 4; i++)
        cin >> x[i] >> y[i], sum += x[i] * y[i];
    int a = sqrt(sum + 0.5);
    if (a * a != sum)
    {
        cout << 0;
        return;
    }
    if (dfs(15, a, a))
        cout << 1;
    else
        cout << 0;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3336kb

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 2ms
memory: 3460kb

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

score: 0
Accepted
time: 2ms
memory: 3456kb

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3396kb

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3348kb

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 2ms
memory: 3340kb

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

score: 0
Accepted
time: 1ms
memory: 3344kb

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Accepted
time: 2ms
memory: 3336kb

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3348kb

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

score: 0
Accepted
time: 2ms
memory: 3256kb

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

score: 0
Accepted
time: 2ms
memory: 3352kb

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

score: 0
Accepted
time: 2ms
memory: 3288kb

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

score: 0
Accepted
time: 2ms
memory: 3348kb

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

score: 0
Accepted
time: 1ms
memory: 3344kb

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

score: 0
Accepted
time: 2ms
memory: 3496kb

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

score: 0
Accepted
time: 1ms
memory: 3404kb

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3344kb

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

score: 0
Accepted
time: 2ms
memory: 3348kb

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

score: 0
Accepted
time: 1ms
memory: 3288kb

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

score: 0
Accepted
time: 2ms
memory: 3292kb

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

score: 0
Accepted
time: 2ms
memory: 3324kb

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

score: 0
Accepted
time: 0ms
memory: 3284kb

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

score: 0
Accepted
time: 0ms
memory: 3332kb

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

score: 0
Accepted
time: 2ms
memory: 3492kb

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'