# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135702 | 2019-07-24T09:53:25 Z | khsoo01 | Plus Minus (BOI17_plusminus) | C++11 | 237 ms | 15084 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; const ll mod = 1e9+7; ll n, m, k, tot, rc, cc, ans; map<ll, ll> row, col; bool rv, cv, tv; ll two (ll A) { if(!A) return 1; ll ret = two(A/2); ret = ret * ret % mod; if(A&1) ret = ret * 2 % mod; return ret; } int main() { scanf("%lld%lld%lld",&n,&m,&k); for(int i=1;i<=k;i++) { ll A, B, C; char T[2]; scanf("%s%lld%lld",T,&A,&B); C = (T[0] == '+'); ll X = ((A^B^C)&1)+1; if(row[A]) { if(row[A] != X) rv = true; } else { row[A] = X; rc++; } if(col[B]) { if(col[B] != X) cv = true; } else { col[B] = X; cc++; } if(tot) { if(tot != X) tv = true; } else tot = X; } if(!rv) ans = (ans + two(n-rc)) % mod; if(!cv) ans = (ans + two(m-cc)) % mod; if(!tv) ans = (ans + mod - 1) % mod; if(!k) ans = (ans + mod -1) % mod; printf("%lld\n",ans); }
Compilation message
# | 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 | 252 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 356 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
# | 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 | 252 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 356 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 3 ms | 380 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Correct | 3 ms | 376 KB | Output is correct |
15 | Correct | 3 ms | 368 KB | Output is correct |
16 | Correct | 63 ms | 1372 KB | Output is correct |
17 | Correct | 63 ms | 1400 KB | Output is correct |
18 | Correct | 63 ms | 1396 KB | Output is correct |
19 | Correct | 61 ms | 1400 KB | Output is correct |
20 | Correct | 62 ms | 1400 KB | Output is correct |
# | 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 | 252 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 356 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Correct | 3 ms | 380 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 2 ms | 376 KB | Output is correct |
14 | Correct | 3 ms | 376 KB | Output is correct |
15 | Correct | 3 ms | 368 KB | Output is correct |
16 | Correct | 63 ms | 1372 KB | Output is correct |
17 | Correct | 63 ms | 1400 KB | Output is correct |
18 | Correct | 63 ms | 1396 KB | Output is correct |
19 | Correct | 61 ms | 1400 KB | Output is correct |
20 | Correct | 62 ms | 1400 KB | Output is correct |
21 | Correct | 168 ms | 9200 KB | Output is correct |
22 | Correct | 2 ms | 376 KB | Output is correct |
23 | Correct | 185 ms | 9092 KB | Output is correct |
24 | Correct | 162 ms | 9124 KB | Output is correct |
25 | Correct | 171 ms | 9160 KB | Output is correct |
26 | Correct | 210 ms | 12588 KB | Output is correct |
27 | Correct | 182 ms | 12544 KB | Output is correct |
28 | Correct | 218 ms | 12528 KB | Output is correct |
29 | Correct | 193 ms | 12672 KB | Output is correct |
30 | Correct | 237 ms | 15084 KB | Output is correct |