oj.uz

Submission #237187

# Submission time Handle Problem Language Result Execution time Memory
237187 2020-06-05T06:55:34 Z kartel Automobil (COCI17_automobil) C++14
100 / 100
 38 ms 16000 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define MaxS N * N
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll r[N], c[N], ans, n, m, q, x, y, i, j;
char cmd;

ll mult(ll x, ll y) {return (x * y) % M;}
ll sum(ll x, ll y) {return (x + y) % M;}
ll mi(ll x, ll y) {return (x - y + M) % M;}

ll bp(ll x, ll y)
{
    if (y == 0) return 1ll;
    if (y % 2) return mult(x, bp(x, y - 1));
    ll a = bp(x, y / 2);
    return mult(a, a);
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> m >> q;

    ans = 0;
    for (i = 1; i <= n; i++)
    {
        r[i] = 1;
    }

    for (i = 1; i <= m; i++)
    {
        c[i] = 1;
    }

    while (q--)
    {
        cin >> cmd >> x >> y;
        if (cmd == 'R')
            r[x] = mult(r[x], y);
        else
            c[x] = mult(c[x], y);
    }

    ll sumc = 0;
    for (i = 1; i <= m; i++) sumc = sum(sumc, c[i]);

    ll sumcc = 0;
    for (i = 2; i <= m; i++) sumcc = sum(sumcc, mult(c[i], i - 1));

    for (i = 1; i <= n; i++)
        ans = sum(ans, mult(r[i], sum(mult(sumc, sum(mult(i - 1, m), 1)), sumcc)));

    cout << ans << el;

}

//  x ^ 2 + y ^ 2 = 1
//  x * a_i + y * b_i
//  a_i = -b_i * tan(alpha)
//  a_i / -b_i = tan(alpha)
//  alpha = atan(a_i / (-b_i))

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 10 ms 2944 KB Output is correct
12 Correct 23 ms 8704 KB Output is correct
13 Correct 6 ms 896 KB Output is correct
14 Correct 28 ms 10112 KB Output is correct
15 Correct 24 ms 9088 KB Output is correct
16 Correct 35 ms 16000 KB Output is correct
17 Correct 37 ms 16000 KB Output is correct
18 Correct 38 ms 16000 KB Output is correct
19 Correct 36 ms 16000 KB Output is correct
20 Correct 38 ms 16000 KB Output is correct