QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#254630 | #6309. Aqre | SATSKY | WA | 2ms | 3468kb | C++20 | 982b | 2023-11-18 13:27:12 | 2023-11-18 13:27:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;using ll=long long;const int M=998244353;
int xn,xm,tc;
struct sol
{
vector<vector<int>>mat;
sol(){mat.resize(4,vector<int>(4,1));}
}s[3];
struct S
{
int n,m,se;
void solve()
{
//n=xn,m=xm;cout<<n<<'/'<<m<<":\n";
cin>>n>>m;if(n<=3&&m<=3)se=2;else se=(n>4&&n%4==2&&m>4&&m%4==2);
int cnt=0;for(int i=0;i<n;i++)for(int j=0;j<m;j++)cnt+=s[se].mat[i%4][j%4];
cout<<cnt<<'\n';for(int i=0;i<n;i++,cout<<'\n')for(int j=0;j<m;j++)cout<<s[se].mat[i%4][j%4];
}
};
void precal()
{
s[0].mat[0][3]=s[0].mat[1][1]=s[0].mat[2][2]=s[0].mat[3][0]=0;
s[1].mat[0][3]=s[1].mat[1][2]=s[1].mat[2][0]=s[1].mat[3][1]=0;
}
int main()
{
//freopen("1.in","r",stdin);
//cout<<fixed<<setprecision(12);
ios::sync_with_stdio(0);cin.tie(0);
precal();
int t=1;cin>>t;
//clock_t a=clock();
//for(xn=2;xn<8;xn++)for(xm=2;xm<8;xm++)
while(t--)
{tc++;S SS;SS.solve(); }
//cout<<"Time:"<<double(clock()-a)<<'\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3436kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1011 1101 18 11101110 10111011 11011101
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3468kb
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 25)