oj.uz

Submission #236734

# Submission time Handle Problem Language Result Execution time Memory
236734 2020-06-03T07:19:55 Z Vimmer Automobil (COCI17_automobil) C++14
100 / 100
 26 ms 16128 KB 
#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;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 8 ms 2816 KB Output is correct
12 Correct 17 ms 8704 KB Output is correct
13 Correct 5 ms 896 KB Output is correct
14 Correct 18 ms 10112 KB Output is correct
15 Correct 16 ms 9088 KB Output is correct
16 Correct 26 ms 16000 KB Output is correct
17 Correct 25 ms 16000 KB Output is correct
18 Correct 25 ms 16000 KB Output is correct
19 Correct 25 ms 16128 KB Output is correct
20 Correct 25 ms 16000 KB Output is correct