제출 #1185976

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185976		steveonalex	Plus Minus (BOI17_plusminus)	C++20	100 / 100	94 ms	10824 KiB

plusminus

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


 
const int MOD = 1e9 + 7;
struct Modular{
    ll x;
    Modular(ll _x = 0){
        x = _x % MOD;
        if (x < 0) x += MOD;
    }
    Modular& operator += (Modular y){
        x += y.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    Modular operator + (Modular y) {
        Modular tmp = *this;
        return tmp += y;
    }
 
    Modular& operator -= (Modular y){
        x -= y.x;
        if (x < 0) x += MOD;
        return *this;
    }
    Modular operator - (Modular y) {
        Modular tmp = *this;
        return tmp -= y;
    }
 
    Modular& operator *= (Modular y){
        x *= y.x;
        if (x >= MOD) x %= MOD;
        return *this;
    }
    Modular operator * (Modular y) {
        Modular tmp = *this;
        return tmp *= y;
    }
 
    bool operator == (Modular y){
        return x == y.x;
    }
    bool operator != (Modular y){
        return x != y.x;
    }
};
ostream& operator << (ostream& out, Modular x){
    out << x.x;
    return out;
}

Modular fast_pow(Modular a, int n){
    Modular ans = 1;
    while(n > 0){
        if (n & 1) ans *= a;
        a *= a;
        n >>= 1;
    }
    return ans;
}
Modular inverse(Modular a){return fast_pow(a, MOD - 2);}


void solve(){
    int n, m, k; cin >> n >> m >> k;
    if (k == 0){
        Modular ans = fast_pow(2, n) + fast_pow(2, m) - 2;
        cout << ans << "\n";
    }
    else {
        vector<array<int, 3>> a(k);
        for(int i = 0; i < k; ++i){
            char c; cin >> c;
            cin >> a[i][0] >> a[i][1];
            a[i][2] = (c == '+');
        }
        Modular ans = 0;

        map<int, int> row, column;
        for(auto i: a){
            int parity = (i[1] + i[2]) % 2;
            row[i[0]] |= MASK(parity);

            parity = (i[0] + i[2]) % 2;
            column[i[1]] |= MASK(parity);
        }

        bool check1 = true, check2 = true;
        for(pair<int, int> i: row) if (i.second == 3) check1 = false;
        for(pair<int, int> i: column) if (i.second == 3) check2 = false;

        if (check1){
            ans += fast_pow(2, n - row.size());
        }
        if (check2){
            ans += fast_pow(2, m - column.size());
        }

        // both grid is alternating
        bool check3 = true;
        for(int i = 1; i < k; ++i){
            int prev = (a[i-1][2] + a[i-1][0] + a[i-1][1]) % 2;
            int cur = (a[i][2] + a[i][0] + a[i][1]) % 2;

            if (prev != cur) check3 = false;
        }

        if (check3) ans -= Modular(1);

        cout << ans << "\n";
    }
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 42 / 42
• Subtask 3: 46 / 46