QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #218696 | #6743. water235 | Berlin_Jacor | WA | 4ms | 50568kb | C++14 | 777b | 2023-10-18 17:09:07 | 2023-10-18 17:09:08 |
Judging History
answer
#include<bits/stdc++.h>
//#define int long long
using namespace std;
//const int mod = 998244353;
map<int,int>p[1000005];
signed main() {
int n,m;
cin>>n>>m;
int ans=0;
if(n==1&&m==2) {
cout<<"2\n1 1";
return 0;
}
if(m==1&&n==2) {
cout<<"2\n1\n1";
return 0;
}
for(int i=1;i<=n;++i) {
for(int j=1;j<=m;++j) {
if(i==1&&j==1){p[i][j]=1;++ans;}
if(i==2&&j==2){p[i][j]=1;++ans;}
if(i==1&&j%2==0&&j>2){p[i][j]=1;++ans;}
if(j==1&&i%2==0&&i>2){p[i][j]=1;++ans;}
if(i==1&&j==m&&j>2){p[i][j]=1;++ans;}
if(i==n&&j==1&&i>2){p[i][j]=1;++ans;}
}
}
cout<<ans<<"\n";
for(int i=1;i<=n;++i) {
for(int j=1;j<=m;++j) {
if(p[i][j])
cout<<p[i][j]<<" ";
else cout<<"0 ";
}
cout<<"\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 50520kb
input:
2 1
output:
2 1 1
result:
ok The answer is correct.
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 50568kb
input:
3 3
output:
4 1 0 1 0 1 0 1 0 0
result:
wrong answer The answer is wrong: expected = 3, found = 4