| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 648500 | inksamurai | Automobil (COCI17_automobil) | C++17 | 29 ms | 15992 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 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;
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		int cof=ro[i];
		int now=(i-1)*m%mod;
		now*=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);
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
