QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #293296 | #6309. Aqre | maxrgby | WA | 4ms | 3560kb | C++14 | 3.1kb | 2023-12-29 03:40:04 | 2023-12-29 03:40:05 |
Judging History
answer
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
int win[4][4] = {{1,1,0,1},{1,1,1,0},{1,0,1,1},{0,1,1,1}};
int win2[4][4] = {{1,1,1,0},{1,0,1,1},{1,1,0,1},{0,1,1,1}};
int win3[4][4] = {{1,1,1,0},{1,1,0,1},{0,1,1,1},{1,0,1,1}};
int win4[4][4] = {{1,1,1,0},{0,1,1,1},{1,1,0,1},{1,0,1,1}};
int main() {
int t;
cin >> t;
while(t--){
int n,m;
cin >> n >> m;
if(n < 4 and m < 4){
cout << n*m << endl;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
cout << 1;
}
cout << endl;
}
}else if(n == 2){
cout << n*m-((m)/4+(m+2)/4) << endl;
for(int i = 0;i < m;i++){
if(i % 4 == 3){
cout << 0;
}else{
cout << 1;
}
}
cout << endl;
for(int i = 0;i < m;i++){
if(i % 4 == 1){
cout << 0;
}else{
cout << 1;
}
}
cout << endl;
}else if(m == 2){
cout << n*m-((n+2)/4+(n)/4) << endl;
for(int i = 0;i < n;i++){
if(i % 4 == 3){
cout << 10;
}else if(i % 4 == 1){
cout << "01";
}else{
cout << 11;
}
cout << endl;
}
}else if(n == 3){
cout << n*m-((m)/4+(m)/4+(m+2)/4) << endl;
for(int i = 0;i < m;i++){
if(i % 4 == 3){
cout << 0;
}else{
cout << 1;
}
}
cout << endl;
for(int i = 0;i < m;i++){
if(i % 4 == 1){
cout << 0;
}else{
cout << 1;
}
}
cout << endl;
for(int i = 0;i < m;i++){
if(i % 4 == 3){
cout << 0;
}else{
cout << 1;
}
}
cout << endl;
}else if(m == 3){
cout << n*m-((n)/4+(n)/4+(n+2)/4) << endl;
for(int i = 0;i < n;i++){
if(i % 4 == 3){
cout << "010";
}else if(i % 4 == 1){
cout << 101;
}else{
cout << 111;
}
cout << endl;
}
}else if(n % 4 == 0 or m % 4 == 0){
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
if(win2[i%4][j%4] == 0){
cnt++;
}
}
}
cout << n*m-cnt << endl;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
cout << win2[i%4][j%4];
}
cout << endl;
}
}else if((n % 4 == 1 and m % 4 == 3) or (n % 4 == 3 and m % 4 == 1)){
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
if(win4[i%4][j%4] == 0){
cnt++;
}
}
}
cout << n*m-cnt << endl;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
cout << win4[i%4][j%4];
}
cout << endl;
}
}else if(m % 4 != 0){
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
if(win[i%4][j%4] == 0){
cnt++;
}
}
}
cout << n*m-cnt << endl;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
cout << win[i%4][j%4];
}
cout << endl;
}
}else{
int cnt = 0;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
if(win3[i%4][j%4] == 0){
cnt++;
}
}
}
cout << n*m-cnt << endl;
for(int i = 0;i < n;i++){
for(int j = 0;j < m;j++){
cout << win3[i%4][j%4];
}
cout << endl;
}
}
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
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: 4ms
memory: 3376kb
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 1s are not connected. (test case 99)