#include "bits/extc++.h"
using namespace std;
template <typename T>
void dbgh(const T& t) {
cerr << t << endl;
}
template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
cerr << t << " | ";
dbgh(u...);
}
#ifdef DEBUG
#define dbg(...) \
cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
<< ": "; \
dbgh(__VA_ARGS__)
#else
#define cerr \
if (false) \
cerr
#define dbg(...)
#endif
#define endl "\n"
#define long int64_t
#define sz(x) int((x).size())
const long mod = 1e9 + 7;
using V = vector<tuple<int, int, bool>>;
long bpow(long base, long exp) {
long ans = 1;
while (exp) {
if (exp & 1) {
ans = (ans * base) % mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return ans;
}
long check(int n, int m, const V &arr) {
map<int, bool> mp;
for (auto& [x, y, b] : arr) {
int cur = (y ^ b) & 1;
auto [it, inserted] = mp.emplace(x, cur);
if (it->second != cur) {
return 0;
}
}
return bpow(2, n - sz(mp));
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
V arr(k);
for (auto& [x, y, b] : arr) {
char c;
cin >> c >> x >> y;
x--;
y--;
b = c == '+';
}
long hori = check(n, m, arr);
for (auto& [x, y, b] : arr) {
swap(x, y);
}
long vert = check(m, n, arr);
long ans = hori + vert;
if (hori && vert) {
if (k) {
ans--;
} else {
ans -= 2;
}
}
ans %= mod;
if (ans < 0) {
ans += mod;
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cin.exceptions(ios::failbit);
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
320 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
320 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
15 ms |
2388 KB |
Output is correct |
17 |
Correct |
16 ms |
2444 KB |
Output is correct |
18 |
Correct |
16 ms |
2388 KB |
Output is correct |
19 |
Correct |
29 ms |
2396 KB |
Output is correct |
20 |
Correct |
28 ms |
2380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
320 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
15 ms |
2388 KB |
Output is correct |
17 |
Correct |
16 ms |
2444 KB |
Output is correct |
18 |
Correct |
16 ms |
2388 KB |
Output is correct |
19 |
Correct |
29 ms |
2396 KB |
Output is correct |
20 |
Correct |
28 ms |
2380 KB |
Output is correct |
21 |
Correct |
64 ms |
5544 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
20 ms |
2824 KB |
Output is correct |
24 |
Correct |
20 ms |
2748 KB |
Output is correct |
25 |
Correct |
19 ms |
2760 KB |
Output is correct |
26 |
Correct |
42 ms |
5848 KB |
Output is correct |
27 |
Correct |
38 ms |
5516 KB |
Output is correct |
28 |
Correct |
47 ms |
6004 KB |
Output is correct |
29 |
Correct |
73 ms |
7040 KB |
Output is correct |
30 |
Correct |
82 ms |
8224 KB |
Output is correct |