oj.uz

답안 #879192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879192 2023-11-26T18:01:27 Z MilosMilutinovic Plus Minus (BOI17_plusminus) C++14
100 / 100
 151 ms 14340 KB 
#include <bits/stdc++.h>

using namespace std;

const int md = 1e9 + 7;

int ckmul(int a, int b) {
  return a * 1LL * b % md;
}

int ckadd(int a, int b) {
  return a + b >= md ? a + b - md : a + b;
}

int powmod(int x, int k) {
  int res = 1;
  while (k) {
    if (k & 1) {
      res = ckmul(res, x);
    }
    x = ckmul(x, x);
    k >>= 1;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<char> c(k);
  vector<int> x(k);
  vector<int> y(k);
  for (int i = 0; i < k; i++) {
    cin >> c[i] >> x[i] >> y[i];
  }
  int ans = 0;
  {
    // row
    map<int, vector<int>> mp;
    for (int i = 0; i < k; i++) {
      mp[x[i]].push_back(i);
    }
    bool ok = true;
    for (auto& p : mp) {
      vector<vector<bool>> f(2, vector<bool>(2));
      for (int i : p.second) {
        int p = (y[i] % 2);
        int v = (c[i] == '+' ? 0 : 1);
        f[p][v] = true;
      }
      if ((f[0][0] && f[0][1]) || (f[1][0] && f[1][1]) || (f[0][0] && f[1][0]) || (f[0][1] && f[1][1])) {
        ok = false;  
      }
    }
    if (ok) {
      ans = ckadd(ans, powmod(2, n - (int) mp.size()));
    }
  }
  {
    // col
    map<int, vector<int>> mp;
    for (int i = 0; i < k; i++) {
      mp[y[i]].push_back(i);
    }
    bool ok = true;
    for (auto& p : mp) {
      vector<vector<bool>> f(2, vector<bool>(2, false));
      for (int i : p.second) {
        int p = (x[i] % 2);
        int v = (c[i] == '+' ? 0 : 1);
        f[p][v] = true;
      }
      if ((f[0][0] && f[0][1]) || (f[1][0] && f[1][1]) || (f[0][0] && f[1][0]) || (f[0][1] && f[1][1])) {
        ok = false;  
      }
    }
    if (ok) {
      ans = ckadd(ans, powmod(2, m - (int) mp.size()));
    }
  }
  {
    for (char ch : {'+', '-'}) {
      bool ok = true;
      for (int i = 0; i < k; i++) {
        char v = ((x[i] + y[i]) % 2 == 0 ? ch : (ch ^ '-' ^ '+'));
        if (v != c[i]) {
          ok = false;
        }
      }
      if (ok) {
        ans -= 1;
        if (ans < 0) {
          ans += md;
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 348 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 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 348 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 344 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 348 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 25 ms 2044 KB Output is correct
17 Correct 26 ms 1880 KB Output is correct
18 Correct 25 ms 1972 KB Output is correct
19 Correct 24 ms 2056 KB Output is correct
20 Correct 24 ms 2020 KB Output is correct

Subtask #3
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 360 KB Output is correct
2 Correct 0 ms 348 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 344 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 348 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 25 ms 2044 KB Output is correct
17 Correct 26 ms 1880 KB Output is correct
18 Correct 25 ms 1972 KB Output is correct
19 Correct 24 ms 2056 KB Output is correct
20 Correct 24 ms 2020 KB Output is correct
21 Correct 84 ms 7728 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 89 ms 9108 KB Output is correct
24 Correct 85 ms 9300 KB Output is correct
25 Correct 83 ms 9088 KB Output is correct
26 Correct 96 ms 12116 KB Output is correct
27 Correct 111 ms 12116 KB Output is correct
28 Correct 94 ms 11860 KB Output is correct
29 Correct 102 ms 12060 KB Output is correct
30 Correct 151 ms 14340 KB Output is correct