QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#104929 | #6309. Aqre | jeffqi | WA | 2ms | 3456kb | C++23 | 1.2kb | 2023-05-12 15:30:39 | 2023-05-12 15:30:43 |
Judging History
answer
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
using namespace std;
LL read() {
LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
const int tst = 0,rd = 1; int getflg = 0;
namespace qiqi {
const int N = 1e3+5; int n,m,rev,a[N][N];
void main() {
int ans = 0;
n = read(); m = read();
if (m < n) {
rev = 1; swap(n,m);
}
if (n < 4) {
rep(i,1,n) rep(j,1,m) {
ans += a[i][j] = (j-1)%4 < 3;
}
}
else {
rep(i,1,n) rep(j,1,m) {
ans += a[i][j] = i%4 != j%4;
}
}
printf("%d\n",ans);
if (!rev) {
rep(i,1,n) {
rep(j,1,m) printf("%d",a[i][j]); puts("");
}
}
else {
rep(j,1,m) {
rep(i,1,n) printf("%d",a[i][j]); puts("");
}
}
}
}
int main() {
int T = read(); while (T--) qiqi::main(); return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3456kb
input:
3 2 2 3 4 3 8
output:
4 11 11 9 1110 1110 1110 18 11101110 11101110 11101110
result:
wrong answer 1s are not connected. (test case 3)