oj.uz

답안 #536303

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

const ll MOD = 1000000007ll;

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

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

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 79 ms 1364 KB Output is correct
17 Correct 79 ms 1288 KB Output is correct
18 Correct 78 ms 1284 KB Output is correct
19 Correct 78 ms 1292 KB Output is correct
20 Correct 91 ms 1288 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 79 ms 1364 KB Output is correct
17 Correct 79 ms 1288 KB Output is correct
18 Correct 78 ms 1284 KB Output is correct
19 Correct 78 ms 1292 KB Output is correct
20 Correct 91 ms 1288 KB Output is correct
21 Correct 171 ms 9128 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 143 ms 9048 KB Output is correct
24 Correct 146 ms 9080 KB Output is correct
25 Correct 141 ms 9096 KB Output is correct
26 Correct 163 ms 12480 KB Output is correct
27 Correct 163 ms 12428 KB Output is correct
28 Correct 177 ms 12516 KB Output is correct
29 Correct 197 ms 12492 KB Output is correct
30 Correct 212 ms 14840 KB Output is correct