oj.uz

Submission #237186

# Submission time Handle Problem Language Result Execution time Memory
237186 2020-06-05T06:46:50 Z kartel Automobil (COCI17_automobil) C++14
50 / 100
 1000 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);
    }

    x = 1;
    for (i = 1; i <= n; i++)
       for (j = 1; j <= m; j++, x++) ans = sum(ans, mult(x, mult(r[i], c[j])));

    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
50.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 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 7 ms 384 KB Output is correct
6 Correct 6 ms 256 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Execution timed out 1090 ms 2816 KB Time limit exceeded
12 Execution timed out 1098 ms 8704 KB Time limit exceeded
13 Execution timed out 1092 ms 1024 KB Time limit exceeded
14 Execution timed out 1094 ms 10112 KB Time limit exceeded
15 Execution timed out 1099 ms 9088 KB Time limit exceeded
16 Execution timed out 1099 ms 16000 KB Time limit exceeded
17 Execution timed out 1095 ms 16000 KB Time limit exceeded
18 Execution timed out 1099 ms 16000 KB Time limit exceeded
19 Execution timed out 1095 ms 16000 KB Time limit exceeded
20 Execution timed out 1094 ms 16000 KB Time limit exceeded