QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#102541 | #5438. Half Mixed | retcarizy# | WA | 189ms | 3660kb | C++14 | 803b | 2023-05-03 14:32:20 | 2023-05-03 14:32:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T,n,m;
vector<int>ans;
void get(int x){
long long t=1ll*x*(x-1)/2;
int sum=x;
while (t){
long long y=sqrt(t);
ans.push_back((int)y);
sum-=y;
t-=1ll*y*y;
}
}
int main(){
scanf("%d",&T);
while (T--){
scanf("%d%d",&n,&m);
ans.clear();
if (n%4==3||n%4==0){
puts("Yes");
get(n);
int op=0;
for (int i=0;i<ans.size();i++){
for (int k=0;k<ans[i];k++){
for (int j=0;j<m;j++) printf("%d ",op);
printf("\n");
}
op^=1;
}
}else if (m%4==3||m%4==0){
puts("Yes");
get(m);
for (int i=0;i<n;i++){
int op=0;
for (int j=0;j<ans.size();j++){
for (int k=0;k<ans[j];k++) printf("%d ",op);
op^=1;
}
printf("\n");
}
}else puts("No");
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3508kb
input:
2 2 3 1 1
output:
Yes 0 1 0 0 1 0 No
result:
ok OK, Accepted. (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 189ms
memory: 3660kb
input:
5382 1 1 1 2 2 1 1 3 2 2 3 1 1 4 2 3 3 2 4 1 1 5 2 4 3 3 4 2 5 1 1 6 2 5 3 4 4 3 5 2 6 1 1 7 2 6 3 5 4 4 5 3 6 2 7 1 1 8 2 7 3 6 4 5 5 4 6 3 7 2 8 1 1 9 2 8 3 7 4 6 5 5 6 4 7 3 8 2 9 1 1 10 2 9 3 8 4 7 5 6 6 5 7 4 8 3 9 2 10 1 1 11 2 10 3 9 4 8 5 7 6 6 7 5 8 4 9 3 10 2 11 1 1 12 2 11 3 10 4 9 5 8 6 ...
output:
No No No Yes 0 1 0 No Yes 0 1 0 Yes 0 0 1 0 Yes 0 1 0 0 1 0 Yes 0 0 1 1 0 0 Yes 0 0 1 0 No Yes 0 0 1 0 0 0 1 0 Yes 0 0 0 1 1 1 0 0 0 Yes 0 0 0 0 1 1 0 0 No No No Yes 0 0 0 0 1 1 1 1 0 0 0 0 Yes 0 0 0 0 0 0 1 1 1 0 0 0 No No Yes 0 0 0 0 1 1 0 No Yes 0 0 0 0 0 1 1 1 1 1...
result:
wrong output format Expected integer, but "Yes" found (test case 67)