#include<bits/stdc++.h>
#define rep(i, a, b) for(int i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int N=1000005;
const int mod=1000000007;
int col[N], row[N], m, n, k;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen(Task".inp", "r", stdin);
//freopen(Task".out", "w", stdout);
cin >> m >> n >> k;
rep(i, 1, m) row[i]=1;
rep(i, 1, n) col[i]=1;
rep(i, 1, k) {
char c;
int x, y;
cin >> c >> x >> y;
if(c=='R') row[x]*=y;
else col[x]*=y;
}
int val1=0, val2=0;
rep(i, 1, n) {
val1=(val1+1ll*col[i]*i)%mod;
val2=(val2+1ll*col[i]*n)%mod;
}
int ans=0;
rep(i, 1, m) {
int xx=1ll*(i-1)*val2%mod;
ans=(((0ll+val1+xx) % mod)*row[i]+ans)%mod;
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
380 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
552 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
564 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
564 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
580 KB |
Output isn't correct |
11 |
Correct |
5 ms |
1744 KB |
Output is correct |
12 |
Correct |
17 ms |
4688 KB |
Output is correct |
13 |
Incorrect |
3 ms |
4688 KB |
Output isn't correct |
14 |
Correct |
14 ms |
5500 KB |
Output is correct |
15 |
Incorrect |
12 ms |
5500 KB |
Output isn't correct |
16 |
Incorrect |
21 ms |
8444 KB |
Output isn't correct |
17 |
Incorrect |
22 ms |
8444 KB |
Output isn't correct |
18 |
Incorrect |
22 ms |
8444 KB |
Output isn't correct |
19 |
Correct |
21 ms |
8444 KB |
Output is correct |
20 |
Incorrect |
21 ms |
8444 KB |
Output isn't correct |