QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#292089#6309. AqreQwertyPi#WA 2ms3620kbC++17968b2023-12-27 17:39:522023-12-27 17:39:52

Judging History

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

  • [2023-12-27 17:39:52]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3620kb
  • [2023-12-27 17:39:52]
  • 提交

answer

#include <bits/stdc++.h>

#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int) (a).size()
#define forn(i, n) for(int i = 0; i < (n); i++)

using namespace std;

bool b[1000][1000];
void solve(){
    int n, m; cin >> n >> m;
    if(n <= 3 && m <= 3){
        forn(i, n) forn(j, m) b[i][j] = 1;
    }else{
        forn(i, n) forn(j, m) {
            int ri = i % 4, rj = j % 4;
            if(ri == 3 && rj == 0 || ri == 1 && rj == 1 || ri == 2 && rj == 2 || ri == 0 && rj == 3){
                b[i][j] = 0;
            }else{
                b[i][j] = 1;
            }
        }
    }

    int total = 0;
    forn(i, n) forn(j, m) total += b[i][j];

    cout << total << '\n';
    forn(i, n) {
        forn(j, m) cout << b[i][j];
        cout << '\n';
    }
}

int32_t main(){
    cin.tie(0); cout.tie(0)->sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3620kb

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: 2ms
memory: 3584kb

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)