oj.uz

Submission #947369

# Submission time Handle Problem Language Result Execution time Memory
947369 2024-03-16T03:50:48 Z steveonalex Bitaro the Brave (JOI19_ho_t1) C++11
100 / 100
 140 ms 89932 KB 
#include <bits/stdc++.h>


 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 3009;
int sum1[N][N], sum2[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<string> a(n);
    for(int i= 0; i<n; ++i) cin >> a[i];

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

    for(int i= 0; i<n; ++i)
    for(int j = m-1; j>=0; --j) sum1[i][j] += sum1[i][j+1];

    for(int i = n-1; i>=0; --i)
    for(int j = 0; j<m; ++j) sum2[i][j] += sum2[i+1][j];

    ll ans=  0;
    for(int i = 0; i<n; ++i)
    for(int j = 0; j<m; ++j) if (a[i][j] == 'J'){
        ans += sum1[i][j] * sum2[i][j];
    }

    cout << ans << "\n";
 
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4568 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4568 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 6 ms 15196 KB Output is correct
15 Correct 2 ms 12664 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 15444 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 5 ms 15324 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 3 ms 13400 KB Output is correct
24 Correct 5 ms 15196 KB Output is correct
25 Correct 3 ms 15196 KB Output is correct
26 Correct 3 ms 13148 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4568 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4564 KB Output is correct
14 Correct 6 ms 15196 KB Output is correct
15 Correct 2 ms 12664 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 5 ms 15444 KB Output is correct
19 Correct 4 ms 15196 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 5 ms 15324 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 3 ms 13400 KB Output is correct
24 Correct 5 ms 15196 KB Output is correct
25 Correct 3 ms 15196 KB Output is correct
26 Correct 3 ms 13148 KB Output is correct
27 Correct 131 ms 88728 KB Output is correct
28 Correct 6 ms 54876 KB Output is correct
29 Correct 5 ms 10124 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 94 ms 74932 KB Output is correct
32 Correct 72 ms 89540 KB Output is correct
33 Correct 63 ms 89532 KB Output is correct
34 Correct 113 ms 85252 KB Output is correct
35 Correct 85 ms 89488 KB Output is correct
36 Correct 68 ms 89424 KB Output is correct
37 Correct 140 ms 89932 KB Output is correct
38 Correct 49 ms 74836 KB Output is correct
39 Correct 47 ms 74912 KB Output is correct