Submission #1305378

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305378		nikaa123	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	207 ms	150588 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
 
#define int long long 
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(), (x).end()
#define deb(x) cout << #x << "-" << x << endl
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;
 
const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,1,0,-1};
const double PI = 2 * acos(0.0);
 
const int N = 3e3+5;
 
int h,w;
string bd[N];
int cntr[N][N];
int cntc[N][N];

inline void test_case() {
    
    cin >> h >> w;
    for (int i = 1; i <= h; i++) {
        cin >> bd[i];
        bd[i] = " " + bd[i];
        for (int j = 1; j <= w; j++) {
            cntr[i][j] = cntr[i][j-1] +(bd[i][j] == 'O');
            cntc[j][i] = cntc[j][i-1] +(bd[i][j] == 'I');
        }
    }
    // for (int i = 1; i <= w; i++) cout << cntc[i] << endl;
    // for (int i = 1; i <= h; i++) cout << cntr[i] << endl;
    int ans = 0;
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            if (bd[i][j] == 'J') {
                // cout << i << " " << j << "---> " << cntr[i] << " " << cntc[j] << endl; 
                int r1 = cntr[i][w]-cntr[i][j];
                int r2 = cntc[j][h]-cntc[j][i];
                ans += (r1*r2);
            }
        }
    }
    cout << ans << endl;
    
}
 
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int T = 1;
    // cin >> T;
    while (T--) test_case();
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50