oj.uz

Submission #199950

# Submission time Handle Problem Language Result Execution time Memory
199950 2020-02-04T10:37:43 Z mahmoudbadawy Automobil (COCI17_automobil) C++17
100 / 100
 40 ms 15992 KB 
#include <bits/stdc++.h>

using namespace std;


const int MOD=1e9+7,N=1e6+5;

long long r[N],c[N];
vector<int> rs,cs;
int n,m,k;
long long inv2;

long long poww(long long b,long long p)
{
	if(p==0) return 1;
	if(p&1) return (b*poww(b,p-1))%MOD;
	return poww((b*b)%MOD,p/2);
}

long long get(long long st,long long en,long long n)
{
	return ((((st+en)%MOD*n)%MOD)*inv2)%MOD;
}

int main()
{
	inv2=poww(2,MOD-2);
	cin >> n >> m >> k;
	for(int i=1;i<=n;i++)
		r[i]=1;
	for(int i=1;i<=m;i++)
		c[i]=1;
	for(int i=0;i<k;i++)
	{
		char x; int a,b;
		cin >> x >> a >> b;
		if(x=='R')
		{
			rs.push_back(a);
			r[a]=(r[a]*b)%MOD;
		}
		else
		{
			cs.push_back(a);
			c[a]=(c[a]*b)%MOD;
		}
	}
	sort(rs.begin(),rs.end()); rs.erase(unique(rs.begin(),rs.end()),rs.end());
	sort(cs.begin(),cs.end()); cs.erase(unique(cs.begin(),cs.end()),cs.end());
	long long ans=0;
	for(int i=1;i<=n;i++)
	{
		ans+=(get(1LL*(i-1)*m+1,1LL*i*m,m)*r[i])%MOD;
		ans%=MOD;
	}
	for(int i=1;i<=m;i++)
	{
		ans+=(get(i,i+1LL*(n-1)*m,n)*(c[i]-1))%MOD;
		ans=(ans+MOD)%MOD;
	}
	for(int i:rs)
	{
		for(int j:cs)
		{
			long long elem=(1LL*(i-1)*m+j)%MOD;
			ans-=(elem*(r[i]+c[j]-1))%MOD;
			ans+=((elem*r[i])%MOD)*c[j];
			ans%=MOD;
			ans=(ans+MOD)%MOD;
		}
	}
	cout << ans << endl;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 11 ms 2808 KB Output is correct
12 Correct 25 ms 8696 KB Output is correct
13 Correct 7 ms 888 KB Output is correct
14 Correct 23 ms 10100 KB Output is correct
15 Correct 24 ms 9080 KB Output is correct
16 Correct 38 ms 15992 KB Output is correct
17 Correct 40 ms 15992 KB Output is correct
18 Correct 38 ms 15992 KB Output is correct
19 Correct 38 ms 15992 KB Output is correct
20 Correct 39 ms 15992 KB Output is correct