Submission #236734

#TimeUsernameProblemLanguageResultExecution timeMemory
236734VimmerAutomobil (COCI17_automobil)C++14
100 / 100
26 ms16128 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#pragma GCC optimize("unroll-loops") //#pragma GCC optimize("-O3") //#pragma GCC optimize("Ofast") //#pragma GCC optimize("fast-math") //#pragma GCC optimize("no-stack-protector") #define F first #define S second #define sz(x) int(x.size()) #define pb push_back #define N 1000001 #define M ll(1e9 + 7) #define inf 1e9 + 1e9 using namespace std; //using namespace __gnu_pbds; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef short int si; typedef array <int, 2> a2; //typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; ll fx(ll x, ll y) {return (x * y) % M;} ll sm(ll x, ll y) {return (x + y) % M;} ll row[N], cow[N]; int main() { //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout); ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; for (int i = 0; i < n; i++) row[i] = 1; for (int i = 0; i < m; i++) cow[i] = 1; for (int i = 0; i < k; i++) { char c; cin >> c; ll x, val; cin >> x >> val; x--; if (c == 'R') row[x] = fx(row[x], val); else cow[x] = fx(cow[x], val); } ll ans = 0, smr = 0, real_sm = 0; for (int i = 0; i < n; i++) { smr = sm(smr, fx(row[i], fx(i, m))); real_sm = sm(real_sm, row[i]); } for (int i = 0; i < m; i++) { ll val = sm(smr, fx(real_sm, i + 1)); val = fx(val, cow[i]); ans = sm(ans, val); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...