QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#788558#9750. 拼图isWFnoya#WA 3ms5836kbC++20803b2024-11-27 17:25:122024-11-27 17:25:12

Judging History

This is the latest submission verdict.

  • [2024-11-27 17:25:12]
  • Judged
  • Verdict: WA
  • Time: 3ms
  • Memory: 5836kb
  • [2024-11-27 17:25:12]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
const int N=1e6+10,mod=1e9+7;
char s[N];


	int a,b,c,d;
vector<int> e[N];

bool check(int x,int y){
	int bb=b,cc=c,dd=d;
	if(x%2==0) bb-=y,cc-=y;
	if(y%2==0) bb-=x,cc-=x;
	if(bb<0||cc<0) return false;
	if(x%2==1){
		if(y*2<=bb||y*2<=cc) return true;
		return false;
	}
	if(y%2==1){
		if(x*2<=bb||x*2<=cc) return true;
		return false;
	}
	return true;
}

void __(){
	scanf("%d%d%d%d",&a,&b,&c,&d);
	int mx=0;
	if(a<4){
		puts("0");
		return;
	}
	int ans=4;
	for(int i=1;i<=d;i++){
		for(int j=1;j<=d/i;j++){
			if(check(i,j)) ans=max(ans,(i+2)*(j+2));
		}
	}
	printf("%d\n",ans);
}


int main(){
	
    int _=1;
    cin>>_;
    while(_--){
        __();
    }
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 5836kb

input:

2
4 0 0 0
4 4 4 4

output:

4
16

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 3ms
memory: 3864kb

input:

10000
0 0 0 0
0 0 0 1
0 0 0 2
0 0 0 3
0 0 0 4
0 0 0 5
0 0 0 6
0 0 0 7
0 0 0 8
0 0 0 9
0 0 1 0
0 0 1 1
0 0 1 2
0 0 1 3
0 0 1 4
0 0 1 5
0 0 1 6
0 0 1 7
0 0 1 8
0 0 1 9
0 0 2 0
0 0 2 1
0 0 2 2
0 0 2 3
0 0 2 4
0 0 2 5
0 0 2 6
0 0 2 7
0 0 2 8
0 0 2 9
0 0 3 0
0 0 3 1
0 0 3 2
0 0 3 3
0 0 3 4
0 0 3 5
0 0 3 ...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

wrong answer 4022nd lines differ - expected: '4', found: '9'