oj.uz

답안 #236721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236721 2020-06-03T06:44:28 Z Vimmer 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>

//#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 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;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
        {
            ll val = i * m + j + 1;

            ll md = fx(cow[j], row[i]);

            val = fx(val, md);

            ans = (ans + val) % M;
        }

    cout <<  ans << endl;
}

Subtask #1
50.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 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 8 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 8 ms 384 KB Output is correct
11 Execution timed out 1096 ms 2816 KB Time limit exceeded
12 Execution timed out 1095 ms 8704 KB Time limit exceeded
13 Execution timed out 1054 ms 1152 KB Time limit exceeded
14 Execution timed out 1082 ms 10112 KB Time limit exceeded
15 Execution timed out 1094 ms 9088 KB Time limit exceeded
16 Execution timed out 1095 ms 16000 KB Time limit exceeded
17 Execution timed out 1067 ms 16000 KB Time limit exceeded
18 Execution timed out 1101 ms 16000 KB Time limit exceeded
19 Execution timed out 1100 ms 16000 KB Time limit exceeded
20 Execution timed out 1055 ms 16000 KB Time limit exceeded