QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#243783 | #6309. Aqre | Vengeful_Spirit# | WA | 0ms | 7360kb | C++14 | 1.5kb | 2023-11-08 17:16:37 | 2023-11-08 17:16:37 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int a[N][N];
void solve() {
int n, m;
cin >> n >> m;
if(n <= 3 && m <= 3) {
cout << n * m << "\n";
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
cout << "1";
}
cout << "\n";
}
return ;
}
int ans = 0;
for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) ans += a[i][j];
int flg = 0;
if(n % 4 == 1 && m % 4 == 1) flg = 1;
cout << ans - flg << "\n";
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(i == n && j == m) {
if(flg) cout << "0";
else cout << a[i][j];
} else {
cout << a[i][j];
}
}
cout << "\n";
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
for(int i = 1; i <= 1000; i += 4) {
for(int j = 1; j <= 1000; j += 4) {
for(int o : {0, 1, 2}) a[i][j + o] = 1;
for(int o : {0, 2, 3}) a[i + 1][j + o] = 1;
for(int o : {0, 1, 3}) a[i + 2][j + o] = 1;
for(int o : {1, 2, 3}) a[i + 3][j + o] = 1;
}
}
int T;
cin >> T;
for(int o = 1; o <= T; ++o) {
solve();
}
}
/*
11101110111
10111011101
11011101110
01110111011
11101110111
10111011101
11011101110
01110111011
11101110111
10111011101
11011101110
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 7324kb
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: 0ms
memory: 7360kb
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)