QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#103279#6309. AqreNerovix#WA 2ms3468kbC++201.8kb2023-05-04 23:24:522023-05-04 23:24:56

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-04 23:24:56]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3468kb
  • [2023-05-04 23:24:52]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define For(x, y, z) for(int x = (y); x <= (z); x++)
#define Rep(x, y, z) for(int x = (y); x >= (z); x--)
using namespace std;
const int MAXN = 1e3 + 5;
char buf[1 << 12], *pp1 = buf, *pp2 = buf, nc;
inline char gc() {
    return (pp1 == pp2) && (pp2 = (pp1 = buf) + fread(buf, 1, 1 << 12, stdin), pp1 == pp2) ? EOF : *pp1++;
}
inline int read() {
    int x = 0, ny = 1;
    for(; nc = gc(), (nc < 48 || nc > 57) && nc != EOF; ) 
        if(nc == '-') ny = -1;
    if(nc < 0) return nc;
    x = nc ^ 48;
    for(; nc = gc(), (nc >= 48 && nc <= 57 && nc != EOF); )
        x = (x << 3) + (x << 1) + (nc ^ 48);
    return x * ny;
}
int n, m, ans[MAXN][MAXN], s[4][4] = {{1, 0, 1, 1}, {0, 1, 1, 1}, {1, 1, 0, 1}, {1, 1, 1, 0}};
int ss[4][4] = {{0, 0, 1, 0}, {0, 1, 1, 1}, {1, 1, 0, 1}, {0, 1, 1, 1}};
void Solve() {
    n = read(), m = read();
    int cnt = 0;
    if((n == 2 && m == 2) || (n == 2 && m == 3) || (n == 3 && m == 2) || (n == 3 && m == 3)) {
        For(i, 1, n) For(j, 1, m) ans[i][j] = 1, cnt++;
    } else if(n == 3 || m == 3) {
        For(i, 1, n) For(j, 1, m) ans[i][j] = ss[i % 4][j % 4], cnt += ans[i][j];
    }
    else {
        For(i, 1, n) For(j, 1, m) 
            ans[i][j] = s[i % 4][j % 4], cnt += ans[i][j];
    }
    cout << cnt << '\n';
    For(i, 1, n) {
        For(j, 1, m) cout << ans[i][j];
        cout << '\n';
    }
}
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    for(int t = read(); t--; ) {
        Solve();
    }     
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3468kb

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: 1ms
memory: 3420kb

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 61)