QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#79997#2921. Land EqualityperspectiveAC ✓3ms3724kbC++232.6kb2023-02-21 16:40:572023-02-21 16:40:58

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-21 16:40:58]
  • 评测
  • 测评结果:AC
  • 用时:3ms
  • 内存:3724kb
  • [2023-02-21 16:40:57]
  • 提交

answer

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

#define INP "input"
#define OUT "output"

/* some template */
template <typename T>
std::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {
    out << (int)a.size() << '\n';
    for (const auto& v : a) out << v << ' ';
    out << endl;
    return out;
}

template <typename T>
std::ostream& operator<<(std::ostream& out, const std::vector<vector<T> >& a) {
    out << (int)a.size() << '\n';
    for (const auto& v : a) {
        for (const auto& value : v) out << value << ' ';
        out << endl;
    }
    return out;
}

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}
/* end template */

const long long INF_LL = 1e18;
const int INF = 1e9 + 100;
const long double EPS = 1e-6;
const int BLOCK = 550;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

void open_file() {
#ifdef THEMIS
    freopen(INP ".txt", "r", stdin);
    freopen(OUT ".txt", "w", stdout);
#endif  // THEMIS
}

const int maxN = 1e6 + 100;
const int MOD = 1e9 + 7;

#define ll long long

int n, m, a[70][70];
int cnt[3];

void sol() {
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            cin >> a[i][j];

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cnt[a[i][j]]++;
        }
    }
    if (cnt[0] >= 2) {
        cout << 0;
    } else if (cnt[0] == 1) {
        if (cnt[1]) {
            if ((n > 1 && m > 1) || (n == 1 && a[1][1] == 1 || a[1][m] == 1) || (m == 1 && a[1][1] == 1 || a[n][1] == 1)) {
                cout << 1 << '\n';
            } else {
                cout << 2 << '\n';
            }
        } else {
            cout << 2 << '\n';
        }
    } else {
        ll k = (cnt[2] / 2);
        cout << abs((1LL << k) - (1LL << (cnt[2] - k)));
    }
}

void solve() {
    clock_t start, end;
    start = clock();
    int T = 1;
    // cin >> T;
    int TestCase = 0;
    while (T--) {
        TestCase += 1;
        cerr << "Processing test = " << TestCase << '\n';
        // cout << "Case #" << TestCase << ": ";
        sol();
        // if (T) cout << '\n';
    }
    end = clock();
    cerr << "Time = " << (double)(end - start) / (double)CLOCKS_PER_SEC << '\n';
}

int main(int argc, char* argv[]) {
    // srand(time(nullptr));
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);
    open_file();
    solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1 2
0 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

1 2
0 2

output:

2

result:

ok single line: '2'

Test #3:

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

input:

1 2
1 2

output:

1

result:

ok single line: '1'

Test #4:

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

input:

2 1
1
1

output:

0

result:

ok single line: '0'

Test #5:

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

input:

2 1
0
0

output:

0

result:

ok single line: '0'

Test #6:

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

input:

5 5
2 2 2 2 2
2 2 1 2 2
2 1 1 1 2
2 2 1 2 2
2 2 2 2 2

output:

0

result:

ok single line: '0'

Test #7:

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

input:

5 5
2 2 2 2 2
2 2 1 2 2
2 1 1 1 2
2 2 1 1 2
2 2 2 2 2

output:

512

result:

ok single line: '512'

Test #8:

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

input:

2 3
0 1 2
1 1 2

output:

1

result:

ok single line: '1'

Test #9:

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

input:

2 6
0 2 2 1 2 2
1 1 1 1 2 2

output:

1

result:

ok single line: '1'

Test #10:

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

input:

4 4
2 2 2 2
2 1 2 2
2 0 2 2
2 2 2 2

output:

1

result:

ok single line: '1'

Test #11:

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

input:

1 3
0 1 2

output:

2

result:

ok single line: '2'

Test #12:

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

input:

1 6
2 1 2 0 1 2

output:

2

result:

ok single line: '2'

Test #13:

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

input:

6 1
2
1
2
0
1
2

output:

2

result:

ok single line: '2'

Test #14:

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

input:

1 5
0 1 1 1 2

output:

2

result:

ok single line: '2'

Test #15:

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

input:

1 6
2 1 2 0 2 1

output:

1

result:

ok single line: '1'

Test #16:

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

input:

1 6
1 1 2 0 1 2

output:

1

result:

ok single line: '1'

Test #17:

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

input:

6 1
2
1
2
0
2
1

output:

1

result:

ok single line: '1'

Test #18:

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

input:

1 10
2 1 1 1 0 0 1 1 1 2

output:

0

result:

ok single line: '0'

Test #19:

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

input:

1 10
1 2 0 2 2 2 2 0 2 1

output:

0

result:

ok single line: '0'

Test #20:

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

input:

1 10
0 1 1 1 2 2 1 1 1 0

output:

0

result:

ok single line: '0'

Test #21:

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

input:

8 8
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 1 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2

output:

2147483648

result:

ok single line: '2147483648'

Test #22:

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

input:

8 8
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0

output:

0

result:

ok single line: '0'

Test #23:

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

input:

8 8
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1

output:

0

result:

ok single line: '0'

Test #24:

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

input:

8 8
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2

output:

0

result:

ok single line: '0'

Test #25:

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

input:

7 9
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2

output:

2147483648

result:

ok single line: '2147483648'

Test #26:

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

input:

31 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2

output:

0

result:

ok single line: '0'

Test #27:

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

input:

1 61
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

output:

1073741824

result:

ok single line: '1073741824'

Test #28:

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

input:

8 8
1 0 0 1 1 1 1 0
1 1 1 0 1 1 0 0
1 1 0 1 0 1 1 0
0 1 1 1 0 1 1 1
1 1 1 1 0 0 1 1
1 0 0 1 1 0 1 1
1 0 0 0 1 1 0 1
1 0 0 0 1 1 1 0

output:

0

result:

ok single line: '0'

Test #29:

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

input:

6 10
0 0 0 1 0 1 1 0 0 0
0 1 0 1 0 0 0 0 1 1
0 1 0 0 1 1 0 0 1 0
0 1 0 0 0 1 1 0 0 1
0 1 0 1 0 0 1 0 1 1
1 0 0 1 1 0 1 0 0 0

output:

0

result:

ok single line: '0'

Test #30:

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

input:

8 8
2 0 2 2 2 2 2 2
0 2 0 0 0 2 2 2
0 2 2 0 2 2 0 0
0 2 2 2 0 2 0 2
2 2 0 2 0 0 2 0
0 2 0 2 2 0 2 2
0 2 0 0 2 0 2 2
2 2 2 0 0 0 2 2

output:

0

result:

ok single line: '0'

Test #31:

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

input:

10 6
2 0 2 2 0 2
0 0 2 2 0 2
2 2 0 2 0 2
2 2 2 0 2 0
0 0 2 0 0 2
2 2 2 0 2 2
2 0 0 0 2 0
2 2 0 2 0 0
0 2 2 2 0 0
0 0 0 2 2 0

output:

0

result:

ok single line: '0'

Test #32:

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

input:

8 8
1 1 2 1 2 1 1 1
1 2 1 1 2 2 1 1
2 2 1 2 1 2 2 1
1 1 2 2 1 1 1 2
1 2 1 1 2 1 1 1
1 1 1 2 2 1 2 1
1 2 2 1 2 1 2 1
1 2 2 2 2 2 1 1

output:

8192

result:

ok single line: '8192'

Test #33:

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

input:

7 9
2 2 2 2 1 1 1 1 1
1 2 2 2 1 1 2 2 1
1 1 2 1 1 2 2 2 2
2 1 1 1 2 2 2 1 2
2 1 1 1 1 1 2 1 1
2 2 2 2 1 2 2 1 2
2 2 2 2 1 1 1 2 1

output:

65536

result:

ok single line: '65536'

Test #34:

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

input:

9 7
2 1 1 1 2 1 2
2 2 1 2 2 1 2
2 1 1 2 1 1 2
1 2 2 2 2 1 2
1 1 1 1 2 2 2
1 2 1 2 2 2 2
1 1 1 1 1 1 1
2 2 2 2 2 2 2
1 2 1 1 2 1 1

output:

65536

result:

ok single line: '65536'

Test #35:

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

input:

8 8
2 1 0 0 2 1 2 2
1 0 0 1 1 0 2 0
1 0 1 2 0 1 0 2
1 2 1 2 1 2 1 2
0 0 1 2 1 0 0 2
0 0 2 1 2 0 2 1
2 1 1 1 1 0 2 0
0 0 1 2 0 1 1 0

output:

0

result:

ok single line: '0'

Test #36:

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

input:

7 9
1 1 1 0 2 1 1 2 0
2 1 2 2 2 2 2 0 1
2 0 2 2 0 1 2 0 2
0 2 2 0 0 2 1 1 2
0 0 1 1 1 1 0 1 1
1 2 0 1 1 0 1 1 0
0 2 0 1 2 2 0 0 2

output:

0

result:

ok single line: '0'

Test #37:

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

input:

9 7
2 2 0 2 2 1 2
2 0 2 0 1 1 1
2 1 1 0 1 0 2
0 0 0 1 1 0 1
1 2 1 2 2 2 0
1 2 0 0 0 0 2
1 2 1 0 1 2 2
0 2 2 2 2 0 2
2 0 2 0 2 0 1

output:

0

result:

ok single line: '0'

Test #38:

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

input:

1 64
0 2 1 2 0 1 2 0 2 1 1 2 2 2 2 2 1 2 2 1 2 0 0 1 2 1 1 0 0 2 0 1 1 1 1 1 2 1 2 1 2 0 2 2 0 0 1 1 2 2 1 1 1 1 0 0 2 1 2 2 2 0 2 1

output:

0

result:

ok single line: '0'

Test #39:

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

input:

64 1
1
1
0
0
1
2
0
1
0
1
0
2
2
2
0
2
1
1
2
1
0
0
2
0
0
1
2
0
1
0
0
2
1
1
0
2
2
0
2
0
1
0
0
1
2
1
0
1
1
2
2
0
1
1
0
0
0
0
2
0
2
1
1
2

output:

0

result:

ok single line: '0'

Test #40:

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

input:

2 32
0 2 2 2 2 1 1 1 2 1 1 2 1 1 2 0 1 1 2 2 2 2 0 0 0 0 0 1 2 1 0 2
0 1 2 2 2 1 1 1 0 0 1 2 2 2 0 0 0 1 1 2 0 0 1 2 2 0 0 2 2 0 2 0

output:

0

result:

ok single line: '0'

Test #41:

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

input:

32 2
1 0
1 2
2 0
0 1
0 0
0 2
1 0
1 1
0 2
1 0
1 1
2 0
1 1
1 2
2 0
1 1
0 0
2 0
2 1
1 2
0 2
2 0
0 1
1 2
0 1
1 1
1 1
0 0
2 2
0 1
0 0
2 0

output:

0

result:

ok single line: '0'

Test #42:

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

input:

1 63
1 1 1 2 0 1 1 1 2 1 1 1 2 1 2 2 1 1 2 1 1 2 1 1 1 2 1 1 1 1 2 1 2 2 1 2 2 1 1 2 2 2 1 2 2 1 2 1 2 2 1 1 2 2 1 1 2 2 2 2 1 1 1

output:

1

result:

ok single line: '1'

Test #43:

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

input:

1 64
1 2 1 2 2 1 1 1 0 2 1 1 2 1 2 2 2 2 1 1 1 2 1 2 1 2 1 1 1 2 1 2 1 1 1 2 2 2 1 2 2 2 2 2 1 2 1 1 2 2 1 1 2 2 2 2 2 1 2 2 1 2 1 2

output:

1

result:

ok single line: '1'

Test #44:

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

input:

63 1
1
1
1
1
2
1
1
1
1
2
2
1
1
2
2
2
2
1
2
2
2
1
1
1
1
2
2
1
2
1
2
1
1
1
2
1
1
2
2
2
2
1
1
1
2
1
2
1
2
2
1
1
2
1
1
0
1
2
2
1
1
1
1

output:

1

result:

ok single line: '1'

Test #45:

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

input:

64 1
2
1
2
1
2
1
1
1
1
2
2
1
2
2
2
1
2
1
1
1
2
1
2
1
2
2
2
2
1
1
1
2
2
1
2
0
1
1
2
2
2
2
2
2
2
2
1
2
2
1
1
2
2
2
1
2
2
2
2
1
1
1
1
2

output:

2

result:

ok single line: '2'

Test #46:

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

input:

8 8
2 1 1 2 1 1 2 2
1 1 1 1 1 1 2 1
1 2 2 1 2 2 2 1
1 2 1 1 1 2 2 0
1 1 1 1 2 1 1 1
2 1 2 2 2 2 1 1
1 2 2 1 1 2 1 1
1 2 1 2 2 1 2 2

output:

1

result:

ok single line: '1'

Test #47:

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

input:

2 32
2 1 1 2 0 2 2 2 1 1 2 1 2 2 1 1 2 1 2 2 2 1 1 2 2 1 1 1 2 2 2 1
1 1 1 2 2 2 2 2 1 2 2 1 1 2 1 2 2 2 1 1 2 1 2 2 2 1 2 1 2 1 2 2

output:

1

result:

ok single line: '1'

Test #48:

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

input:

32 2
2 2
1 1
2 1
1 1
2 1
1 2
1 1
1 1
1 2
2 2
1 1
2 1
1 1
2 1
1 1
1 1
2 1
1 2
1 2
1 1
1 2
1 0
1 2
1 1
1 1
2 1
2 1
2 1
1 2
2 2
1 2
2 2

output:

1

result:

ok single line: '1'

Test #49:

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

input:

3 4
1 2 1 1
2 2 1 2
1 2 2 2

output:

8

result:

ok single line: '8'

Test #50:

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

input:

2 3
0 1 2
0 1 2

output:

0

result:

ok single line: '0'

Test #51:

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

input:

1 3
2 0 2

output:

2

result:

ok single line: '2'