QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#883359 | #6309. Aqre | AMATSUKAZE# | WA | 1ms | 3712kb | C++20 | 1.8kb | 2025-02-05 16:01:45 | 2025-02-05 16:01:46 |
Judging History
answer
#include<bits/stdc++.h>
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define all(v) begin(v),end(v)
using namespace std;
using ll = long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using vp=vector<pll>;
using vvp=vector<vp>;
using vs=vector<string>;
bool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }
const ll INF=1LL<<60;
void solve(ll h,ll w){
auto output=[](vs rs){
ll t=0;
for(auto s:rs)for(auto c:s)if(c=='1') t++;
cout<<t<<endl;
for(auto s:rs) cout<<s<<endl;
};
if(h<4&&w<4){
output(vs(h,string(w,'1')));
return;
}
bool is_swap=false;
if(h>w){
is_swap=true;
swap(h,w);
}
vs rs(h,string(w,'1'));
if(h==2){
rep(j,0,w)if(j%4==3) rs[0][j]='0';
rep(j,0,w)if(j%4==1) rs[1][j]='0';
}
else if(h==3){
rep(j,0,w)if(j%4==3) rs[0][j]='0';
rep(j,0,w)if(j%4==1) rs[1][j]='0';
rep(j,0,w)if(j%4==3) rs[2][j]='0';
}
else if(h%4==0||w%4==0){
vs a={
"1011",
"1110",
"0111",
"1101"
};
rep(i,0,h)rep(j,0,w) rs[i][j]=a[i%4][j%4];
}
else{
vs a={
"1110",
"1101",
"0111",
"1011"
};
rep(i,0,h)rep(j,0,w) rs[i][j]=a[i%4][j%4];
}
if(is_swap){
vs rs_(w,string(h,'0'));
rep(i,0,h)rep(j,0,w) rs_[j][i]=rs[i][j];
rs=rs_;
}
output(rs);
}
int main(){
cin.tie(0)->sync_with_stdio(0);
ll q;
cin>>q;
while(q--){
ll h,w;
cin>>h>>w;
solve(h,w);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1011 1110 18 11101110 10111011 11101110
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3712kb
input:
361 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 3 2 3 3 3 4 3 5 3 6 3 7 3 8 3 9 3 10 3 11 3 12 3 13 3 14 3 15 3 16 3 17 3 18 3 19 3 20 4 2 4 3 4 4 4 5 4 6 4 7 4 8 4 9 4 10 4 11 4 12 4 13 4 14 4 15 4 16 4 17 4 18 4 19 4 20 5 2 5 3 5 4 5 5 5 6 5 7 5 8 5 9 5 1...
output:
4 11 11 6 111 111 6 1110 1011 8 11101 10111 9 111011 101110 11 1110111 1011101 12 11101110 10111011 14 111011101 101110111 15 1110111011 1011101110 17 11101110111 10111011101 18 111011101110 101110111011 20 1110111011101 1011101110111 21 11101110111011 10111011101110 23 111011101110111 1011101110111...
result:
wrong answer ans finds a larger answer (test case 103)