#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3Rz7lEu ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
const int mod=1000000007;
signed main(){
_3Rz7lEu;
int n,m,q;
cin>>n>>m>>q;
vi ro(n+1,1);
vi co(m+1,1);
rep(_,q){
char ch;
int x,y;
cin>>ch;
cin>>x>>y;
if(ch=='R'){
ro[x]*=y;
ro[x]%=mod;
}else{
co[x]*=y;
co[x]%=mod;
}
}
int sun=0;
for(int i=1;i<=m;i++){
sun+=co[i];
sun%=mod;
}
// print(sun);
int ans=0;
for(int i=1;i<=n;i++){
int cof=ro[i];
int now=(i-1)*m*sun;
now%=mod;
now*=cof;
now%=mod;
ans+=now;
ans%=mod;
}
sun=0;
for(int i=1;i<=n;i++){
sun+=ro[i];
sun%=mod;
}
for(int i=1;i<=m;i++){
int cof=co[i];
int now=sun*i%mod;
now*=cof;
now%=mod;
ans+=now;
ans%=mod;
}
print(ans);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
328 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
324 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Incorrect |
4 ms |
2772 KB |
Output isn't correct |
12 |
Incorrect |
13 ms |
8700 KB |
Output isn't correct |
13 |
Correct |
1 ms |
836 KB |
Output is correct |
14 |
Correct |
15 ms |
10052 KB |
Output is correct |
15 |
Incorrect |
13 ms |
9064 KB |
Output isn't correct |
16 |
Incorrect |
24 ms |
15956 KB |
Output isn't correct |
17 |
Incorrect |
25 ms |
16004 KB |
Output isn't correct |
18 |
Incorrect |
24 ms |
15944 KB |
Output isn't correct |
19 |
Incorrect |
26 ms |
15956 KB |
Output isn't correct |
20 |
Incorrect |
24 ms |
15964 KB |
Output isn't correct |