QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#117410#6563. Four SquareUNos_maricones#WA 35ms707624kbC++201.9kb2023-07-01 05:57:092023-07-01 05:57:10

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:57:10]
  • 评测
  • 测评结果:WA
  • 用时:35ms
  • 内存:707624kb
  • [2023-07-01 05:57:09]
  • 提交

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 dp[3002][3002][20];
int go(int x, int y, int msk){
	if(msk == 15){
		return x == 0 && y == 0;
	}
	int& ok = dp[x][y][msk];
	if(ok != -1) return ok;
	ok = 0;
	for(int i=0; i<4; i++){
		if((msk>>i)&1)continue;
		int nmsk = msk | (1<<i); 
		if(a[i] == x && y-b[i] >=0){
			ok |= go(x,y-b[i],nmsk);
		}
		if(a[i] == y && x-b[i] >=0){
			ok |= go(x-b[i],y,nmsk);
		}
		if(b[i] == x && y-a[i] >=0){
			ok |= go(x,y-a[i],nmsk);
		}
		if(b[i] == y && x-a[i] >=0){
			ok |= go(x-a[i],y,nmsk);
		}
	}
	return ok;
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	memset(dp,-1,sizeof dp);
	for(int i=0; i<4; i++){
		cin>>a[i]>>b[i];
	}
	int ok = 0;
	//1
	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);
						}
					}
				}
			}
		}
	}
	for(int len=1; len<=3000; len++){
		ok |= go(len,len,0);
	}
	cout<<ok<<'\n';
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 15ms
memory: 707448kb

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 21ms
memory: 707624kb

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

score: -100
Wrong Answer
time: 35ms
memory: 707460kb

input:

2 8
2 8
2 8
2 8

output:

0

result:

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