QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#664915#6563. Four Squaredeepthought#AC ✓0ms3824kbC++232.2kb2024-10-21 23:25:192024-10-21 23:25:19

Judging History

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

  • [2024-10-21 23:25:19]
  • 评测
  • 测评结果：AC
  • 用时：0ms
  • 内存：3824kb
查看
  • [2024-10-21 23:25:19]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long

// 2 4
// 1 4
// 3 4
// 6 2


int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    vector <pair <int,int>> vp;
    for(int i = 0; i < 4; i++) {
        int x, y;
        cin >> x >> y;
        vp.push_back({x, y});
    }
    sort(vp.begin(), vp.end());
    do {    
        bool ok = false;
        for(int msk = 0; msk < 16; msk++) {
            int ax[4];
            int ay[4];    
            for(int i = 0; i < 4; i++) {
                ax[i] = vp[i].first;
                ay[i] = vp[i].second;
                if((1 << i) & msk) swap(ax[i], ay[i]);
            }

            int res = 0;
            for(int i = 0; i < 3; i++) if(ay[i] == ay[i + 1]) res++;
            if(res == 3 && ay[0] == ax[0]+ax[1]+ax[2]+ax[3]) ok = true;

            if(ay[0] == ay[1] && ay[2] == ay[1]) {
                if(ax[0] + ax[1] + ax[2] == ax[3]) {
                    if(ay[3] + ay[0] == ax[0] + ax[1] + ax[2]) ok = true;
                }
            }         

            if(ax[0] + ax[2] == ax[1] + ax[3]) {
                if(ay[0] == ay[2] && ay[1] == ay[3]) {
                    if(ax[0] + ax[2] == ay[2] + ay[3]) ok = true;
                }
            }
            
            if(ay[0] == ay[3] && ay[1] + ay[2] == ay[3]) {
                if(ax[1] == ax[2]) {
                    if(ax[0] + ax[1] + ax[3] == ay[0]) ok = true;
                }
            }

            if(ay[0] == ay[1]) {
                if(ay[0] == ay[2] + ay[3]) {
                    if(ax[2] == ax[3]) {
                        if(ax[0] + ax[1] + ax[2] == ay[0]) ok = true;
                    }
                }
            }
            
            if(ay[0] == ay[2] + ay[3]) {
                if(ax[2] == ax[3]) {
                    if(ax[2] + ax[0] == ax[1]) {
                        if(ax[0] + ax[2] == ay[0] + ay[1]) ok = true;
                    }
                }
            }
            
        }


        if(ok) {
            cout << 1 << endl;
            return 0;
        }

    } while (next_permutation(vp.begin(), vp.end()));
    cout << 0 << endl;
}
Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3824kb

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

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

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

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

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

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

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

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

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

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

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

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

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

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

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

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

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

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

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

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

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'
English 繁體中文 简体中文

Server Time: 2024-12-02 15:51:36 | OpenSource Project