| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 81262 | ngot23 | Automobil (COCI17_automobil) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define rep(i, a, b) for(long long i=(a) ; i<=(b) ; ++i)
#define Task ""
using namespace std;
const int N=1000005;
const int mod=1000000007;
long long col[N], row[N], m, n, k;
long long 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;
long long x, y;
cin >> c >> x >> y;
if(c=='R') row[x]*=y;
else col[x]*=y;
}
long long val1=0, val2=0;
rep(i, 1, n) {
val1=(val1+1ll*col[i]*i)%mod;
val2=(val2+1ll*col[i]*n)%mod;
}
long long ans=0;
rep(i, 1, m) {
long long xx=(1ll*(i-1)*val2)%mod;
ans=(((0ll+val1+xx) % mod)*row[i]+ans)%mod;
}
cout << ans;
return 0;
}