oj.uz

Submission #293200

# Submission time Handle Problem Language Result Execution time Memory
293200 2020-09-07T18:24:23 Z Hehehe Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 410 ms 103412 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 4e3 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

int n, m, I[N][N];
char a[N][N];

void solve(){

    cin >> n >> m;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> a[i][j];
        }
    }

    for(int j = 1; j <= m; j++){
        for(int i = n; i >= 1; i--){
            I[i][j] = I[i + 1][j] + (a[i][j] == 'I');
        }
    }

    int ans = 0;

    for(int i = 1; i <= n; i++){
        int J = 0;
        for(int j = 1; j <= m; j++){
            if(a[i][j] == 'J')J += I[i][j];
            if(a[i][j] == 'O')ans += J;
        }
    }

    cout << ans << '\n';
}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 8 ms 6084 KB Output is correct
15 Correct 2 ms 3872 KB Output is correct
16 Correct 5 ms 3584 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 10 ms 6528 KB Output is correct
19 Correct 9 ms 6400 KB Output is correct
20 Correct 9 ms 6400 KB Output is correct
21 Correct 10 ms 6528 KB Output is correct
22 Correct 8 ms 6400 KB Output is correct
23 Correct 11 ms 6400 KB Output is correct
24 Correct 10 ms 6528 KB Output is correct
25 Correct 9 ms 6400 KB Output is correct
26 Correct 9 ms 6400 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1280 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 1 ms 1280 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 8 ms 6084 KB Output is correct
15 Correct 2 ms 3872 KB Output is correct
16 Correct 5 ms 3584 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 10 ms 6528 KB Output is correct
19 Correct 9 ms 6400 KB Output is correct
20 Correct 9 ms 6400 KB Output is correct
21 Correct 10 ms 6528 KB Output is correct
22 Correct 8 ms 6400 KB Output is correct
23 Correct 11 ms 6400 KB Output is correct
24 Correct 10 ms 6528 KB Output is correct
25 Correct 9 ms 6400 KB Output is correct
26 Correct 9 ms 6400 KB Output is correct
27 Correct 375 ms 99008 KB Output is correct
28 Correct 10 ms 19072 KB Output is correct
29 Correct 16 ms 8064 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 276 ms 75256 KB Output is correct
32 Correct 366 ms 103140 KB Output is correct
33 Correct 374 ms 103144 KB Output is correct
34 Correct 323 ms 87288 KB Output is correct
35 Correct 364 ms 103008 KB Output is correct
36 Correct 365 ms 103256 KB Output is correct
37 Correct 410 ms 103412 KB Output is correct
38 Correct 252 ms 74836 KB Output is correct
39 Correct 250 ms 75036 KB Output is correct