# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097101 | vjudge1 | Automobil (COCI17_automobil) | C++17 | 49 ms | 65536 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>
using namespace std;
#define TEST 0
#define DEFINE_MOD 1
#if TEST == 1
ifstream din("C:\\code\\C++\\Project1\\Project1\\Input.txt");
ofstream dout("C:\\code\\C++\\Project1\\Project1\\Output.txt");
#else
#define din cin
#define dout cout
#endif
#if DEFINE_MOD == 1
#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
#define il pair<int,ll>
#define For(i,a,b) for(int i = a; i < b; ++i)
#define Forr(i,a,b) for(int i = a; i <= b; ++i)
#define Rep(i,a,b) for(int i = a; i > b; --i)
#define Repr(i,a,b) for(int i = a; i >= b; --i)
ll oo = 1e18 + 32;
ll mod = 1e9 + 7;
#else
#endif
int n, m,k;
vector<vector<ll>> a;
vector<ll> R, S;
void Input() {
din >> n >> m>>k;
a.resize(n + 1, vector<ll>(m + 1));
Forr(i, 1, n) {
Forr(j, 1, m) a[i][j] = (i - 1) * m + j;
}
}
void Build() {
R.resize(n + 7, 1);
S.resize(m + 7, 1);
while (k--) {
char type; din >> type;
int id, val; din >> id >> val;
if (type == 'R') {
R[id] = (R[id] % mod * val % mod) % mod;
}
else S[id] = (S[id] % mod * val % mod) % mod;
}
}
void Output() {
ll Res = 0;
Forr(i, 1, n) {
Forr(j, 1, m) {
ll val = (a[i][j] % mod * R[i] % mod * S[j] % mod) % mod;
Res = (Res % mod + val % mod) % mod;
}
}
dout << Res;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
Input();
Build();
Output();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |