QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#296959#6309. AqrewsyearAC ✓28ms11508kbC++145.3kb2024-01-03 20:27:042024-01-03 20:27:04

Judging History

This is the latest submission verdict.

  • [2024-01-03 20:27:04]
  • Judged
  • Verdict: AC
  • Time: 28ms
  • Memory: 11508kb
Show
  • [2024-01-03 20:27:04]
  • Submitted

answer

#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1010;

int n, m, flag, a[maxn][maxn], b[maxn][maxn];

void work() {
  cin >> n >> m, flag = (n > m);
  if (n <= 3 && m <= 3) {
    cout << n * m << '\n';
    rep (i, 1, n) {
      rep (j, 1, m) cout << 1;
      cout << "\n";
    }
    return;
  }
  if (n > m) swap(n, m);
  rep (i, 1, n) rep (j, 1, m) a[i][j] = 1;
  if (n == 2) {
    for (int j = 2; j <= m; j += 4) a[1][j] = 0;
    for (int j = 4; j <= m; j += 4) a[2][j] = 0;
  } else if (n == 3) {
    if (m % 4 == 2) {
      for (int j = 1; j <= m; j += 4) a[1][j] = 0;
      for (int j = 3; j <= m; j += 4) a[2][j] = 0;
      for (int j = 3; j <= m; j += 4) a[3][j] = 0;
    } else if (m % 4 == 1) {
      for (int j = 2; j <= m; j += 4) a[1][j] = 0;
      for (int j = 2; j <= m; j += 4) a[2][j] = 0;
      for (int j = 4; j <= m; j += 4) a[3][j] = 0;
    } else if (m % 4 == 3) {
      for (int j = 2; j <= m; j += 4) a[1][j] = 0;
      for (int j = 4; j <= m; j += 4) a[2][j] = 0;
      for (int j = 4; j <= m; j += 4) a[3][j] = 0;
    } else {
      for (int j = 1; j <= m; j += 4) a[1][j] = 0;
      for (int j = 1; j <= m; j += 4) a[2][j] = 0;
      for (int j = 3; j <= m; j += 4) a[3][j] = 0;
    }
  } else {
    rep (i, 1, n) {
      int beg = 0;
      if (n % 4 == 1) {
        if (m % 4 == 1) {
          if (i % 4 == 1) beg = 2;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 1;
          if (i % 4 == 0) beg = 4;
        } else if (m % 4 == 2) {
          if (i % 4 == 1) beg = 3;
          if (i % 4 == 2) beg = 1;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 4;
        } else if (m % 4 == 3) {
          if (i % 4 == 1) beg = 4;
          if (i % 4 == 2) beg = 1;
          if (i % 4 == 3) beg = 3;
          if (i % 4 == 0) beg = 2;
        } else {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 2;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 3;
        }
      } else if (n % 4 == 2) {
        if (m % 4 == 1) {
          if (i % 4 == 1) beg = 2;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 1;
          if (i % 4 == 0) beg = 4;
        } else if (m % 4 == 2) {
          if (i % 4 == 1) beg = 3;
          if (i % 4 == 2) beg = 4;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 1;
        } else if (m % 4 == 3) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 4;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 3;
        } else {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 4;
        }
      } else if (n % 4 == 3) {
        if (m % 4 == 1) {
          if (i % 4 == 1) beg = 2;
          if (i % 4 == 2) beg = 4;
          if (i % 4 == 3) beg = 3;
          if (i % 4 == 0) beg = 1;
        } else if (m % 4 == 2) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 2;
        } else if (m % 4 == 3) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 2;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 3;
        } else {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 2;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 3;
        }
      } else {
        if (m % 4 == 1) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 2;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 3;
        } else if (m % 4 == 2) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 4;
        } else if (m % 4 == 3) {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 2;
          if (i % 4 == 3) beg = 4;
          if (i % 4 == 0) beg = 3;
        } else {
          if (i % 4 == 1) beg = 1;
          if (i % 4 == 2) beg = 3;
          if (i % 4 == 3) beg = 2;
          if (i % 4 == 0) beg = 4;
        }
      }
      for (int j = beg; j <= m; j += 4) a[i][j] = 0;
    }
  }
  if (flag) {
    rep (i, 1, n) rep (j, 1, m) b[j][i] = a[i][j];
    swap(n, m);
  } else {
    rep (i, 1, n) rep (j, 1, m) b[i][j] = a[i][j];
  }
  int cnt = 0;
  rep (i, 1, n) rep (j, 1, m) cnt += b[i][j];
  cout << cnt << '\n';
  rep (i, 1, n) {
    rep (j, 1, m) cout << b[i][j];
    cout << '\n';
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3600kb

input:

3
2 2
3 4
3 8

output:

4
11
11
9
0111
0111
1101
18
01110111
01110111
11011101

result:

ok ok (3 test cases)

Test #2:

score: 0
Accepted
time: 2ms
memory: 3512kb

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
1011
1110
8
10111
11101
9
101110
111011
11
1011101
1110111
12
10111011
11101110
14
101110111
111011101
15
1011101110
1110111011
17
10111011101
11101110111
18
101110111011
111011101110
20
1011101110111
1110111011101
21
10111011101110
11101110111011
23
101110111011101
1110111011101...

result:

ok ok (361 test cases)

Test #3:

score: 0
Accepted
time: 22ms
memory: 4364kb

input:

100
91 91
91 92
91 93
91 94
91 95
91 96
91 97
91 98
91 99
91 100
92 91
92 92
92 93
92 94
92 95
92 96
92 97
92 98
92 99
92 100
93 91
93 92
93 93
93 94
93 95
93 96
93 97
93 98
93 99
93 100
94 91
94 92
94 93
94 94
94 95
94 96
94 97
94 98
94 99
94 100
95 91
95 92
95 93
95 94
95 95
95 96
95 97
95 98
95 9...

output:

6211
0111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101
1110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111
1101110111011101110...

result:

ok ok (100 test cases)

Test #4:

score: 0
Accepted
time: 24ms
memory: 5324kb

input:

16
247 247
247 248
247 249
247 250
248 247
248 248
248 249
248 250
249 247
249 248
249 249
249 250
250 247
250 248
250 249
250 250

output:

45757
0111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011
1011101110111011101110111011101110111011101110...

result:

ok ok (16 test cases)

Test #5:

score: 0
Accepted
time: 23ms
memory: 11500kb

input:

1
997 997

output:

745507
10111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111...

result:

ok ok (1 test case)

Test #6:

score: 0
Accepted
time: 22ms
memory: 11280kb

input:

1
997 998

output:

746255
11011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011...

result:

ok ok (1 test case)

Test #7:

score: 0
Accepted
time: 27ms
memory: 11500kb

input:

1
997 999

output:

747003
11101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #8:

score: 0
Accepted
time: 23ms
memory: 11504kb

input:

1
997 1000

output:

747750
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #9:

score: 0
Accepted
time: 24ms
memory: 11280kb

input:

1
998 997

output:

746255
10111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111...

result:

ok ok (1 test case)

Test #10:

score: 0
Accepted
time: 23ms
memory: 11280kb

input:

1
998 998

output:

747004
11011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011...

result:

ok ok (1 test case)

Test #11:

score: 0
Accepted
time: 23ms
memory: 11340kb

input:

1
998 999

output:

747752
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #12:

score: 0
Accepted
time: 23ms
memory: 11336kb

input:

1
998 1000

output:

748500
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #13:

score: 0
Accepted
time: 25ms
memory: 11336kb

input:

1
999 997

output:

747003
10111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111...

result:

ok ok (1 test case)

Test #14:

score: 0
Accepted
time: 22ms
memory: 11508kb

input:

1
999 998

output:

747752
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #15:

score: 0
Accepted
time: 23ms
memory: 11244kb

input:

1
999 999

output:

748501
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #16:

score: 0
Accepted
time: 24ms
memory: 11292kb

input:

1
999 1000

output:

749250
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #17:

score: 0
Accepted
time: 28ms
memory: 11340kb

input:

1
1000 997

output:

747750
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #18:

score: 0
Accepted
time: 28ms
memory: 11336kb

input:

1
1000 998

output:

748500
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #19:

score: 0
Accepted
time: 24ms
memory: 11340kb

input:

1
1000 999

output:

749250
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #20:

score: 0
Accepted
time: 23ms
memory: 11304kb

input:

1
1000 1000

output:

750000
01110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110...

result:

ok ok (1 test case)

Test #21:

score: 0
Accepted
time: 1ms
memory: 3440kb

input:

1
3 997

output:

2244
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #22:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

1
3 998

output:

2246
0111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011...

result:

ok ok (1 test case)

Test #23:

score: 0
Accepted
time: 1ms
memory: 3500kb

input:

1
3 999

output:

2249
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #24:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

1
3 1000

output:

2250
0111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011...

result:

ok ok (1 test case)

Test #25:

score: 0
Accepted
time: 0ms
memory: 7404kb

input:

1
997 3

output:

2244
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001...

result:

ok ok (1 test case)

Test #26:

score: 0
Accepted
time: 0ms
memory: 7404kb

input:

1
998 3

output:

2246
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111...

result:

ok ok (1 test case)

Test #27:

score: 0
Accepted
time: 0ms
memory: 7416kb

input:

1
999 3

output:

2249
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011
111
100
111
011...

result:

ok ok (1 test case)

Test #28:

score: 0
Accepted
time: 0ms
memory: 7536kb

input:

1
1000 3

output:

2250
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111
110
111
001
111...

result:

ok ok (1 test case)

Test #29:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

1
2 997

output:

1496
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #30:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

1
2 998

output:

1497
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #31:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

1
2 999

output:

1499
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #32:

score: 0
Accepted
time: 1ms
memory: 3428kb

input:

1
2 1000

output:

1500
1011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101...

result:

ok ok (1 test case)

Test #33:

score: 0
Accepted
time: 2ms
memory: 7296kb

input:

1
997 2

output:

1496
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
1...

result:

ok ok (1 test case)

Test #34:

score: 0
Accepted
time: 2ms
memory: 7524kb

input:

1
998 2

output:

1497
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
1...

result:

ok ok (1 test case)

Test #35:

score: 0
Accepted
time: 0ms
memory: 7412kb

input:

1
999 2

output:

1499
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
1...

result:

ok ok (1 test case)

Test #36:

score: 0
Accepted
time: 2ms
memory: 7364kb

input:

1
1000 2

output:

1500
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
11
10
11
01
1...

result:

ok ok (1 test case)
English 繁體中文 简体中文

Server Time: 2025-02-28 09:34:55 | OpenSource Project