oj.uz

Submission #132493

# Submission time Handle Problem Language Result Execution time Memory
132493 2019-07-19T04:33:03 Z 김세빈(#3198) Plus Minus (BOI17_plusminus) C++14
100 / 100
 64 ms 3972 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pll;

const ll mod = 1e9 + 7;

vector <pll> X, Y;
ll n, m, k, z, ans;

ll pow(ll a, ll b)
{
    ll ret = 1;
    
    for(; b; b>>=1){
        if(b & 1) ret = ret * a % mod;
        a = a * a % mod;
    }
    
    return ret;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    char S[3];
    ll i, j, x, y, s, t;
    
    cin >> n >> m >> k;
    
    if(k == 0){
        cout << (pow(2ll, n) + pow(2ll, m) + mod - 2) % mod << "\n";
        return 0;
    }
    
    for(i=0; i<k; i++){
        cin >> S >> x >> y;
        X.emplace_back(x, (*S == '+') ^ (y & 1));
        Y.emplace_back(y, (*S == '+') ^ (x & 1));
        z |= 1 << ((*S == '+') ^ ((x ^ y) & 1));
    }
    
    sort(X.begin(), X.end());
    
    s = pow(2ll, n);
    
    for(i=0; i<k; i=j){
        for(j=i, t=0; X[i].first == X[j].first; j++){
            t |= 1 << X[j].second;
        }
        if(t == 3) s = 0;
        else s = s * (mod + 1) / 2 % mod;
    }
    
    ans = s;
    
    sort(Y.begin(), Y.end());
    
    s = pow(2ll, m);
    
    for(i=0; i<k; i=j){
        for(j=i, t=0; Y[i].first == Y[j].first; j++){
            t |= 1 << Y[j].second;
        }
        if(t == 3) s = 0;
        else s = s * (mod + 1) / 2 % mod;
    }
    
    ans = (ans + s) % mod;
    
    if(z == 1 || z == 2){
        ans = (ans + mod - 1) % mod;
    }
    
    cout << ans << "\n";
    
    return 0;
}

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 376 KB Output is correct
3 Correct 2 ms 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 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 376 KB Output is correct
3 Correct 2 ms 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 49 ms 3812 KB Output is correct
17 Correct 49 ms 3940 KB Output is correct
18 Correct 50 ms 3812 KB Output is correct
19 Correct 47 ms 3812 KB Output is correct
20 Correct 48 ms 3856 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 376 KB Output is correct
3 Correct 2 ms 376 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 49 ms 3812 KB Output is correct
17 Correct 49 ms 3940 KB Output is correct
18 Correct 50 ms 3812 KB Output is correct
19 Correct 47 ms 3812 KB Output is correct
20 Correct 48 ms 3856 KB Output is correct
21 Correct 56 ms 3808 KB Output is correct
22 Correct 2 ms 416 KB Output is correct
23 Correct 55 ms 3784 KB Output is correct
24 Correct 57 ms 3832 KB Output is correct
25 Correct 60 ms 3972 KB Output is correct
26 Correct 55 ms 3808 KB Output is correct
27 Correct 53 ms 3812 KB Output is correct
28 Correct 53 ms 3812 KB Output is correct
29 Correct 54 ms 3808 KB Output is correct
30 Correct 64 ms 3940 KB Output is correct