QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#117401#6563. Four SquareUNos_maricones#WA 1ms3556kbC++201.1kb2023-07-01 04:50:082023-07-01 04:51:31

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-01 04:51:31]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3556kb
  • [2023-07-01 04:50:08]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "../debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif



int a[4], b[4];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	for(int i=0; i<4; i++){
		cin>>a[i]>>b[i];
	}
	int ok = 0;
	for(int i=0; i<4; i++){
		for(int j=0; j<4; j++){
			for(int r=0; r<4; r++){
				for(int l=0; l<4; l++){
					if(i!=j && j!=r && r!=l && l!=i && i!=r && j!=l){
						if(a[i] == a[j]){
							int len = b[i] + b[j];
							ok |= (a[r] == a[l] && b[r]+b[l] == len);
							ok |= (a[r] == b[l] && b[r]+a[l] == len);
							ok |= (b[r] == a[l] && a[r]+b[l] == len);
							ok |= (b[r] == b[l] && a[r]+a[l] == len);
						}else if(a[i] == b[j]){
							int len = b[i] + a[j];
							ok |= (a[r] == a[l] && b[r]+b[l] == len);
							ok |= (a[r] == b[l] && b[r]+a[l] == len);
							ok |= (b[r] == a[l] && a[r]+b[l] == len);
							ok |= (b[r] == b[l] && a[r]+a[l] == len);
						}
					}
				}
			}
		}
	}
	cout<<ok<<'\n';
	return 0;
}

详细

Test #1:

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

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

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

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

score: -100
Wrong Answer
time: 1ms
memory: 3388kb

input:

1 3
3 3
3 3
4 7

output:

0

result:

wrong answer 1st lines differ - expected: '1', found: '0'