oj.uz

Submission #879193

# Submission time Handle Problem Language Result Execution time Memory
879193 2023-11-26T18:06:41 Z DAleksa Plus Minus (BOI17_plusminus) C++17
100 / 100
 112 ms 9808 KB 
#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

int add(int x, int y) { x += y; return (x >= mod ? x - mod : x); }
int mul(int x, int y) { return (x * 1LL * y) % mod; }

void sadd(int& x, int y) { x = add(x, y); }
void smul(int& x, int y) { x = mul(x, y); }

int pw(int a, int n) {
    if(n == 0) return 1;
    int x = pw(a, n / 2);
    smul(x, x);
    if(n % 2 == 1) smul(x, a);
    return x;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    map<int, char> col, row;
    bool can_col = true, can_row = true;
    for(int i = 0; i < k; i++) {
        char c;
        int x, y;
        cin >> c >> x >> y;
        char temp = col[x];
        if(y % 2 == 1) col[x] = c;
        else col[x] = (c ^ '+' ^ '-');
        if(temp == (col[x] ^ '+' ^ '-')) can_col = false;
        temp = row[y];
        if(x % 2 == 1) row[y] = c;
        else row[y] = (c ^ '+' ^ '-');
        if(temp == (row[y] ^ '+' ^ '-')) can_row = false;
    }
    int ans = 0;
    if(can_col) {
        int cnt = col.size();
        sadd(ans, pw(2, n - cnt));
    }
    if(can_row) {
        int cnt = row.size();
        sadd(ans, pw(2, m - cnt));
    }
    ans -= (can_col && can_row);
    ans -= (k == 0);
    cout << ans;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 43 ms 504 KB Output is correct
17 Correct 43 ms 608 KB Output is correct
18 Correct 42 ms 344 KB Output is correct
19 Correct 41 ms 348 KB Output is correct
20 Correct 41 ms 348 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 43 ms 504 KB Output is correct
17 Correct 43 ms 608 KB Output is correct
18 Correct 42 ms 344 KB Output is correct
19 Correct 41 ms 348 KB Output is correct
20 Correct 41 ms 348 KB Output is correct
21 Correct 88 ms 5972 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 101 ms 5932 KB Output is correct
24 Correct 88 ms 5972 KB Output is correct
25 Correct 89 ms 5968 KB Output is correct
26 Correct 112 ms 8128 KB Output is correct
27 Correct 86 ms 8080 KB Output is correct
28 Correct 88 ms 8052 KB Output is correct
29 Correct 87 ms 8124 KB Output is correct
30 Correct 112 ms 9808 KB Output is correct