QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#128234#6563. Four Squareinstallb#AC ✓1ms3616kbC++141.5kb2023-07-20 19:05:532023-07-20 19:05:55

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-20 19:05:55]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3616kb
  • [2023-07-20 19:05:53]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int x[4],y[4],L,sum = 0;

bool chk(){
    if(x[0] + x[1] + x[2] + x[3] == L && y[1] == L && y[2] == L && y[3] == L && y[0] == L) return 1;

    if(x[0] + x[1] + x[2] == L && x[1] + x[2] == x[3] && y[0] == L && y[1] == y[2] && y[1] + y[3] == L) return 1;

    if(x[0] + x[1] + x[2] == L && x[2] == x[3] && y[0] == L && y[1] == L && y[2] + y[3] == L) return 1;

    if(x[0] + x[1] == L && x[1] == x[2] && x[2] == x[3] && y[0] == L && y[1] + y[2] + y[3] == L) return 1;

    if(x[0] == x[1] && x[2] == x[3] && x[0] + x[2] == L && y[0] + y[1] == L && y[2] + y[3] == L) return 1;

    return 0;
}

int solve(){
    int tx[4],ty[4];
    for(int i = 0;i < 4;i ++){
        cin >> tx[i] >> ty[i];
        sum += tx[i] * ty[i];
    }
    L = sqrt(sum);
    if(L * L != sum) return 0;
    for(int S = 0;S < (1 << 4);S ++){
        for(int i = 0;i < 4;i ++){
            if((S >> i) & 1) swap(tx[i],ty[i]);
        }
        int a[4];
        for(int i = 0;i < 4;i ++) a[i] = i;
        do{
            for(int i = 0;i < 4;i ++){
                x[i] = tx[a[i]];
                y[i] = ty[a[i]];
            }
            if(chk()) return 1;
        }while(next_permutation(a,a + 4));
        for(int i = 0;i < 4;i ++){
            if((S >> i) & 1) swap(tx[i],ty[i]);
        }
    }
    return 0;
}

signed main(){
    ios::sync_with_stdio(false);
    cout << solve() << '\n';
    return 0;
}

詳細信息

Test #1:

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

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

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: 3552kb

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

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

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

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

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

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

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

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

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

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

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

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

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

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

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

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

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'