#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll pw(ll a, ll b){
ll ret = 1;
while(b){
if(b&1)ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
int main(){
int n, m, k; cin >> n >> m >> k;
vector<pair<char,pair<int,int>>> v(k);
for(int i = 0; i < k; ++i){
cin >> v[i].first >> v[i].second.first >> v[i].second.second;
}
ll ans = 0;
{
map<int,int> M;
bool ok = 1;
for(int i = 0; i < k; ++i){
int x = ((v[i].second.second&1)^(v[i].first == '+'))+1;
if(M[v[i].second.first]){
if(M[v[i].second.first] != x){
ok = 0;
break;
}
}
M[v[i].second.first] = x;
}
if(ok)ans += pw(2,n-M.size());
ans%=MOD;
}
{
map<int,int> M;
bool ok = 1;
for(int i = 0; i < k; ++i){
int x = ((v[i].second.first&1)^(v[i].first == '+'))+1;
if(M[v[i].second.second]){
if(M[v[i].second.second] != x){
ok = 0;
break;
}
}
M[v[i].second.second] = x;
}
if(ok)ans += pw(2,m-M.size());
ans%=MOD;
}
{
bool ok = 1;
for(int i = 0; i < k; ++i){
if(((v[i].second.first+v[i].second.second)&1) ^ (v[i].first == '+')){
ok = 0;
break;
}
}
ans-=ok;
}
{
bool ok = 1;
for(int i = 0; i < k; ++i){
if(((v[i].second.first+v[i].second.second)&1) ^ (v[i].first == '-')){
ok = 0;
break;
}
}
ans-=ok;
}
cout << (ans+MOD) % MOD << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
304 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
48 ms |
2340 KB |
Output is correct |
17 |
Correct |
50 ms |
2380 KB |
Output is correct |
18 |
Correct |
47 ms |
2356 KB |
Output is correct |
19 |
Correct |
76 ms |
2352 KB |
Output is correct |
20 |
Correct |
76 ms |
2352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
300 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
304 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
48 ms |
2340 KB |
Output is correct |
17 |
Correct |
50 ms |
2380 KB |
Output is correct |
18 |
Correct |
47 ms |
2356 KB |
Output is correct |
19 |
Correct |
76 ms |
2352 KB |
Output is correct |
20 |
Correct |
76 ms |
2352 KB |
Output is correct |
21 |
Correct |
134 ms |
5580 KB |
Output is correct |
22 |
Correct |
1 ms |
296 KB |
Output is correct |
23 |
Correct |
57 ms |
2728 KB |
Output is correct |
24 |
Correct |
56 ms |
2720 KB |
Output is correct |
25 |
Correct |
58 ms |
2740 KB |
Output is correct |
26 |
Correct |
110 ms |
5836 KB |
Output is correct |
27 |
Correct |
104 ms |
5472 KB |
Output is correct |
28 |
Correct |
113 ms |
5992 KB |
Output is correct |
29 |
Correct |
131 ms |
6888 KB |
Output is correct |
30 |
Correct |
172 ms |
8236 KB |
Output is correct |