oj.uz

Submission #118699

# Submission time Handle Problem Language Result Execution time Memory
118699 2019-06-19T12:23:12 Z M_H_H_7 Bitaro the Brave (JOI19_ho_t1) C++14
50 / 100
 70 ms 14200 KB 
//In The Name of Beauty
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define IB std::ios::sync_with_stdio(0);
#define pb(x) push_back(x);
#define mp(x,y) make_pair(x,y)
#define pll pair<ll,ll>
#define F first
#define S second
ll const MAXN = 2e3 + 8;
ll const INF  = 1e12 + 8;
ll const delta = 1000000007;
char table[MAXN][MAXN];
ll I[MAXN][MAXN], O[MAXN][MAXN];
int main()
{
    IB;
    cin.tie(0);
    cout.tie(0);
    ll n , m;
    cin >> n >> m;
    for(ll i = 1;i <= n;i++){
        for(ll j = 1;j <= m;j++)cin >> table[i][j];
    }
    for(ll i = 1;i <= n;i++){
        ll temp = 0;
        for(ll j = m;j >= 1;j--){
            temp += (table[i][j] == 'O');
            O[i][j] = temp;
        }
    }
    for(ll i = 1;i <= m;i++){
        ll temp = 0;
        for(ll j = n;j >= 1;j--){
            temp += (table[j][i] == 'I');
            I[j][i] = temp;
        }
    }
    ll ans = 0;
    for(ll i = 1;i <= n;i++){
        for(ll j = 1;j <= m;j++){
            if(table[i][j] != 'J')continue;
            ans += (I[i][j] * O[i][j]);
        }
    }
    cout << ans;
    return 0;
}
//Written by M_H_H_7

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 3 ms 1408 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 3 ms 1408 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 12 ms 8576 KB Output is correct
15 Correct 5 ms 4608 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 13 ms 9600 KB Output is correct
19 Correct 12 ms 9344 KB Output is correct
20 Correct 12 ms 9344 KB Output is correct
21 Correct 14 ms 9600 KB Output is correct
22 Correct 13 ms 9344 KB Output is correct
23 Correct 12 ms 9344 KB Output is correct
24 Correct 14 ms 9600 KB Output is correct
25 Correct 13 ms 9344 KB Output is correct
26 Correct 12 ms 9344 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 3 ms 1536 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 3 ms 1408 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 12 ms 8576 KB Output is correct
15 Correct 5 ms 4608 KB Output is correct
16 Correct 7 ms 5120 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 13 ms 9600 KB Output is correct
19 Correct 12 ms 9344 KB Output is correct
20 Correct 12 ms 9344 KB Output is correct
21 Correct 14 ms 9600 KB Output is correct
22 Correct 13 ms 9344 KB Output is correct
23 Correct 12 ms 9344 KB Output is correct
24 Correct 14 ms 9600 KB Output is correct
25 Correct 13 ms 9344 KB Output is correct
26 Correct 12 ms 9344 KB Output is correct
27 Runtime error 70 ms 14200 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -