QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#117404	#6563. Four Square	UNos_maricones^#	WA	1ms	3556kb	C++20	1.2kb	2023-07-01 05:09:54	2023-07-01 05:09: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-01 05:09:55]
评测

测评结果：WA
用时：1ms
内存：3556kb

查看

[2023-07-01 05:09:54]
提交

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 && a[i]+a[r] == len);
							ok |= (a[r] == b[l] && b[r]+a[l] == len && a[i]+a[r] == len);
							ok |= (b[r] == a[l] && a[r]+b[l] == len && a[i]+b[r] == len);
							ok |= (b[r] == b[l] && a[r]+a[l] == len && a[i]+b[r] == len);
						}else if(a[i] == b[j]){
							int len = b[i] + a[j];
							ok |= (a[r] == a[l] && b[r]+b[l] == len && a[i]+a[r] == len);
							ok |= (a[r] == b[l] && b[r]+a[l] == len && a[i]+a[r] == len);
							ok |= (b[r] == a[l] && a[r]+b[l] == len && a[i]+b[r] == len);
							ok |= (b[r] == b[l] && a[r]+a[l] == len && a[i]+b[r] == len);
						}
					}
				}
			}
		}
	}
	cout<<ok<<'\n';
	return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3380kb

input:

output:

result:

ok single line: '1'

Test #2:

score: 0

Accepted

time: 1ms

memory: 3464kb

input:

output:

result:

ok single line: '0'

Test #3:

score: -100

Wrong Answer

time: 1ms

memory: 3556kb

input:

output:

result:

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