QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#683173 | #5438. Half Mixed | ssx# | TL | 0ms | 3708kb | C++20 | 1.7kb | 2024-10-27 19:13:11 | 2024-10-27 19:13:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
vector<int> v;
int num1=0;
void pl(ll res,ll x,ll la){
//cout<<res<<endl;
if(res==x)
{
num1=x;
return;
}
for(ll i=la;i>0;i--){
if(i*(i+1)/2+x-i<=res){
v.emplace_back(i);
pl(res-i*(i+1)/2,x-i,i);
return;
}
}
}
void solve()
{
//cout<<1<<endl;
ll n=0,m;
cin>>n>>m;
if(n%4==0 || n%4==3){
cout<<"Yes"<<"\n";
pl(n*(n+1)/4,n,n);
bool is=0;
for(int i=0;i<v.size();i++){
for(int j=0;j<v[i];j++){
for(int k=0;k<m;k++){
cout<<is<<" ";
}
cout<<"\n";
}
is=!is;
}
for(int j=0;j<num1;j++){
for(int k=0;k<m;k++){
cout<<is<<" ";
}
cout<<"\n";
is=!is;
}
return;
}
if(m%4==0 || m%4==3){
cout<<"Yes"<<"\n";
pl(m*(m+1)/4,m,m);
bool is=0;
for(int i=0;i<n;i++){
is=0;
for(int j=0;j<v.size();j++){
for(int k=0;k<v[j];k++){
cout<<is<<" ";
}
is=!is;
}
for(int j=0;j<num1;j++){
cout<<is<<" ";
is=!is;
}
cout<<"\n";
}
return;
}
cout<<"No"<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll T = 1;
cin >> T;
while (T --)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
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
Time Limit Exceeded
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 0 1 0 1 0 0 1 0 1 Yes 0 0 0 0 1 1 0 0 1 1 Yes 0 0 1 1 0 1 No Yes 0 0 1 1 0 0 1 0 0 0 1 1 0 0 1 0 Yes 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 1 1 1 Yes 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 1 1 No No No Yes...