oj.uz

Submission #134260

# Submission time Handle Problem Language Result Execution time Memory
134260 2019-07-22T09:58:49 Z Kastanda Plus Minus (BOI17_plusminus) C++11
100 / 100
 345 ms 11764 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 100005, Mod = 1e9 + 7;
int n, m, k;
map < int , int > R, C;
inline int Power(int a, int b)
{
    int ret = 1;
    for (; b; b >>= 1, a = 1LL * a * a % Mod)
        if (b & 1) ret = 1LL * ret * a % Mod;
    return (ret);
}
int main()
{
    cin >> n >> m >> k;
    if (!k)
        return !printf("%lld\n", (1LL * Power(2, n) + Power(2, m) - 2LL + Mod) % Mod);
    bool w = 0, f = 0;
    for (int i = 0; i < k; i ++)
    {
        int a, b; char c;
        cin >> c >> a >> b;
        bool tp = (a ^ b ^ (c == '+')) & 1;
        if (!i)
            w = tp;
        else if (w != tp)
            f = 1;
        R[a] |= 1 << ((b ^ (c == '+')) & 1);
        C[b] |= 1 << ((a ^ (c == '+')) & 1);
    }
    int tot = 0;
    bool fr = 0;
    for (auto X : R)
        fr |= (X.second == 3);
    if (!fr)
        tot = Power(2, n - (int)R.size());
    bool fc = 0;
    for (auto X : C)
        fc |= (X.second == 3);
    if (!fc)
        tot = (tot + Power(2, m - (int)C.size())) % Mod;
    if (!f)
        tot = (tot - 1 + Mod) % Mod;
    return !printf("%d\n", tot);
}

Subtask #1
12.0 / 12.0

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

Subtask #2
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 108 ms 1400 KB Output is correct
17 Correct 106 ms 1400 KB Output is correct
18 Correct 106 ms 1400 KB Output is correct
19 Correct 108 ms 1480 KB Output is correct
20 Correct 106 ms 1488 KB Output is correct

Subtask #3
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 108 ms 1400 KB Output is correct
17 Correct 106 ms 1400 KB Output is correct
18 Correct 106 ms 1400 KB Output is correct
19 Correct 108 ms 1480 KB Output is correct
20 Correct 106 ms 1488 KB Output is correct
21 Correct 227 ms 7276 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 219 ms 7260 KB Output is correct
24 Correct 228 ms 7472 KB Output is correct
25 Correct 243 ms 7548 KB Output is correct
26 Correct 265 ms 9976 KB Output is correct
27 Correct 277 ms 9944 KB Output is correct
28 Correct 296 ms 10096 KB Output is correct
29 Correct 273 ms 9972 KB Output is correct
30 Correct 345 ms 11764 KB Output is correct