oj.uz

Submission #372355

# Submission time Handle Problem Language Result Execution time Memory
372355 2021-02-27T19:57:40 Z dolphingarlic Plus Minus (BOI17_plusminus) C++14
100 / 100
 290 ms 57324 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const ll MOD = 1e9 + 7;

ll expo(ll base, int pow) {
    ll ans = 1;
    while (pow) {
        if (pow & 1) ans = (ans * base) % MOD;
        pow >>= 1;
        base = (base * base) % MOD;
    }
    return ans;
}

ll count_ways(int n, int m, map<int, vector<pair<int, char>>> mp) {
    for (auto& i : mp) {
        bool sgn = (i.second[0].first & 1) ^ (i.second[0].second == '+');
        for (pair<int, char> j : i.second) {
            bool needed = (j.first & 1) ^ (j.second == '+');
            if (sgn ^ needed) return 0;
        }
    }
    return expo(2, n - mp.size());
}

int check_both(int n, int m, map<int, vector<pair<int, char>>> mp) {
    if (mp.size() == 0) return 2;
    bool sgn = (mp.begin()->first & 1) ^ (mp.begin()->second[0].first & 1) ^ (mp.begin()->second[0].second == '+');
    for (auto& i : mp) {
        for (pair<int, char> j : i.second) {
            bool needed = (i.first & 1) ^ (j.first & 1) ^ (j.second == '+');
            if (sgn ^ needed) return 0;
        }
    }
    return 1;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;
    map<int, vector<pair<int, char>>> horiz, vert;
    while (k--) {
        char c;
        int x, y;
        cin >> c >> x >> y;
        horiz[x].push_back({y, c});
        vert[y].push_back({x, c});
    }
    cout << (count_ways(n, m, horiz) + count_ways(m, n, vert) - check_both(n, m, horiz)) % MOD;
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 45 ms 6252 KB Output is correct
17 Correct 45 ms 6252 KB Output is correct
18 Correct 46 ms 6248 KB Output is correct
19 Correct 44 ms 6124 KB Output is correct
20 Correct 44 ms 6124 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 45 ms 6252 KB Output is correct
17 Correct 45 ms 6252 KB Output is correct
18 Correct 46 ms 6248 KB Output is correct
19 Correct 44 ms 6124 KB Output is correct
20 Correct 44 ms 6124 KB Output is correct
21 Correct 234 ms 35052 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 216 ms 35180 KB Output is correct
24 Correct 217 ms 34924 KB Output is correct
25 Correct 220 ms 34924 KB Output is correct
26 Correct 225 ms 47852 KB Output is correct
27 Correct 226 ms 47852 KB Output is correct
28 Correct 229 ms 47852 KB Output is correct
29 Correct 236 ms 47852 KB Output is correct
30 Correct 290 ms 57324 KB Output is correct