oj.uz

답안 #536287

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536287 2022-03-12T18:01:45 Z Stickfish Plus Minus (BOI17_plusminus) C++17
0 / 100
 0 ms 212 KB 
#include <iostream>
#include <map>
using namespace std;
using ll = long long;

const int MAXN = 1e5 + 123;
const ll MOD = 1000000007;

ll pw(ll a, ll m) {
    if (!m)
        return 1;
    a %= MOD;
    if (m % 2)
        return a * pw(a, m - 1) % MOD;
    return pw(a * a, m / 2);
}

signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    map<int, int> mprow;
    map<int, int> mpcellar;
    bool row = true, cellar = true;
    int chess = -1;
    while (k--) {
        char c, i, j;
        cin >> c >> i >> j;
        --i, --j;
        int t = (c == '+');
        if (mprow.find(i) != mprow.end()) {
            if (mprow[i] != (j + t) % 2)
                row = false;
        } else {
            mprow[i] = (j + t) % 2;
        }
        if (mpcellar.find(j) != mpcellar.end()) {
            if (mpcellar[j] != (i + t) % 2)
                cellar = false;
        } else {
            mpcellar[j] = (i + t) % 2;
        }
        if (chess == -1) {
            chess = (i + j + t) % 2;
        } else if (chess != (i + j + t) % 2)
            chess = -2;
    }
    ll ans = 0;
    if (row)
        ans += pw(2, n - mprow.size());
    if (cellar)
        ans += pw(2, m - mpcellar.size());
    if (row && cellar) {
        if (k == 0) {
            ans -= 2;
        } else if (chess != -2) {
            --ans;
        }
    }
    cout << (ans + MOD) % MOD << endl;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -